English
Related papers

Related papers: A lower bound for disconnection by random interlac…

200 papers

We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…

Probability · Mathematics 2009-07-06 Vladas Sidoravicius , Alain-Sol Sznitman

In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian…

Probability · Mathematics 2020-07-08 Maximilian Nitzschner , Alain-Sol Sznitman

We study the percolative properties of random interlacements on the product of G with the integer line Z, when G is a weighted graph satisfying certain sub-Gaussian estimates attached to the parameters alpha > 1, measuring the volume growth…

Probability · Mathematics 2017-07-12 Alain-Sol Sznitman

We consider continuous-time random interlacements on Z^d, d greater or equal to 3, and investigate the percolation model where a site x of Z^d is occupied if the total amount of time spent at x by all the trajectories of the interlacement…

Probability · Mathematics 2014-03-28 Pierre-François Rodriguez

We study the asymptotic behavior for large N of the disconnection time T_N of simple random walk on a discrete cylinder with base a d-dimensional discrete torus of side-length N. When d is sufficiently large, we are able to substantially…

Probability · Mathematics 2008-07-28 Amir Dembo , Alain-Sol Sznitman

We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…

Statistical Mechanics · Physics 2012-05-14 A. P. F. Atman , B. N. B. de Lima , M. Schnabel

In this paper we obtain a decoupling feature of the random interlacements process $\mathcal{I}^u \subset \mathbb{Z}^d$, at level $u$, $d\geq 3$. More precisely, we show that the trace of the random interlacements process on two disjoint…

Probability · Mathematics 2019-11-06 Diego F. de Bernardini , Christophe Gallesco , Serguei Popov

We demonstrate the existence of a topological disconnection threshold, recently found in Ref. \cite{JSP}, for generic $1-d$ anisotropic Heisenberg models interacting with an inter--particle potential $R^{-\alpha}$ when $0<\alpha < 1$ (here…

Statistical Mechanics · Physics 2014-03-31 F. Borgonovi , G. L. Celardo , A. Musesti , R. Trasarti-Battistoni , P. Vachal

The vacant set of random interlacements at level $u>0$, introduced in arXiv:0704.2560, is a percolation model on $\mathbb{Z}^d$, $d \geq 3$ which arises as the set of sites avoided by a Poissonian cloud of doubly infinite trajectories,…

Probability · Mathematics 2015-01-23 Balazs Rath

We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…

Probability · Mathematics 2021-07-14 Agelos Georgakopoulos , Christoforos Panagiotis

We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…

Probability · Mathematics 2021-02-15 David Dereudre

We consider large deviations of the cover time of the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, $d \geq 3$ by simple random walk. We prove a lower bound on the probability that the cover time is smaller than $\gamma\in (0,1)$ times its…

Probability · Mathematics 2025-07-18 Xinyi Li , Jialu Shi , Qiheng Xu

We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-\alpha}$ with $\alpha>0$.…

Probability · Mathematics 2011-03-15 Lung-Chi Chen , Akira Sakai

We consider some problems related to the truncation question in long-range percolation. It is given probabilities that certain long-range oriented bonds are open; assuming that this probabilities are not summable, we ask if the probability…

Probability · Mathematics 2022-07-21 Alberto M. Campos , Bernardo N. B. de Lima

In this work we determine a process-level Large Deviation Principle (LDP) for a model of interacting particles indexed by a lattice $\mathbb{Z}^d$. The connections are random, sparse and unscaled, so that the system converges in the large…

Probability · Mathematics 2024-10-01 James MacLaurin

The random interlacements (at level u) is a one parameter family of random subsets of Z^d introduced by Sznitman in arXiv:0704.2560. The vacant set at level u is the complement of the random interlacement at level u. In this paper, we study…

Probability · Mathematics 2013-02-08 Balazs Rath , Artem Sapozhnikov

The nearest-neighbor level spacing distribution is numerically investigated by directly diagonalizing disordered Anderson Hamiltonians for systems of sizes up to 100 x 100 x 100 lattice sites. The scaling behavior of the level statistics is…

Disordered Systems and Neural Networks · Physics 2009-10-30 Isa Kh. Zharekeshev , Bernhard Kramer

We consider random interlacements on $\mathbb{Z}^d$, $d \ge 3$. We show that the percolation function that to each $u \ge 0$ attaches the probability that the origin does not belong to an infinite cluster of the vacant set at level $u$, is…

Probability · Mathematics 2021-04-23 Alain-Sol Sznitman

We consider a symmetric exclusion process on a discrete interval of $S$ points with various boundary conditions at the endpoints. We study the asymptotic decay of correlations as $S\to\infty$. The main result is asymptotic independence of a…

Probability · Mathematics 2011-11-30 V. A. Malyshev , V. A. Shvets

Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…

Probability · Mathematics 2022-11-30 Tianqi Wu