Networks and Cycles: A Persistent Homology Approach to Complex Networks

  • Giovanni Petri
  • Martina Scolamiero
  • Irene Donato
  • Francesco Vaccarino
Conference paper
Part of the Springer Proceedings in Complexity book series (SPCOM)

Abstract

Persistent homology is an emerging tool to identify robust topological features underlying the structure of high-dimensional data and complex dynamical systems (such as brain dynamics, molecular folding, distributed sensing).

Its central device, the filtration, embodies this by casting the analysis of the system in terms of long-lived (persistent) topological properties under the change of a scale parameter.

In the classical case of data clouds in high-dimensional metric spaces, such filtration is uniquely defined by the metric structure of the point space. On networks instead, multiple ways exists to associate a filtration. Far from being a limit, this allows to tailor the construction to the specific analysis, providing multiple perspectives on the same system.

In this work, we introduce and discuss three kinds of network filtrations, based respectively on the intrinsic network metric structure, the hierarchical structure of its cliques and—for weighted networks—the topological properties of the link weights. We show that persistent homology is robust against different choices of network metrics. Moreover, the clique complex on its own turns out to contain little information content about the underlying network. For weighted networks we propose a filtration method based on a progressive thresholding on the link weights, showing that it uncovers a richer structure than the metrical and clique complex approaches.

Keywords

Complex networks Persistent homology Metrics Computational topology 

References

  1. 1.
    Newman M (2010) Networks: an introduction. Oxford University Press, New York MATHGoogle Scholar
  2. 2.
    Albert R, Barabasi A (2002) Statistical mechanics of complex networks. Reviews of Modern Physics 74(1):47–97 MathSciNetADSMATHCrossRefGoogle Scholar
  3. 3.
    Schaub MT, Delvenne JC, Yaliraki SN, Barahona M (2012) Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit. PloS One 7(2):e32210 ADSCrossRefGoogle Scholar
  4. 4.
    Barthlemy M (2011) Spatial networks. Physics Reports 499(13):1–101 MathSciNetADSCrossRefGoogle Scholar
  5. 5.
    Boguna M, Papadopoulos F, Krioukov D (2010) Sustaining the internet with hyperbolic mapping. Nature Communications 1:62 ADSCrossRefGoogle Scholar
  6. 6.
    Conradi C, Flockerzi D, Raisch J, Stelling J (2007) Subnetwork analysis reveals dynamic features of complex (bio)chemical networks. Proceedings of the National Academy of Sciences 104(49):19175–19180 ADSCrossRefGoogle Scholar
  7. 7.
    Henderson JA, Robinson PA (2011) Geometric effects on complex network structure in the cortex. Phys Rev Lett 107:018102 ADSCrossRefGoogle Scholar
  8. 8.
    Zomorodian A, Carlsson G (2005) Computing persistent homology. Discrete Comput Geom 33(2):249–274 MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Carlsson G (2009) Topology and data. Bulletin of the American Mathematical Society 46(2):255–308 MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Horak D, Maletic S, Rajkovic M (2009) Persistent homology of complex networks. Journal of Statistical Mechanics: Theory and Experiment 2009(03):P03034 MathSciNetCrossRefGoogle Scholar
  11. 11.
    Fouss F, Yen L, Pirotte A, Saerens M (2006) An experimental investigation of graph kernels on a collaborative recommendation task. In: Sixth international conference on data mining (ICDM’06), pp 863–868 CrossRefGoogle Scholar
  12. 12.
    Bolch G, Greiner S, de Meer H, Trivedi KS (1998) Queueing networks and Markov chains: modeling and performance evaluation with computer science applications. Wiley-Interscience, New York MATHCrossRefGoogle Scholar
  13. 13.
    Kondor R, Lafferty J (2002) Diffusion kernels on graphs and other discrete input spaces. In: Proceedings of the nineteenth international conference on machine learning (ICML’02), pp 315–322 Google Scholar
  14. 14.
    Smola A, Kondor R (2003) Kernels and regularization on graphs. In: Learning theory and kernel machines. Lecture notes in computer science, vol 2777, pp 144–158 CrossRefGoogle Scholar
  15. 15.
    Kandola J, Shawe-Taylor J, Cristianini N (2002) Learning semantic similarity. Advances in neural information processing systems 15:657–666 Google Scholar
  16. 16.
    Yen L, Fouss F, Decaestecker C, Francq P, Saerens M (2007) Graph nodes clustering based on the commute-time kernel. In: Zhou ZH, Li H, Yang Q (eds) Advances in knowledge discovery and data mining. Lecture notes in computer science, vol 4426. Springer, Berlin, pp 1037–1045 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Giovanni Petri
    • 1
  • Martina Scolamiero
    • 2
  • Irene Donato
    • 2
  • Francesco Vaccarino
    • 1
    • 2
  1. 1.ISI FoundationTorinoItaly
  2. 2.Dipartimento di Scienze MatematichePolitecnico di TorinoTorinoItaly

Personalised recommendations