English
Related papers

Related papers: Phase transitions and percolation at criticality i…

200 papers

In this paper we study the Poisson stick model in two dimensional hyperbolic space $\mathbb{H}^2,$ where the sticks all have length $L.$ Typically, percolation models in hyperbolic space undergo two phase transitions as the intensity…

Probability · Mathematics 2025-12-18 Erik I. Broman , Johan H. Tykesson

In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…

Probability · Mathematics 2025-11-25 Corentin Faipeur

We study the independent alignment percolation model on $\mathbb{Z}^d$ introduced by Beaton, Grimmett and Holmes [arXiv:1908.07203]. It is a model for random intersecting line segments defined as follows. First the sites of $\mathbb{Z}^d$…

Probability · Mathematics 2026-02-02 Marcelo Hilário , Daniel Ungaretti

We introduce a continuum percolation model defined on the points of a d-dimensional homogeneous Poisson process. Each Poisson point is connected to all points within its connection range, which depends on the distances to the other Poisson…

Probability · Mathematics 2007-05-23 A. Gillett , M. Nuyens

We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…

Probability · Mathematics 2025-12-23 Joost Jorritsma , Pascal Maillard , Peter Mörters

We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…

Probability · Mathematics 2018-11-27 Mark Holmes , Thomas S. Salisbury

We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in $\bbR ^2$ of intensities $\lambda$ and $\lambda_E$…

Information Theory · Computer Science 2013-08-15 Rahul Vaze , Srikanth Iyer

Given $d \in {\bf N}, \lambda >0$, the random connection model in a region $A \subseteq {\bf R}^d$ is a graph with vertex set given by a homogeneous Poisson point process of intensity $\lambda $ in $A$, with an edge placed between each pair…

Probability · Mathematics 2025-09-11 Mathew D. Penrose

We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1…

Probability · Mathematics 2007-05-23 Tatyana S. Turova , Thomas Vallier

We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…

Probability · Mathematics 2025-08-06 Benedikt Jahnel , Lukas Lüchtrath , Christian Mönch

We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…

Probability · Mathematics 2024-12-10 Benedikt Jahnel , Lukas Lüchtrath

We consider a random connection model (RCM) $\xi$ driven by a Poisson process $\eta$. We derive exponential moment bounds for an arbitrary cluster, provided that the intensity $t$ of $\eta$ is below a certain critical intensity $t_T$. The…

Probability · Mathematics 2026-02-05 Mikhail Chebunin , Günter Last

We introduce a new way to sample inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities while remaining tractable. To achieve this we run a Poisson…

Probability · Mathematics 2020-03-03 Lorenzo Federico

We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…

Disordered Systems and Neural Networks · Physics 2014-11-20 Takehisa Hasegawa , Tomoaki Nogawa , Koji Nemoto

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 note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…

Probability · Mathematics 2018-02-12 Thomas Beekenkamp , Tim Hulshof

We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…

Probability · Mathematics 2023-11-21 Ercan Sönmez

The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…

Probability · Mathematics 2024-09-25 David Coupier , David Dereudre , Jean-Baptiste Gouéré

We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…

Probability · Mathematics 2025-11-11 Qingwei Liu , Nicolas Privault

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…

Information Theory · Computer Science 2016-11-17 Rahul Vaze