Connection probabilities in Poisson random graphs with uniformly bounded edges
From MaRDI portal
Publication:3121505
zbMath1488.60125arXiv1712.07016MaRDI QIDQ3121505
Hlafo Alfie Mimun, Alessandra Faggionato
Publication date: 18 March 2019
Full work available at URL: https://arxiv.org/abs/1712.07016
randomized algorithmPoisson point processBoolean modelrandom connection modelconnection probabilityMiller-Abrahams resistor networkMott variable range hopping
Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30) Percolation (82B43) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees ⋮ 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
Cites Work
- Mott law as upper bound for a random walk in a random environment
- An introduction to the theory of point processes
- Sharpness of the phase transition and lower bounds for the critical intensity in continuum percolation on \(\mathbb{R}^{d}\)
- Sharp phase transition for the random-cluster and Potts models via decision trees
- Exponential decay of connection probabilities for subcritical Voronoi percolation in \(\mathbb{R}^d\)
- Mott law as lower 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
- Impurity Conduction at Low Concentrations
- Continuum Percolation
