Abstract: We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely neglected, are not only relevant but dominant. We derive general analytical formulas that show a persistence of universality in a different form to percolation theory, and provide numerical confirmation. We also demonstrate the simplicity of our approach in three simple but instructive examples and discuss the practical benefits of its application to different models.
Recommendations
Cites work
- scientific article; zbMATH DE number 1698827 (Why is no real title available?)
- scientific article; zbMATH DE number 3120653 (Why is no real title available?)
- scientific article; zbMATH DE number 3148802 (Why is no real title available?)
- scientific article; zbMATH DE number 1340281 (Why is no real title available?)
- Can One Hear the Shape of a Drum?
- Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
- Continuum percolation of wireless ad hoc communication networks
- Fundamentals of Wireless Communication
- Information percolation in segmented markets
- PERCOLATION AND TUNNELING IN COMPOSITE MATERIALS
- Random Geometric Graphs
- Random graphs.
Cited in
(7)- The direct-connectedness function in the random connection model
- Connectivity of soft random geometric graphs over annuli
- Connectivity of soft random geometric graphs
- Critically spanning epidemic outbreak cluster in random geometric networks
- Distance distribution between two random points in arbitrary polygons
- Isolation and connectivity in random geometric graphs with self-similar intensity measures
- Isotropic random geometric networks in two dimensions with a penetrable cavity
This page was built for publication: Full connectivity: corners, edges and faces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438752)
