Percolation phase transition in random geometric networks

Abstract

Association of idealized graphs with real-world networks are often confronted with finite-sized effects of reality with the fact that there always exists a maximum number of entities associated with either nodes or edges. We show that random geometric networks (RGNs) undergo phase transition from defragmented nodes to fully connected nodes as the transmission radius R is tuned with respect to its critical point. Moreover, the network attributes either vary with the network size N or follow a behavior that is independent of N.