English
Related papers

Related papers: Mean-field behaviour of the random connection mode…

200 papers

In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…

Probability · Mathematics 2025-08-27 Tom Hutchcroft

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

Probability · Mathematics 2016-02-09 D. A. Dawson , L. G. Gorostiza

We consider the level-sets of continuous Gaussian fields on $\mathbb{R}^d$ above a certain level $-\ell\in \mathbb{R}$, which defines a percolation model as $\ell$ varies. We assume that the covariance kernel satisfies certain regularity,…

Probability · Mathematics 2021-06-15 Franco Severo

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

In this paper, we consider Voronoi percolation in the hyperbolic space $\mathbb{H}^d$ ($d\ge 2$) and show that the phase transition is sharp. More precisely, we show that for Voronoi percolation with parameter $p$ generated by a homogeneous…

Probability · Mathematics 2021-11-16 Xinyi Li , Yu Liu

In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…

Probability · Mathematics 2025-06-02 Rick Durrett

We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…

Statistical Mechanics · Physics 2017-05-16 Ralph Kenna , Bertrand Berche

Using perturbative renormalization group we study the influence of random velocity field on the critical behaviour of directed bond percolation process near its second-order phase transition between absorbing and active phase. We consider…

Chaotic Dynamics · Physics 2012-03-23 M. Hnatič , T. Lučivjanský

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 have studied the critical properties of the contact process on a square lattice with quenched site dilution by Monte Carlo simulations. This was achieved by generating in advance the percolating cluster, through the use of an appropriate…

Disordered Systems and Neural Networks · Physics 2017-05-24 Alexander H. O. Wada , Mário J. de Oliveira

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

Probability · Mathematics 2018-09-12 Souvik Dhara

We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…

Statistical Mechanics · Physics 2014-08-01 Vijay Singh , Stefan Boettcher

We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…

Disordered Systems and Neural Networks · Physics 2020-07-08 S. S. Manna , Robert M. Ziff

In a new type of percolation phase transition, which was observed in a set of non-equilibrium models, each new connection between vertices is chosen from a number of possibilities by an Achlioptas-like algorithm. This causes preferential…

Disordered Systems and Neural Networks · Physics 2015-06-18 R. A. da Costa , S. N. Dorogovtsev , A. V. Goltsev , J. F. F. Mendes

We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…

Probability · Mathematics 2023-01-03 Ivailo Hartarsky , Bernardo N. B. de Lima

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

In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0,1] random variables on vertices of a hypercube, and study whether there is a path connecting two vertices such that the values of these…

Probability · Mathematics 2017-06-05 Li Li

We report on a possible crossover of a non universal quantity at the upper critical dimensionality in the field of percolation. Plotting recent estimates for site percolation thresholds of hypercubes in dimension 6< d< 13 against…

Statistical Mechanics · Physics 2009-11-11 S. Galam , A. Mauger

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

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