Related papers: Prudent walks and polygons
We give a new proof of a result of Kenyon that the growth exponent for loop-erased random walks in two dimensions is 5/4. The proof uses the convergence of LERW to Schramm-Loewner evolution with parameter 2, and is valid for irreducible…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
This paper is motivated by the following problem. Define a quantum walk on a positively weighted path (linear chain). Can the weights be tuned so that perfect state transfer occurs between the first vertex and any other position? We do not…
Traditional orthogonal range problems allow queries over a static set of points, each with some value. Dynamic variants allow points to be added or removed, one at a time. To support more powerful updates, we introduce the Grid Range class…
A new algorithm for the derivation of low-density series for percolation on directed lattices is introduced and applied to the square lattice bond and site problems. Numerical evidence shows that the computational complexity grows…
The symmetric random walk is known to be recurrent in one and two dimensions, and becomes transient in three or higher dimensions. We compare the symmetric random walk to walks driven by certain \polya\ urns. We show that, in contrast, if…
We find, and analyse, the exact solution of two friendly directed walks, modelling polymers, which interact with a wall via contact interactions. We specifically consider two walks that begin and end together so as to imitate a polygon. We…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
In Euclidean space there is a trivial upper bound on the maximum length of a compound "walk" built up of variable-length jumps, and a considerably less trivial lower bound on its minimum length. The existence of this non-trivial lower bound…
A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…
A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…
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 address the enumeration of walks with small steps confined to a two-dimensional cone, for example the quarter plane, three-quarter plane or the slit plane. In the quarter plane case, the solutions for unweighted step-sets are already…
We study the exponential stability of evolutionary equations. The focus is laid on second order problems and we provide a way to rewrite them as a suitable first order evolutionary equation, for which the stability can be proved by using…
We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…
Evolving structure and rheology across Kuhn scale interfaces in entangled polymer fluids under flow play a prominent role in processing of manufactured plastics, and have numerous other applications. Quantitative tracking of chain…
We examine diffusion-limited aggregation for a one-dimensional random walk with long jumps. We achieve upper and lower bounds on the growth rate of the aggregate as a function of the number of moments a single step of the walk has. In this…
We explore and calculate the rich scaling behavior of copolymer networks in solution by renormalization group methods. We establish a field theoretic description in terms of composite operators. Our 3rd order resummation of the spectrum of…
The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice is studied numerically. For most concentrations of the scatterers the trajectories close…
We study the translocation of a flexible polymer through extended patterned pores using molecular dynamics (MD) simulations. We consider cylindrical and conical pore geometries that can be controlled by the angle of the pore apex $\alpha$.…