2000 character limit reached
Impact of boundaries on fully connected random geometric networks
Published 21 Oct 2011 in cond-mat.dis-nn, cs.NI, math-ph, math.MP, and math.PR | (1110.4929v2)
Abstract: Many complex networks exhibit a percolation transition involving a macroscopic connected component, with universal features largely independent of the microscopic model and the macroscopic domain geometry. In contrast, we show that the transition to full connectivity is strongly influenced by details of the boundary, but observe an alternative form of universality. Our approach correctly distinguishes connectivity properties of networks in domains with equal bulk contributions. It also facilitates system design to promote or avoid full connectivity for diverse geometries in arbitrary dimension.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.