相关论文: On the existence of critical exponents for self-av…

We prove existence of intersection exponents xi(k,lambda) for biased random walks on d-dimensional half-infinite discrete cylinders, and show that, as functions of lambda, these exponents are real analytic. As part of the argument, we prove…

We show how the theory of the critical behaviour of $d$-dimensional polymer networks gives a scaling relation for self-avoiding {\em bridges} that relates the critical exponent for bridges $\gamma_b$ to that of terminally-attached…

We consider the critical behaviour of the continuous-time weakly self-avoiding walk with contact self-attraction on $\mathbb{Z}^4$, for sufficiently small attraction. We prove that the susceptibility and correlation length of order $p$ (for…

We prove that for the $d$-regular tessellations of the hyperbolic plane by $k$-gons, there are exponentially more self-avoiding walks of length $n$ than there are self-avoiding polygons of length $n$. We then prove that this property…

Expected ballisticity of a continuous self avoiding walk on hyperbolic spaces $\mathbb{H}^d$ is established.

Self-avoiding walks are a simple and well-known model of long, flexible polymers in a good solvent. Polymers being pulled away from a surface by an external agent can be modelled with self-avoiding walks in a half-space, with a Boltzmann…

We consider long-range self-avoiding walk, percolation and the Ising model on $\mathbb{Z}^d$ that are defined by power-law decaying pair potentials of the form $D(x)\asymp|x|^{-d-\alpha}$ with $\alpha>0$. The upper-critical dimension…

The model of self-organizing Eulerian walkers is numerically investigated on the square lattice. The critical exponents for the distribution of a number of steps ($\tau_l$) and visited sites ($\tau_s$) characterizing the process of…

We consider random self-avoiding walks between two points on the boundary of a finite subdomain of Z^d (the probability of a self-avoiding trajectory gamma is proportional to mu^{-length(gamma)}). We show that the random trajectory becomes…

We provide a direct proof of Cram\'er's theorem for geodesic random walks in a complete Riemannian manifold $(M,g)$. We show how to exploit the vector space structure of the tangent spaces to study large deviation properties of geodesic…

We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…

In this paper we explore the asymptotic enumeration of three-dimensional excursions confined to the positive octant. As shown in [29], both the exponential growth and the critical exponent admit universal formulas, respectively in terms of…

We review results concerning the critical behavior of spin systems at equilibrium. We consider the Ising and the general O($N$)-symmetric universality classes, including the $N\to 0$ limit that describes the critical behavior of…

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,…

Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, $n$. Meanders are considered distinct up to any smooth deformation leaving the line fixed.…

We study random XY and (dimerized) XX spin-1/2 quantum spin chains at their quantum phase transition driven by the anisotropy and dimerization, respectively. Using exact expressions for magnetization, correlation functions and energy gap,…

We consider lattice self-avoiding walks and discuss the dynamic critical behavior of two dynamics that use local and bilocal moves and generalize the usual reptation dynamics. We determine the integrated and exponential autocorrelation…

Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…

We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71.…

We consider a self-avoiding walk on the $d$-dimensional hypercubic lattice, terminally attached to an impenetrable hyperplane at which it can adsorb. When a force is applied the walk can be pulled off the surface and we consider the…