Simplicial complexes of networks and their statistical properties

25Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Topological, algebraic and combinatorial properties of simplicial complexes which are constructed from networks (graphs) are examined from the statistical point of view. We show that basic statistical features of scale free networks are preserved by topological invariants of simplicial complexes and similarly statistical properties pertaining to topological invariants of other types of networks are preserved as well. Implications and advantages of such an approach to various research areas involving network concepts are discussed. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Maletić, S., Rajković, M., & Vasiljević, D. (2008). Simplicial complexes of networks and their statistical properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5102 LNCS, pp. 568–575). https://doi.org/10.1007/978-3-540-69387-1_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free