Related papers: New scaling laws for self-avoiding walks: bridges …
The surface critical behaviour of the interacting self-avoiding trail is examined using transfer matrix methods coupled with finite-size scaling. Particular attention is paid to the critical exponents at the ordinary and special points…
We prove that self-avoiding walk on Z^d is sub-ballistic in any dimension d at least two. That is, writing ||u|| for the Euclidean norm of u \in Z^d, and SAW_n for the uniform measure on self-avoiding walks gamma:{0,...,n} \to Z^d for which…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
We map self-avoiding random walks with a chemical potential for writhe to the three-dimensional complex O(N) Chern-Simons theory as N -> 0. We argue that at the Wilson-Fisher fixed point which characterizes normal self-avoiding walks (with…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…
Avalanche dynamics is an indispensable feature of complex systems. Here we study the self-organized critical dynamics of avalanches on scale-free networks with degree exponent $\gamma$ through the Bak-Tang-Wiesenfeld (BTW) sandpile model.…
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…
We prove a scaling limit theorem for the simple random walk on critical lattice trees in $\mathbb{Z}^d$, for $d\geq 8$. The scaling limit is the Brownian motion on the Integrated Super-Brownian Excursion (BISE) which is the same one that we…
For a complete graph of size $n$, assign each edge an i.i.d. exponential variable with mean $n$. For $\lambda>0$, consider the length of the longest path whose average weight is at most $\lambda$. It was shown by Aldous (1998) that the…
We consider disordered ladders of the transverse-field Ising model and study their critical properties and entanglement entropy for varying width, $w \le 20$, by numerical application of the strong disorder renormalization group method. We…
We determine the dimensional dependence of the percolative exponents of the jamming transition via numerical simulations in four and five spatial dimensions. These novel results complement literature ones, and establish jamming as a mixed…
The winding angle probability distribution of a planar self-avoiding walk has been known exactly since a long time: it has a gaussian shape with a variance growing as $<\theta^2>\sim \ln L$. For the three-dimensional case of a walk winding…
We devise a geometric description of bounded systems at criticality in any dimension $d$. This is achieved by altering the flat metric with a space dependent scale factor $\gamma(x)$, $x$ belonging to a general bounded domain $\Omega$.…
Scale-free networks with moderate edge dependence experience a phase transition between ultrasmall and small world behaviour when the power law exponent passes the critical value of three. Moreover, there are laws of large numbers for the…
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on the d-dimensional hyper cubic lattice having long finite-range connections, above their upper critical dimensions d=4…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
Contact matrices provide a coarse grained description of the configuration omega of a linear chain (polymer or random walk) on Z^n: C_{ij}(omega)=1 when the distance between the position of the i-th and j-th step are less than or equal to…
Domain wall (DW) networks have a large impact on cosmology and present interesting dynamics that can be controlled by various scaling regimes. In the first stage after spontaneous breaking of the discrete symmetry, the network is seeded…
The phase diagram for a two-dimensional self-avoiding walk model on the square lattice incorporating attractive short-ranged interactions between parallel sections of walk is derived using numerical transfer matrix techniques. The model…