Related papers: Correction-to-scaling exponents for two-dimensiona…
We consider long-range percolation, Ising model, and self-avoiding walk on $\mathbb{Z}^d$, with couplings decaying like $|x|^{-(d+\alpha)}$ where $0 < \alpha \le 2$, above the upper critical dimensions. In the spread-out setting where the…
Corrections to scaling in the 3D Ising model are studied based on non-perturbative analytical arguments and Monte Carlo (MC) simulation data for different lattice sizes L. Analytical arguments show the existence of corrections with the…
Quasi-Monte Carlo algorithms are studied for designing discrete approximations of two-stage linear stochastic programs. Their integrands are piecewise linear, but neither smooth nor lie in the function spaces considered for QMC error…
We study the asymptotic shape of self-avoiding random walks (SAW) on the backbone of the incipient percolation cluster in d-dimensional lattices analytically. It is generally accepted that the configurational averaged probability…
We use extensive Monte Carlo transfer matrix calculations on infinite strips of widths $L$ up to 30 lattice spacing and a finite-size scaling analysis to obtain critical exponents and conformal anomaly number $c$ for the two-dimensional…
We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…
We give the correct analytic expression of a finite integral appearing in the four-loop computation of the renormalization-group functions for the two-dimensional nonlinear sigma-model on the square lattice with standard action, explaining…
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…
We prove that the scaling limit of the weakly self-avoiding walk on a $d$-dimensional discrete torus is Brownian motion on the continuum torus if the length of the rescaled walk is $o(V^{1/2})$ where $V$ is the volume (number of points) of…
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…
We study the problem of critical adsorption of piecewise directed random walks on a boundary of fractal lattices that belong to the Sierpinski gasket family. By applying the exact real space renormalization group method, we calculate the…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
The analysis of the radial distribution function of a system provides a possible procedure for uncovering interaction rules between individuals out of collective movement patterns. This approach from classical statistical mechanics has…
We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…
We consider a discrete time quantum walker in one dimension, where at each step, the step length $\ell$ is chosen from a distribution $P(\ell) \propto \ell^{-\delta -1}$ with $\ell \leq \ell_{max}$. We evaluate the probability $f(x,t)$ that…
We investigate polymers pulled away from an interacting surface, where the force is applied to the untethered endpoint and at an angle $\theta$ to the surface. We use the canonical self-avoiding walk model of polymers and obtain the phase…
The aim of this short article is to convey the basic idea of the original paper [3], without going into too much detail, about how to derive sharp asymptotics of the gyration radius for random walk, self-avoiding walk and oriented…
We build upon a recent theoretical breakthrough by employing novel algorithms to accurately compute the fractions $F_p$ of all closed walks on the infinite square lattice whose the last erased loop corresponds is any one of the $762, 207,…
We consider a two dimensional reflecting random walk on the nonnegative integer quadrant. This random walk is assumed to be skip free in the direction to the boundary of the quadrant, but may have unbounded jumps in the opposite direction,…
We study rooted self avoiding polygons and self avoiding walks on deterministic fractal lattices of finite ramification index. Different sites on such lattices are not equivalent, and the number of rooted open walks W_n(S), and rooted…