A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing function g:R^+->[0, 1] which together determine a methodology for drawing edges between various vertex points in R^d for some d. In this case, the function g is said to be a connection function and the RCM is said to be driven by X. The model itself is denoted by (X, g).
AB percolation | Bernoulli percolation model | bond percolation | Boolean model | Boolean-Poisson model | bootstrap percolation | Cayley tree | cluster | cluster perimeter | continuum percolation theory | dependent percolation | discrete percolation theory | disk model | first-passage percolation | germ-grain model | inhomogeneous percolation model | lattice animal | long-range percolation model | mixed percolation model | oriented percolation model | percolation | percolation theory | percolation threshold | polyomino | random-cluster model | random walk | s-cluster | site percolation | s-run