English
Related papers

Related papers: Brownian Web and Oriented Percolation: Density Bou…

200 papers

In this paper we propose a method of proving impossibility results based on applying strong data-processing inequalities to estimate mutual information between sets of variables forming certain Markov random fields. The end result is that…

Information Theory · Computer Science 2020-05-22 Yury Polyanskiy , Yihong Wu

Descriptors that characterize the geometry and topology of the pore space of porous media are intimately linked to their transport properties. We quantify such descriptors, including pore-size functions and the critical pore radius…

Soft Condensed Matter · Physics 2021-07-27 Michael A. Klatt , Robert M. Ziff , Salvatore Torquato

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…

Probability · Mathematics 2025-03-30 Manuel Cabezas , Alexander Fribergh , Mark Holmes , Edwin Perkins

We consider random genus-0 hyperbolic surfaces $\mathcal{S}_n$ with $n + 1$ punctures, sampled according to the Weil-Petersson measure. We show that, after rescaling the metric by $n^{-1/4}$, the surface $\mathcal{S}_n$ converges in…

Probability · Mathematics 2025-08-27 Timothy Budd , Nicolas Curien

We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

Probability · Mathematics 2024-12-02 Amine Asselah , Bruno Schapira

The transport of suspended Brownian particles dc-driven along corrugated narrow channels is numerically investigated in the regime of finite damping. We show that inertial corrections cannot be neglected as long as the width of the channel…

Chemical Physics · Physics 2012-08-29 P. K. Ghosh , P. Hanggi , F. Marchesoni , F. Nori , G. Schmid

In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…

Probability · Mathematics 2016-11-15 Deepan Basu , Artem Sapozhnikov

We introduce a system of one-dimensional coalescing nonsimple random walks with long range jumps allowing crossing paths and exibiting dependence before coalescence. We show that under diffusive scaling this system converges in distribution…

Probability · Mathematics 2011-09-19 Cristian Coletti , Glauco Valle

For the directed landscape, the putative universal space-time scaling limit object in the (1+1) dimensional Kardar-Parisi-Zhang (KPZ) universality class, consider the geodesic tree -- the tree formed by the coalescing semi-infinite…

Probability · Mathematics 2025-04-18 Riddhipratim Basu , Manan Bhatia

Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…

Probability · Mathematics 2026-05-15 Diana De Armas Bellon , Matthew I. Roberts

In this article, we present an invariance principle for the paths of the directed random polymer in space dimension two in the subcritical intermediate disorder regime. More precisely, the distribution of diffusively rescaled polymer paths…

Probability · Mathematics 2025-07-21 Simon Gabriel

It has been recently understood (arXiv:1212.2885, arXiv:1310.4764, arXiv:1410.0605) that for a general class of percolation models on $\mathbb{Z}^d$ satisfying suitable decoupling inequalities, which includes i.a.\ Bernoulli percolation,…

Probability · Mathematics 2019-09-25 Caio Alves , Artem Sapozhnikov

We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we…

Probability · Mathematics 2018-01-23 Hugo Duminil-Copin , Vincent Tassion

The linear growth of operators in local quantum systems leads to an effective lightcone even if the system is non-relativistic. We show that consistency of diffusive transport with this lightcone places an upper bound on the diffusivity: $D…

High Energy Physics - Theory · Physics 2017-10-11 Thomas Hartman , Sean A. Hartnoll , Raghu Mahajan

Denoising diffusions are a powerful method to generate approximate samples from high-dimensional data distributions. Recent results provide polynomial bounds on their convergence rate, assuming $L^2$-accurate scores. Until now, the tightest…

Machine Learning · Statistics 2024-03-07 Joe Benton , Valentin De Bortoli , Arnaud Doucet , George Deligiannidis

We consider directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices. A topic of great interest is the coupling structure of the weights of geodesics as the endpoints are varied spatially and…

Probability · Mathematics 2021-01-28 Riddhipratim Basu , Shirshendu Ganguly , Lingfu Zhang

We study a generalization of two-dimensional site percolation by assigning an energy cost $\varepsilon$ to bonds between nearest-neighbor occupied sites. This leads to a competition between entropy-driven cluster growth and energetic…

Statistical Mechanics · Physics 2026-05-19 Sayan Sircar , Kabir Ramola

We consider connectivity properties and asymptotic slopes for certain random directed graphs on $Z^2$ in which the set of points $C_o$ that the origin connects to is always infinite. We obtain conditions under which the complement of $C_o$…

Probability · Mathematics 2016-08-10 Mark Holmes , Thomas S. Salisbury

Isoperimetric inequalities form a very intuitive yet powerful characterization of the connectedness of a state space, that has proven successful in obtaining convergence bounds. Since the seventies they form an essential tool in…

Discrete Mathematics · Computer Science 2017-11-17 Simon Apers , Alain Sarlette , Francesco Ticozzi

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey