English
Related papers

Related papers: Supercritical phase of the random connection model

200 papers

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

Probability · Mathematics 2014-05-13 Mathew D. Penrose

We investigate a spatial random graph model whose vertices are given as a marked Poisson process on $\mathbb{R}^d$. Edges are inserted between any pair of points independently with probability depending on the spatial displacement of the…

Probability · Mathematics 2025-03-25 Matthew Dickson , Markus Heydenreich

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

Probability · Mathematics 2018-10-10 Alessandra Faggionato , Hlafo Alfie Mimun

We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…

Probability · Mathematics 2020-04-03 Srikanth K. Iyer , Sanjoy Kr. Jhawar

We study the random connection model on hyperbolic space $\mathbb{H}^d$ in dimension $d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity $\lambda>0$. Upon variation of $\lambda$ there is a…

Probability · Mathematics 2025-10-14 Matthew Dickson , Markus Heydenreich

Consider the random graph $G({\mathcal P}_{n},r)$ whose vertex set ${\mathcal P}_{n}$ is a Poisson point process of intensity $n$ on $(- \frac{1}{2}, \frac{1}{2}]^d$, $d \geq 2$. Any two vertices $X_i,X_j \in {\mathcal P}_{n}$ are connected…

Probability · Mathematics 2015-10-20 Srikanth K. Iyer

Consider a 2-dimensional soft random geometric graph $G(\lambda,s,\phi)$, obtained by placing a Poisson($\lambda s^2$) number of vertices uniformly at random in a square of side $s$, with edges placed between each pair $x,y$ of vertices…

Probability · Mathematics 2022-04-25 Mathew D. Penrose

Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of…

Probability · Mathematics 2010-12-20 Srikanth K. Iyer , D. Yogeshwaran

We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…

Probability · Mathematics 2025-12-29 Alejandro Caicedo , Leonid Kolesnikov

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 study the random connection model driven by a stationary Poisson process. In the first part of the paper, we derive a lace expansion with remainder term in the continuum and bound the coefficients using a new version of the BK…

Probability · Mathematics 2023-12-20 Markus Heydenreich , Remco van der Hofstad , Günter Last , Kilian Matzke

We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…

Combinatorics · Mathematics 2015-07-07 Michael Krivelevich

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

We study the connectivity of random subgraphs of the $d$-dimensional Hamming graph $H(d, n)$, which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the random subgraph with an i.i.d.\ Bernoulli bond percolation on…

Probability · Mathematics 2016-03-01 Lorenzo Federico , Remco van der Hofstad , Tim Hulshof

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube…

Probability · Mathematics 2021-06-23 Srikanth K. Iyer , Sanjoy Kr. Jhawar

In this paper we extend our previous results on the connectivity functions and pressure of the Random Cluster Model in the highly subcritical phase and in the highly supercritical phase, originally proved only on the cubic lattice $\Z^d$,…

Mathematical Physics · Physics 2008-02-08 Aldo Procacci , Benedetto Scoppola

The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…

Probability · Mathematics 2018-08-06 Günter Last , Franz Nestmann , Matthias Schulte

We consider the contact process near an extended surface defect, where the local control parameter deviates from the bulk one by an amount of $\lambda(l)-\lambda(\infty) = A l^{-s}$, $l$ being the distance from the surface. We concentrate…

Statistical Mechanics · Physics 2018-01-12 R. Juhász , F. Iglói

We prove up-to-constants bounds on the two-point function (i.e., point-to-point connection probabilities) for critical long-range percolation on the $d$-dimensional hierarchical lattice. More precisely, we prove that if we connect each pair…

Probability · Mathematics 2021-04-01 Tom Hutchcroft
‹ Prev 1 2 3 10 Next ›