On the connectedness of a random graph

DOI10.1017/S0305004100062034zbMath0543.60016MaRDI QIDQ3331984

Geoffrey R. Grimmett, John M. Marstrand, Michael S. Keane

Publication date: 1984

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

random graphs

Mathematics Subject Classification ID

Combinatorial probability (60C05) Connectivity (05C40)

Related Items (10)

One dimensional \(1/| j-i| ^ s\) percolation models: The existence of a transition for s\(\leq 2\) ⋮ Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation ⋮ Critical values in a long-range percolation on spaces like fractals ⋮ Convergence in homogeneous random graphs ⋮ Uniqueness in percolation theory ⋮ The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation ⋮ Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses ⋮ On the truncation of systems with non-summable interactions ⋮ Harry Kesten's work in probability theory ⋮ On the truncated anisotropic long-range percolation on \(\mathbb Z^2\)

This page was built for publication: On the connectedness of a random graph