Impact of boundaries on fully connected random geometric networks

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.

6 pages, 3 figures

References in corpus (4)

• Quantifying social group evolution
• Understanding the spreading patterns of mobile phone viruses
• The critical effect of dependency groups on the function of networks
• Geometric Exponents, SLE and Logarithmic Minimal Models

Cited by in corpus (18)

• Random geometric graphs with general connection functions
• Epidemic Spreading in Random Rectangular Networks
• Connectivity of Soft Random Geometric Graphs Over Annuli
• Topological versus spectral properties of random geometric graphs
• Betweenness Centrality in Dense Random Geometric Networks
• Entropy of Spatial Network Ensembles
• Betweenness centrality in dense spatial networks
• Connectivity of confined 3D Networks with Anisotropically Radiating Nodes
• Random spherical graphs
• Spatial networks with wireless applications
• Network connectivity through small openings
• k-connectivity for confined random networks
• Influence of boundary conditions on quantum escape
• Random-Graph Models and Characterization of Granular Networks
• Connectivity of Confined Dense Networks: Boundary Effects and Scaling Laws
• A Random-Line-Graph Approach to Overlapping Line Segments
• Location, location, location: Border effects in interference limited ad hoc networks
• Connectivity of Ad Hoc Wireless Networks with Node Faults