Connection probabilities in Poisson random graphs with uniformly bounded edges

MaRDI QIDQ3121505zbMATH OpenFDO

Authors Hlafo Alfie Mimun, Alessandra Faggionato

Publication date 18 March 2019

Full work available at URL https://arxiv.org/abs/1712.07016, http://alea.impa.br/articles/v16/16-18.pdf

zbMATH Keywords

Boolean modelconnection probabilityMiller-Abrahams resistor networkMott variable range hoppingPoisson point processrandom connection modelrandomized algorithm

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Percolation (82B43) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)

Abstract: 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 lower-bounded conductances. The latter is relevant for the analysis of conductivity by Mott variable range hopping in strongly disordered systems. By using the method of randomized algorithms developed by Duminil-Copin et al. we prove that in the subcritical phase the probability that the origin is connected to some point at distance $n$ decays exponentially in $n$, while in the supercritical phase the probability that the origin is connected to infinity is strictly positive and bounded from below by a term proportional to $(lambda-lambd{a}_c)$, $lambda$ being the density of the Poisson point process and $lambd{a}_c$ being the critical density.

Recommendations

• Left-right crossings in the Miller-Abrahams random resistor network and in generalized Boolean models
• A power law for connectedness of some random graphs at the critical point
• The random connection model: Connectivity, edge lengths, and degree distributions
• scientific article; zbMATH DE number 15665
• When are random graphs connected

Cites work

• An introduction to the theory of point processes
• Continuum Percolation
• Exponential decay of connection probabilities for subcritical Voronoi percolation in \(\mathbb{R}^d\)
• Impurity Conduction at Low Concentrations
• Mott law as lower bound for a random walk in a random environment
• Mott law as upper bound for a random walk in a random environment
• Russo's Formula, Uniqueness of the Infinite Cluster, and Continuous Differentiability of Free Energy for Continuum Percolation
• Sharp phase transition for the random-cluster and Potts models via decision trees
• Sharpness of the phase transition and lower bounds for the critical intensity in continuum percolation on \(\mathbb{R}^{d}\)

Cited in

(9)

• Left-right crossings in the Miller-Abrahams random resistor network and in generalized Boolean models
• Phase transitions and percolation at criticality in enhanced random connection models
• Limit behaviors of random connected graphs driven by a Poisson process
• Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees
• Connectivity of Poissonian inhomogeneous random multigraphs
• Connecting probability for random bounded-range one-dimensional network
• Critical exponents for marked random connection models
• Mott's law for the v.r.h. random resistor network and for Mott's random walk
• Scaling limit of the directional conductivity of random resistor networks on point processes

This page was built for publication: Connection probabilities in Poisson random graphs with uniformly bounded edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121505)