English
Related papers

Related papers: There is no isolated interface edge in very superc…

200 papers

Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…

Probability · Mathematics 2018-01-11 Markus Heydenreich , Tim Hulshof , Joost Jorritsma

Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…

Probability · Mathematics 2022-12-09 Régine Marchand , Irène Marcovici , Pierrick Siest

We consider independent edge percolation models on Z, with edge occupation probabilities p_<x,y> = p if |x-y| = 1, 1 - exp{- beta / |x-y|^2} otherwise. We prove that oriented percolation occurs when beta > 1 provided p is chosen…

Probability · Mathematics 2013-04-26 D. H. U. Marchetti , V. Sidoravicius , M. E. Vares

In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…

Probability · Mathematics 2023-04-25 Hugo Vanneuville

We consider the unique infinite connected component of supercritical bond percolation on the square lattice and study the geometric properties of isoperimetric sets, i.e., sets with minimal boundary for a given volume. For almost every…

Probability · Mathematics 2016-05-13 Marek Biskup , Oren Louidor , Eviatar B. Procaccia , Ron Rosenthal

In Hermitian systems, according to the bulk-edge correspondence interfacing two topological optical media with different bulk topological numbers implies the existence of edge states, which can trap light at the interface. However, such a…

Optics · Physics 2021-12-21 Stefano Longhi

We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs…

Probability · Mathematics 2016-08-14 Adám Timár

We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which…

Probability · Mathematics 2015-01-13 S. Friedli , D. Ioffe , Y. Velenik

We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…

Probability · Mathematics 2025-11-13 Shirshendu Chatterjee , Pranav Chinmay , Jack Hanson , Philippe Sosoe

Most networks of interest do not live in isolation. Instead they form components of larger systems in which multiple networks with distinct topologies coexist and where elements distributed amongst different networks may interact directly.…

Disordered Systems and Neural Networks · Physics 2009-07-07 E. A. Leicht , Raissa M. D'Souza

We consider the standard site percolation model on the three dimensional cubic lattice. Starting solely with the hypothesis that $\theta(p)>0$, we prove that, for any $\alpha>0$, there exists $\kappa>0$ such that, with probability larger…

Probability · Mathematics 2013-07-12 Raphaël Cerf

We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…

Probability · Mathematics 2023-05-17 Daniel Contreras , Sébastien Martineau , Vincent Tassion

We study first-passage percolation in two dimensions, using measures mu on passage times with b:=inf supp(mu) >0 and mu({b})=p \geq p_c, the threshold for oriented percolation. We first show that for each such mu, the boundary of the limit…

Probability · Mathematics 2013-09-18 Antonio Auffinger , Michael Damron

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

I consider p-Bernoulli bond percolation on graphs of vertex-transitive tilings of the hyperbolic plane with finite sided faces (or, equivalently, on transitive, nonamenable, planar graphs with one end) and on their duals. It is known…

Probability · Mathematics 2012-12-11 Jan Czajkowski

In distinction to the Neumann case the squeezing limit of a Dirichlet network leads in the threshold region generically to a quantum graph with disconnected edges, exceptions may come from threshold resonances. Our main point in this paper…

Mathematical Physics · Physics 2019-12-10 Claudio Cacciapuoti , Pavel Exner

The one-dimensional nearest-neighbor totally asymmetric simple exclusion process can be constructed in the same space as a last-passage percolation model in Z^2. We show that the trajectory of a second class particle in the exclusion…

Probability · Mathematics 2007-05-23 Pablo A. Ferrari , Leandro P. R. Pimentel

We compare two singularly perturbed elliptic systems modeling partially phase segregation. Although the formulations are fundamentally different, we prove that their limiting configurations have identical free boundaries. The result shows…

Analysis of PDEs · Mathematics 2026-01-12 Farid Bozorgnia

We study first-passage percolation on $\mathbb Z^d$, $d\ge 2$, with independent weights whose common distribution is compactly supported in $(0,\infty)$ with a uniformly-positive density. Given $\epsilon>0$ and $v\in\mathbb Z^d$, which…

Probability · Mathematics 2023-10-16 Barbara Dembin , Dor Elboim , Ron Peled

We investigate the problem of percolation of words in a random environment. To each vertex, we independently assign a letter $0$ or $1$ according to Bernoulli r.v.'s with parameter $p$. The environment is the resulting graph obtained from…

Probability · Mathematics 2025-01-03 Pablo A. Gomes , Otávio Lima , Roger W C Silva