A Class of Weakly Self-avoiding Walks

نویسندگان

  • PETER MÖRTERS
  • NADIA SIDOROVA
چکیده

We define a class of weakly self-avoiding walks on the integers by conditioning a simple random walk of length n to have a p-fold self-intersection local time smaller than nβ, where 1 < β < (p+1)/2. We show that the conditioned paths grow of order nα, where α = (p− β)/(p− 1), and also prove a coarse large deviation principle for the order of growth.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ballistic Phase of Self-Interacting Random Walks

We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the OrnsteinZernike theory developed in Campanino et al. (2003, 2004, 2007). It leads to local limit results for various observables (e.g., displacement of the en...

متن کامل

Weakly prudent self-avoiding bridges

We define and enumerate a new class of self-avoiding walks on the square lattice, which we call weakly prudent bridges. Their definition is inspired by two previously-considered classes of self-avoiding walks, and can be viewed as a combination of those two models. We consider several methods for recursively generating these objects, each with its own advantages and disadvantages, and use these...

متن کامل

A Self-avoiding Walk with Attractive Interactions

A powerful tool for the study of self-avoiding walks is the lace expansion of Brydges and Spencer [BS]. It is applicable above four dimensions and shows the mean-field behavior of self-avoiding walks, that is, critical exponents are those of the simple random walk. An extensive survey of random walks can be found in [MS]. The lace expansion was originally introduced for weakly self-avoiding wal...

متن کامل

Weakly directed self-avoiding walks

We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating function. This series has a complex singularity structure and in particular, is not D-finite. The growth constant is approximately 2.54 and is thus larger than that...

متن کامل

Self-avoiding walks and polygons on quasiperiodic tilings

We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices, these numbers depend on the chosen initial vertex. We compare different ways of counting and demonstrate that suitable averaging improves convergence to the asym...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008