English
Related papers

Related papers: The Triangle Condition for the Marked Random Conne…

200 papers

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

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

Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…

Probability · Mathematics 2025-07-14 Alejandro Caicedo , Matthew Dickson

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 investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…

Probability · Mathematics 2024-04-23 Peter Gracar , Lukas Lüchtrath , Peter Mörters

In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…

Probability · Mathematics 2007-05-23 Christian Borgs , Jennifer T. Chayes , Remco van der Hofstad , Gordon Slade , Joel Spencer

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 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

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 consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…

Probability · Mathematics 2015-05-19 Massimo Franceschetti , Mathew D. Penrose , Tom Rosoman

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

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 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 consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…

Probability · Mathematics 2024-07-11 Arnaud Rousselle , Ercan Sönmez

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 investigate random graphs on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point carries an independent random mark and given marks and…

Probability · Mathematics 2022-05-02 Peter Gracar , Markus Heydenreich , Christian Mönch , Peter Mörters

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

Let $X$ be either $Z^d$ or the points of a Poisson process in $R^d$ of intensity 1. Given parameters $r$ and $p$, join each pair of points of $X$ within distance $r$ independently with probability $p$. This is the simplest case of a…

Probability · Mathematics 2009-05-08 Bela Bollobas , Svante Janson , Oliver Riordan

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

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…

Probability · Mathematics 2020-03-16 Laurent Ménard , Arvind Singh
‹ Prev 1 2 3 10 Next ›