English
Related papers

Related papers: A general approach to massive upper bound for two-…

200 papers

Suppose that the vertices of a regular graph are coloured red and blue with an equal number of each (we call this a balanced colouring). Since the graph is undirected, the number of edges from a red vertex to a blue vertex is clearly the…

Combinatorics · Mathematics 2025-06-10 Ron Gray , J. Robert Johnson

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…

Probability · Mathematics 2022-08-26 Christoforos Panagiotis

We present large deviations estimates in the supremum norm for a system of independent random walks superposed with a birth-and-death dynamics evolving on the discrete torus with $N$ sites. The scaling limit considered is the so-called…

Probability · Mathematics 2021-02-26 Tertuliano Franco , Luana A. Gurgel , Bernardo N. B. de Lima

Let $\mu$ be the self-avoiding walk connective constant on $\ZZ^d$. We show that the asymptotic expansion for $\beta_c=1/\mu$ in powers of $1/(2d)$ satisfies Borel type bounds. This supports the conjecture that the expansion is Borel…

Probability · Mathematics 2015-05-14 B. T. Graham

The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…

Soft Condensed Matter · Physics 2009-11-10 C. von Ferber , V. Blavats'ka , R. Folk , Yu. Holovatch

We perform a Monte Carlo simulation of two-dimensional N-step interacting self-avoiding walks at the theta point, with lengths up to N=3200. We compute the critical exponents, verifying the Coulomb-gas predictions, the theta-point…

Soft Condensed Matter · Physics 2015-03-17 Sergio Caracciolo , Marco Gherardi , Mauro Papinutto , Andrea Pelissetto

We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of…

Statistical Mechanics · Physics 2017-01-03 Hao Hu , Xiaosong Chen , Youjin Deng

Let $S=(S_n)$ be an oscillatory random walk on the integer lattice $\mathbb{Z}$ with i.i.d. increments. Let $V_{{\rm d}}(x)$ be the renewal function of the strictly descending ladder height process for $S$. We obtain several sufficient…

Probability · Mathematics 2021-06-01 Kohei Uchiyama

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…

Probability · Mathematics 2015-09-08 Noam Berger , Ron Rosenthal

We prove a non-standard functional limit theorem for a two dimensional simple random walk on some randomly oriented lattices. This random walk, already known to be transient, has different horizontal and vertical fluctuations leading to…

Probability · Mathematics 2007-05-24 Nadine Guillotin-Plantard , Arnaud Le Ny

Let $W_d(n)$ be the number of $2n$-step walks in $\mathbb{Z}^d$ which begin and end at the origin. We study the exponent of $2$ in the prime factorisation of this number; i.e., $w_d(n) = \nu_2(W_d(n))$. We show that, for each $d$, there is…

Combinatorics · Mathematics 2025-06-17 Nikolai Beluhov

We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on…

Probability · Mathematics 2019-05-28 Francis Comets , Serguei Popov , Marina Vachkovskaia

We study microscopic observables of the Discrete Gaussian model (i.e., the Gaussian free field restricted to take integer values) at high temperature using the renormalisation group method. In particular, we show the central limit theorem…

Probability · Mathematics 2024-04-16 Jiwoon Park

We prove that a law of large numbers and a central limit theorem hold for the excited random walk model in every dimension $d \geq 2$.

Probability · Mathematics 2007-06-06 Jean Bérard , Alejandro Ramírez

The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of…

Probability · Mathematics 2009-11-07 Tom Kennedy

We make a high-precision Monte Carlo study of two- and three-dimensional self-avoiding walks (SAWs) of length up to 80000 steps, using the pivot algorithm and the Karp-Luby algorithm. We study the critical exponents $\nu$ and $2\Delta_4…

High Energy Physics - Lattice · Physics 2009-10-22 Bin Li , Neal Madras , Alan D. Sokal

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…

Probability · Mathematics 2015-06-05 Hugo Duminil-Copin , Alan Hammond

We study three-dimensional self-avoiding walks in presence of a one-dimensional excluded region. We show the appearance of a universal sub-leading exponent which is independent of the particular shape and symmetries of the excluded region.…

High Energy Physics - Lattice · Physics 2008-11-26 Sergio Caracciolo , Maria Serena Causo , Andrea Pelissetto

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

Probability · Mathematics 2007-05-23 Erwin Bolthausen , Christine Ritzmann

We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient spread-out percolation. We use a relatively simple…

Probability · Mathematics 2007-05-23 Markus Heydenreich , Remco van der Hofstad
‹ Prev 1 3 4 5 6 7 10 Next ›