Papers
Topics
Authors
Recent
Search
2000 character limit reached

Full Connectivity: Corners, edges and faces

Published 15 Jan 2012 in cond-mat.dis-nn, cs.DM, math-ph, math.MP, and math.PR | (1201.3123v1)

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.

Citations (66)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.