Related papers: Supercritical phase of the random connection model

We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…

We study the contact process on the complete graph on $n$ vertices where the rate at which the infection travels along the edge connecting vertices $i$ and $j$ is equal to $ \lambda w_i w_j / n$ for some $\lambda >0$, where $w_i$ are i.i.d.…

By the Parisi-Sourlas conjecture, the critical point of a theory with random field (RF) disorder is described by a supersymmeric (SUSY) conformal field theory (CFT), related to a $d-2$ dimensional CFT without SUSY. Numerical studies…

We show that the interplay between geometric criticality and dynamical fluctuations leads to a novel universality class of the contact process on a randomly diluted lattice. The nonequilibrium phase transition across the percolation…

We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…

The two-level correlation function $R_{d,\beta}(s)$ of $d$-dimensional disordered models ($d=1$, 2, and 3) with long-range random-hopping amplitudes is investigated numerically at criticality. We focus on models with orthogonal ($\beta=1$)…

We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…

Bollob\'{a}s and Thomason (1985) proved that for each $k=k(n) \in [1, n-1]$, with high probability, the random graph process, where edges are added to vertex set $V=[n]$ uniformly at random one after another, is such that the stopping time…

We consider a long-range percolation graph on $\mathbb Z^d$ where, in addition to the nearest-neighbor edges of $\mathbb Z^d$, distinct $x,y\in\mathbb Z^d$ are connected by an edge independently with probability asymptotic to…

We consider the zero-average Gaussian free field on a certain class of finite $d$-regular graphs for fixed $d\geq 3$. This class includes $d$-regular expanders of large girth and typical realisations of random $d$-regular graphs. We show…

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…

Discontinuous percolation transitions and the associated tricritical points are manifest in a wide range of both equilibrium and non-equilibrium cooperative phenomena. To demonstrate this, we present and relate the continuous and first…

We have determined the phase diagram of the simplest version of a lattice model introduced in the recent work of Kazakov and Migdal. If $m_0$ and $\lambda$ are the bare mass and self coupling of the scalar field in the model respectively,…

We study generic $d$-dimensional rigidity in sparse random graphs. Our main result is that for every $d\ge 2$, the Erd\H{o}s--R\'enyi random graph $G\sim G(n,c/n)$ undergoes a $d$-rigidity phase transition at the known, explicit,…

The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter lambda is varied. For small values of lambda a single infection eventually dies out. For larger lambda the…

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. We consider the the path-loss plus fading model of wireless signal…

This paper studied the fundamental modeling defect existing in Poisson-distributed cellular networks in which all base stations form a homogeneous Poisson point process (PPP) of intensity $\lambda_B$ and all users form another independent…

Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…

We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…