English
Related papers

Related papers: Percolation on preferential attachment models

200 papers

Partially motivated by the desire to better understand the connectivity phase transition in fractal percolation, we introduce and study a class of continuum fractal percolation models in dimension d greater than or equal to 2. These include…

Probability · Mathematics 2010-12-30 Erik I. Broman , Federico Camia

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 show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…

Combinatorics · Mathematics 2018-01-18 Felix Joos , Guillem Perarnau

Preferential attachment networks with power law exponent $\tau>3$ are known to exhibit a phase transition. There is a value $\rho_{\rm c}>0$ such that, for small edge densities $\rho\leq \rho_c$ every component of the graph comprises an…

Probability · Mathematics 2018-06-13 Maren Eckhoff , Peter Morters , Marcel Ortgiese

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

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$. For any $\lambda>0$ we consider the percolation…

Probability · Mathematics 2019-07-10 David Dereudre , Mathew D. Penrose

Building on the identification of the scaling limit of the critical percolation exploration process as a Schramm-Loewner Evolution, we derive a PDE characterization for the crossing probability of an annulus.

Probability · Mathematics 2007-05-23 Julien Dubedat

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…

Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…

Disordered Systems and Neural Networks · Physics 2025-10-10 D. J. Priour

We define a percolation problem on the basis of spin configurations of the two dimensional XY model. Neighboring spins belong to the same percolation cluster if their orientations differ less than a certain threshold called the conducting…

Statistical Mechanics · Physics 2010-03-19 Yancheng Wang , Wenan Guo , Bernard Nienhuis , Henk W. J. Blöte

We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…

Probability · Mathematics 2015-08-18 Michael Damron , Wai-Kit Lam , Xuan Wang

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…

Probability · Mathematics 2021-07-12 Shankar Bhamidi , Souvik Dhara , Remco van der Hofstad

In this paper we characterize the superconductor-insulator phase transition on a network of 2d percolation clusters. Sufficiently close to the percolation threshold, this network has a broad degree distribution, and at p=p_c the degree…

Statistical Mechanics · Physics 2015-06-12 Ginestra Bianconi

In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…

Probability · Mathematics 2010-02-04 Béla Bollobás , Christian Borgs , Jennifer Chayes , Oliver Riordan

Percolation for a planar lattice has a single percolation threshold, whereas percolation for a negatively curved lattice displays two separate thresholds. The enhanced binary tree (EBT) can be viewed as a prototype model displaying two…

Statistical Mechanics · Physics 2015-03-13 Petter Minnhagen , Seung Ki Baek

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

The finite-size scaling theory for continuous phase transition plays an important role in determining critical point and critical exponents from the size-dependent behaviors of quantities in the thermodynamic limit. For percolation phase…

Statistical Mechanics · Physics 2017-10-10 Yong Zhu , Xiaosong Chen

We study site percolation on Angel & Schramm's uniform infinite planar triangulation. We compute several critical and near-critical exponents, and describe the scaling limit of the boundary of large percolation clusters in all regimes…

Probability · Mathematics 2018-02-19 Nicolas Curien , Igor Kortchemski

The location and nature of the percolation transition in random networks is a subject of intense interest. Recently, a series of graph evolution processes have been introduced that lead to discontinuous percolation transitions where the…

Statistical Mechanics · Physics 2015-06-17 Wei Chen , Xueqi Cheng , Zhiming Zheng , Ning Ning Chung , Raissa M. D'Souza , Jan Nagler

We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…

Probability · Mathematics 2012-02-08 Hubert Lacoin
‹ Prev 1 3 4 5 6 7 10 Next ›