Full Connectivity: Corners, edges and faces
classification
❄️ cond-mat.dis-nn
cs.DMmath-phmath.MPmath.PR
keywords
connectivitydifferentfullpercolationanalyticalapplicationapproachbeen
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.