Networks and cycles: A persistent homology approach to complex networks

Springer Proceedings in Complexity

Volumn , Issue , 2013, Pages 93-99

  Petri, Giovanni ^a   Scolamiero, Martina ^b   Donato, Irene ^b   Vaccarino, Francesco ^a,b  

^a ISI FOUNDATION   (Italy)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Complex networks; Computational topology; Metrics; Persistent homology

Indexed keywords

EID: 85060478253     PISSN: 22138684     EISSN: 22138692     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-319-00395-5_15     Document Type: Chapter

References (16)

1. Newman M (2010) Networks: an introduction. Oxford University Press, New York
2. Albert R, Barabasi A (2002) Statistical mechanics of complex networks. Reviews of Modern Physics 74(1):47–97
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
4. Barthlemy M (2011) Spatial networks. Physics Reports 499(13):1–101
5. Boguna M, Papadopoulos F, Krioukov D (2010) Sustaining the internet with hyperbolic mapping. Nature Communications 1:62
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
7. Henderson JA, Robinson PA (2011) Geometric effects on complex network structure in the cortex. Phys Rev Lett 107:018102
8. Zomorodian A, Carlsson G (2005) Computing persistent homology. Discrete Comput Geom 33(2):249–274
9. Carlsson G (2009) Topology and data. Bulletin of the American Mathematical Society 46(2):255–308
10. Horak D, Maletic S, Rajkovic M (2009) Persistent homology of complex networks. Journal of Statistical Mechanics: Theory and Experiment 2009(03):P03034
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
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
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
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
15. Kandola J, Shawe-Taylor J, Cristianini N (2002) Learning semantic similarity. Advances in neural information processing systems 15:657–666
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