English
Related papers

Related papers: Critical first passage percolation on random graph…

200 papers

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

Probability · Mathematics 2019-07-29 Tom Hutchcroft

We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…

Probability · Mathematics 2023-03-21 Alexander Drewitz , Alexis Prévost , Pierre-François Rodriguez

In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…

Statistical Mechanics · Physics 2019-11-14 Alexander P. Kartun-Giles , Marc Barthelemy , Carl P. Dettmann

In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…

Probability · Mathematics 2018-02-14 Erwin Adriaans , Julia Komjathy

We study first-passage percolation on $\mathbb Z ^2$ with independent and identically distributed weights, whose common distribution is uniform on $\{a,b\}$ with $0<a<b<\infty $. Following Ahlberg and De la Riva, we consider the passage…

Probability · Mathematics 2025-05-07 Barbara Dembin , Dor Elboim

We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…

Probability · Mathematics 2012-01-24 Eckhard Schlemm

Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…

Probability · Mathematics 2007-05-23 Jonathan Rowe , Boris Mitavskiy

In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…

Probability · Mathematics 2008-03-27 Yuval Peres , Oded Schramm , Jeffrey E. Steif

Many processes of spreading and diffusion take place on temporal networks, and their outcomes are influenced by correlations in the times of contact. These correlations have a particularly strong influence on processes where the spreading…

Physics and Society · Physics 2017-09-19 Mikko Kivelä , Jordan Cambe , Jari Saramäki , Márton Karsai

We consider the statistical properties of arrival times and balls on first-passage percolation (FPP) $2D$ square lattices with strong disorder in the link-times. A previous work showed a crossover in the weak disorder regime, between…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

Combinatorics · Mathematics 2025-11-17 Sahar Diskin , Michael Krivelevich

The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces…

Probability · Mathematics 2010-11-15 Itai Benjamini , Ofer Zeitouni

We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…

Probability · Mathematics 2021-07-12 Souvik Dhara , Remco van der Hofstad

In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…

Probability · Mathematics 2015-04-28 Daniel Ahlberg

In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…

Probability · Mathematics 2020-07-01 Souvik Dhara , Remco van der Hofstad , Johan S. H. van Leeuwaarden

Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…

Probability · Mathematics 2025-06-03 Paul Drouvillé

We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and…

Mathematical Physics · Physics 2026-05-15 Bhargav R. Karamched

In this paper we establish a connection between epidemic models on random networks with general infection times considered in Barbour and Reinert 2013 and first passage percolation. Using techniques developed in Bhamidi, van der Hofstad,…

Probability · Mathematics 2016-09-26 Shankar Bhamidi , Remco van der Hofstad , Julia Komjathy

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

Probability · Mathematics 2025-12-18 Remco van der Hofstad

We study first passage percolation on the configuration model (CM) having power-law degrees with exponent $\tau\in [1,2)$. To this end we equip the edges with exponential weights. We derive the distributional limit of the minimal weight of…

Probability · Mathematics 2009-05-28 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra
‹ Prev 1 3 4 5 6 7 10 Next ›