English
Related papers

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

200 papers

We consider the random deposition of objects of variable width and height over a line. The successive additions of these structures create a random interface. We focus on the regime of heavy tailed distributions of the structure width. When…

Statistical Mechanics · Physics 2024-03-28 N. Pétrélis , F. Pétrélis

Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…

Probability · Mathematics 2007-05-23 Zhenning Kong , Edmund M. Yeh

For a multivariate random walk with i.i.d. jumps satisfying the Cramer moment condition and having a mean vector with at least one negative component, we derive the exact asymptotics of the probability of ever hitting the positive orthant…

Probability · Mathematics 2019-05-09 Yuqing Pan , Konstantin Borovkov

We prove decoupling inequalities for the Gaussian free field on $\mathbb{Z}^d$, $d\geq 3$. As an application, we obtain exponential decay (with logarithmic correction for $d=3$) of the connectivity function of excursion sets for large…

Probability · Mathematics 2016-02-24 Serguei Popov , Balazs Rath

We consider instances of long-range percolation on $\mathbb Z^d$ and $\mathbb R^d$, where points at distance $r$ get connected by an edge with probability proportional to $r^{-s}$, for $s\in (d,2d)$, and study the asymptotic of the…

Probability · Mathematics 2020-01-06 Marek Biskup , Jeffrey Lin

A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…

Probability · Mathematics 2026-01-05 Alberto M. Campos , Bernardo N. B. de Lima

Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…

Probability · Mathematics 2021-12-10 Umberto De Ambroggio , Matthew I. Roberts

We provide Large Deviation estimates for the bridge of a $d$-dimensional general diffusion process as the conditioning time tends to $0$ and apply these results to the evaluation of the asymptotics of its exit time probabilities. We are…

Probability · Mathematics 2014-06-19 Paolo Baldi , Lucia Caramellino , Maurizia Rossi

We study the rate of correlation decay in the two-dimensional random-field Ising model at weak field strength $\varepsilon$. We combine elements of the recent proof of exponential decay of correlations with a quantitative refinement of a…

Probability · Mathematics 2022-05-18 Yoav Bar-Nir

We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…

Probability · Mathematics 2007-05-23 Thomas Logan Ritchie , Vladimir Belitsky

The majority of existing probabilistic model checking case studies are based on well understood theoretical models and distributions. However, real-life probabilistic systems usually involve distribution parameters whose values are obtained…

Software Engineering · Computer Science 2013-08-29 Guoxin Su , David S. Rosenblum

We study a model for microscopic segregation in a homogeneous system of particles moving on a one-dimensional lattice. Particles tend to separate from each other, and evolution ceases when at least one empty site is found between any two…

Adaptation and Self-Organizing Systems · Physics 2009-11-11 Santiago Gil , Damian H. Zanette

We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…

Probability · Mathematics 2007-05-23 Anatolii A. Puhalskii

How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…

Statistical Mechanics · Physics 2019-08-22 Yacov Kantor , Mehran Kardar

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

Probability · Mathematics 2010-01-28 Nicholas Crawford , Allan Sly

We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…

Probability · Mathematics 2026-01-15 Kuldeep Guha Mazumder

We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…

Social and Information Networks · Computer Science 2017-02-10 Matthew Farrell , Timothy Goodrich , Nathan Lemons , Felix Reidl , Fernando Sánchez Villaamil , Blair D. Sullivan

Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite…

Probability · Mathematics 2018-10-29 Barbara Dembin

We provide necessary and sufficient conditions for hypercontractivity of the minima of nonnegative, i.i.d. random variables and of both the maxima of minima and the minima of maxima for such r.v.'s. It turns out that the idea of…

We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…

Probability · Mathematics 2016-11-28 Ruoting Gong , Christian Houdré , Jüri Lember