Identifying networks with common organizational principles

@article{Wegner2018IdentifyingNW,
  title={Identifying networks with common organizational principles},
  author={Anatol E. Wegner and Luis Ospina-Forero and Robert E. Gaunt and Charlotte M. Deane and Gesine Reinert},
  journal={J. Complex Networks},
  year={2018},
  volume={6},
  pages={887-913}
}
Many complex systems can be represented as networks, and the problem of network comparison is becoming increasingly relevant. There are many techniques for network comparison, from simply comparing network summary statistics to sophisticated but computationally costly alignment-based approaches. Yet it remains challenging to accurately cluster networks that are of a different size and density, but hypothesized to be structurally similar. In this paper, we address this problem by introducing a… 
Capitalizing on Hierarchical Graph Decomposition for Scalable Network Analysis
TLDR
This work decomposes large networks to reveal the underlying hierarchy and extract signals from this hierarchical topology to solve three network analysis problems viz., network comparison, determining influential spreaders, and centrality computation.
Network classification-based structural analysis of real networks and their model-generated counterparts
TLDR
This paper studies 500 real-world networks along with 2,000 synthetic networks generated by four frequently used network models with previously calibrated parameters to make the generated graphs as similar to the real networks as possible and finds that the correlation profiles of the structural measures differ across network domains and the domain can be determined using a small selection of graph metrics.
Efficient hypothesis testing for community detection in heterogeneous networks by graph dissimilarity
TLDR
This work designs a two-stage bipartitioning algorithm to uncover the number of communities and the corresponding structure simultaneously and proposes an efficient hypothesis test for community detection based on quantifying dissimilarities between graphs.
Graph Comparison via the Non-backtracking Spectrum
TLDR
This work defines a new pseudometric based on the spectrum of the nonbacktracking graph operator and shows that it cannot only be used to compare graphs generated through different mechanisms but can reliably compare graphs of varying size.
Clique and cycle frequencies in a sparse random graph model with overlapping communities
TLDR
Large-scale approximations of clique and cycle frequencies for graph samples generated by this model are presented, which are valid for regimes with bounded and unbounded number of overlapping communities.
Triad-Based Comparison and Signatures of Directed Networks
TLDR
Two methods for comparing directed networks based on triad counts, called TriadEuclid and TriadEMD, are introduced and signature triads and signature orbits for each type of networks are found, which show the main triad and orbit contributions of the networks when comparing them to the other networks in the respective data set.
THE N ON-BACKTRACKING S PECTRUM
TLDR
This work defines a new metric based on the spectrum of the non-backtracking graph operator and shows that it can be used to compare graphs generated through different mechanisms, but can reliably compare graphs of varying size.
Graph Pseudometrics from a Topological Point of View
TLDR
Methods to measure how well a graph pseudometric captures the topology of a directed graph are introduced and used to evaluate some well-established pseudometrics, using test data drawn from several families of random graphs.
Estimating Networks of Sustainable Development Goals
An increasing number of researchers and practitioners advocate for a systemic understanding of the Sustainable Development Goals (SDGs) through network analysis. Ironically, the burgeoning
...
1
2
3
...

References

SHOWING 1-10 OF 71 REFERENCES
Taxonomies of networks from community structure.
TLDR
A framework for constructing taxonomies of networks based on their structural similarities is introduced and applied to construct a taxonomy for 746 networks and it is demonstrated that the approach usefully identifies similar networks.
Network motifs: simple building blocks of complex networks.
TLDR
Network motifs, patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks, are defined and may define universal classes of networks.
Superfamilies of Evolved and Designed Networks
TLDR
An approach to systematically study similarity in the local structure of networks, based on the significance profile (SP) of small subgraphs in the network compared to randomized networks, finds several superfamilies of previously unrelated networks with very similar SPs.
Building blocks of biological networks: a review on major network motif discovery algorithms.
TLDR
The authors will give a review on computational aspects of major algorithms and enumerate their related benefits and drawbacks from an algorithmic perspective.
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Revealing the Hidden Language of Complex Networks
TLDR
This work discovers that the interaction between a small number of roles, played by nodes in a network, can characterize a network's structure and also provide a clear real-world interpretation, and develops a framework for analysing and comparing networks, which outperforms all existing ones.
Comparison of large networks with sub-sampling strategies
TLDR
This work introduces a sub-sampling procedure based on neighbourhoods which links naturally with the framework of network comparisons through local neighbourhood comparisons, and basing the Netdis statistic on a sample of similar-sized neighbourhoods.
Biological network comparison using graphlet degree distribution
TLDR
Almost all of the 14 eukaryotic PPI networks, including human, resulting from various high-throughput experimental techniques, as well as from curated databases, are better modeled by geometric random graphs than by Erdös-Rény, random scale-free, or Barabási-Albert scale- free networks.
Empirical Analysis of an Evolving Social Network
TLDR
This work analyzed a dynamic social network comprising 43,553 students, faculty, and staff at a large university, in which interactions between individuals are inferred from time-stamped e-mail headers recorded over one academic year and are matched with affiliations and attributes.
Integrative network alignment reveals large regions of global network similarity in yeast and human
TLDR
A novel network alignment algorithm, called Matching-based Integrative GRAph ALigner (MI-GRAAL), which can integrate any number and type of similarity measures between network nodes (e.g. proteins), including, but not limited to, any topological network similarity measure, sequence similarity, functional similarity and structural similarity.
...
1
2
3
4
5
...