Persistent homology of complex networks

@article{Horak2009PersistentHO,
  title={Persistent homology of complex networks},
  author={Danijela Horak and Slobodan Maleti{\'c} and Milan Rajkovi{\'c}},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  year={2009},
  volume={2009},
  pages={03034}
}
Long-lived topological features are distinguished from short-lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and presented as a parameterized version of a Betti number. Complex networks with distinct degree distributions exhibit distinct persistent topological features. Persistent topological attributes, shown to be related to the robust quality of networks, also reflect the… 
Persistent homology of directed networks
TLDR
A method for constructing simplicial complexes from weighted, directed networks that captures directionality information is studied, and it is able to prove that the persistent homology of such complexes is stable with respect to a certain notion of network distance.
Persistent Homology of Collaboration Networks
TLDR
Persistent homology, a recent technique from computational topology, is used to analyse four weighted collaboration networks and it is shown that persistent homology corresponds to tangible features of the networks.
Topological Strata of Weighted Complex Networks
TLDR
This work introduces a novel method, based on persistent homology, to detect particular non-local structures, akin to weighted holes within the link-weight network fabric, which are invisible to existing methods and creates the first bridge between network theory and algebraic topology, which will allow to import the toolset of algebraic methods to complex systems.
Topological graph persistence
Abstract Graphs are a basic tool in modern data representation. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional
Persistent homology of unweighted complex networks via discrete Morse theory
TLDR
This work presents a new method based on discrete Morse theory to study topological properties of unweighted and undirected networks using persistent homology that achieves close to the theoretical minimum number of critical simplices in several analyzed model and real networks.
Combinatorial Laplacian and entropy of simplicial complexes associated with complex networks
TLDR
The properties of spectra of combinatorial Laplacian operator of simplicial complexes are explored and its relationship with connectivity properties of the Q-vector and with connectivities of cliques in the simplicial clique complex is shown.
Comparative Topological Signatures of Growing Collaboration Networks
TLDR
This work introduces a distance metric for comparing the topological signatures, and using it, visualize the similarity between individual segments through multidimensional scaling and shows that homology-based signatures can be effective in discriminating between real-world networks.
Persistence homology of networks: methods and applications
TLDR
A conceptual review of key advancements in this area of using persistent homology on complex network science, focusing on recent approaches that get significant attention in the mathematics and data mining communities working on network data.
Persistent Homology of Asymmetric Networks: An Approach based on Dowker Filtrations
TLDR
Methods for computing two network features with topological underpinnings: the Rips and Dowker Persistent Homology Diagrams and the sensitivity of Dowker persistence diagrams to intrinsic asymmetry in the data are proposed.
Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks
TLDR
A persistence-based algorithm is able to detect clique communities and to keep track of their evolution according to different edge weight thresholds, and an interactive visualization tool based on nested graphs that is capable of compactly representing the evolving relationships between communities for different thresholds and clique degrees is proposed.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 51 REFERENCES
Computing Persistent Homology
Abstract We show that the persistent homology of a filtered d-dimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analysis
Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities.
  • M. Mitrovic, B. Tadić
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
TLDR
Within the exhaustive spectral analysis for both the adjacency matrix and the normalized Laplacian matrix, the spectral properties, which characterize the mesoscopic structure of sparse cyclic graphs and trees are identified.
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
Topology of random clique complexes
Topological Persistence and Simplification
TLDR
Fast algorithms for computing persistence and experimental evidence for their speed and utility are given for topological simplification within the framework of a filtration, which is the history of a growing complex.
The neighborhood complex of a random graph
Self-similar community structure in a network of human interactions.
TLDR
The results reveal the self-organization of the network into a state where the distribution of community sizes is self-similar, suggesting that a universal mechanism, responsible for emergence of scaling in other self-organized complex systems, as, for instance, river networks, could also be the underlying driving force in the formation and evolution of social networks.
Simplicial complexes of graphs
Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a fami
Small worlds: the dynamics of networks between order and randomness
  • Jie Wu
  • Computer Science
    SGMD
  • 2002
Everyone knows the small-world phenomenon: soon after meeting a stranger, we are surprised to discover that we have a mutual friend, or we are connected through a short chain of acquaintances. In his
...
1
2
3
4
5
...