Pattern Detection in Complex Networks: Correlation Profile of the Internet
Sergei Maslov, Kim Sneppen, Alexei Zaliznyak
Abstract
A general scheme for detecting and analyzing topological patterns in large complex networks is presented. In this scheme the network in question is compared with its properly randomized version that preserves some of its low-level topological properties. Statistically significant deviation of any measurable property of a network from this null model likely reflect its design principles and/or evolutionary history. We illustrate this basic scheme on the example of the correlation profile of the Internet quantifying correlations between connectivities of its neighboring nodes. This profile distinguishes the Internet from previously studied molecular networks with a similar scale-free connectivity distribution. We finally demonstrate that clustering in a network is very sensitive to both the connectivity distribution and its correlation profile and compare the clustering in the Internet to the appropriate null model.
Create a lesson
Related papers
Developing the Statistical Mechanics of Evolving Assembly Spaces
Anisha K. Yeddanapudi, Abhishek Sharma, Ian Seet et al.
Ergodicity breaking transition beyond qubits
Tanay Pathak, Abhik Kumar Saha
Extended-range percolation on lattices with cubic and non-compact neighborhoods in three dimensions
Zhe Zhang, Yuxuan Fan, Yang Yang et al.
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov