Skip to main content

Decimation of Fast States and Weak Nodes: Topological Variation via Persistent Homology

  • Conference paper

Part of the book series: Springer Proceedings in Complexity ((SPCOM))

Abstract

We study the topological variation in Markov processes and networks due to a coarse-graining procedure able to preserve the Markovian property. Such coarse-graining method simplifies master equation by neglecting the fast states and significantly reduces the network size by decimating weak nodes.

We use persistent homology to identify the robust topological structure which survive after the coarse-graining.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Pigolotti S, Vulpiani A (2008) J Chem Phys 128:154114

    Article  ADS  Google Scholar 

  2. Puglisi A, Pigolotti S, Rondoni L, Vulpiani A (2010) J Stat Mech 2010:P05015

    Article  Google Scholar 

  3. Serrano M, Boguñá M, Vespignani A (2009) Extracting the multiscale backbone of complex weighted networks. Proc Natl Acad Sci USA 106(16):6483

    Article  ADS  Google Scholar 

  4. Grady D, Thiemann C, Brockmann D (2011) Parameter-free identification of salient features in complex networks. arXiv:1110.3864

  5. Albert R, Barabasi A (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47–97

    Article  MathSciNet  ADS  MATH  Google Scholar 

  6. Dorogovtsev SN, Goltsev AV, Mendes JFF (2008) Critical phenomena in complex networks. Rev Mod Phys 80(4):1275–1335. doi:10.1103/RevModPhys.80.1275

    Article  ADS  Google Scholar 

  7. Zomorodian A, Carlsson G (2005) Computing persistent homology. Discrete Comput Geom 33(2):249–274

    Article  MathSciNet  MATH  Google Scholar 

  8. Bollobás B, Borgs C, Chayes J, Riordan O (2003) Directed scale-free graphs. In: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, pp 132–139

    Google Scholar 

  9. Barabasi A, Albert R (1999) Emergence of scaling in random networks. Scienze 286:509–512. Also in Physica A 281:69–77 (2000)

    Article  MathSciNet  ADS  Google Scholar 

Download references

Acknowledgements

L. Rondoni gratefully acknowledges financial support from the European Research Council under the European Community’s Seventh Framework Programme (FP7/2007-2013)/ERC Grant agreement No. 202680. The EC is not liable for any use that can be made on the information contained herein.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Donato, I., Petri, G., Scolamiero, M., Rondoni, L., Vaccarino, F. (2013). Decimation of Fast States and Weak Nodes: Topological Variation via Persistent Homology. In: Gilbert, T., Kirkilionis, M., Nicolis, G. (eds) Proceedings of the European Conference on Complex Systems 2012. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-319-00395-5_39

Download citation

Publish with us

Policies and ethics