A geometric entropy measuring networks complexity

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Unknown venue

• Publication date

  2014-10-20

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A geometric entropy detecting the Erdös-Rényi phase transition

  2015cited by this paper
• Quantifying networks complexity from information geometry viewpoint

  2013cited by this paper
• Molecular signaling network complexity is correlated with cancer patient survivability

  2012cited by this paper
• The diminishing role of hubs in dynamical processes on complex networks

  2011cited by this paper
• A geometric approach to complexity.

  2011cited by this paper
• Shannon and von Neumann entropy of random networks with heterogeneous expected degree.

  2010cited by this paper
• Quantifying network heterogeneity.

  2010cited by this paper
• Matrix Mathematics: Theory, Facts, and Formulas

  2009cited by this paper
• What is a complex graph

  2008cited by this paper
• Works on an information geometrodynamical approach to chaos

  2008cited by this paper
• Critical phenomena in complex networks

  2007cited by this paper
• The entropy of randomized network ensembles

  2007cited by this paper
• Modularity and community structure in networks.

  2006cited by this paper
• Asymptotic entropy and Green speed for random walks on countable groups

  2006cited by this paper
• Complex networks: Structure and dynamics

  2006cited by this paper
• Geometry and Topology: List of figures

  2005cited by this paper
• Homogeneous complex networks

  2005cited by this paper
• Random walks on complex networks.

  2003cited by this paper
• Class of correlated random networks with hidden variables.

  2003cited by this paper
• Assortative mixing in networks.

  2002cited by this paper
• Scale-free networks from varying vertex intrinsic fitness.

  2002cited by this paper
• Statistical mechanics of complex networks

  2001cited by this paper
• Network robustness and fragility: percolation on random graphs.

  2000cited by this paper
• Methods of information geometry

  2000cited by this paper
• Emergence of Scaling in Random Networks

  1999cited by this paper
• Collective dynamics of ‘small-world’ networks

  1998cited by this paper
• Random Graphs

  1985cited by this paper
• The evolution of random graphs

  1984cited by this paper
• The Asymptotic Number of Labeled Graphs with Given Degree Sequences

  1978cited by this paper
• Introduction to the Technique of Dimensional Regularization

  1975cited by this paper
• Introduction to Phase Transitions and Critical Phenomena

  1972cited by this paper
• Logical basis for information theory and probability theory

  1968cited by this paper
• Science and information theory

  1956cited by this paper
• A mathematical theory of communication

  1948cited by this paper
• F ¨ Ur Mathematik in Den Naturwissenschaften Leipzig Quantifying Structure in Networks Quantifying Structure in Networks

  year unknowncited by this paper

• Gaussian Network's Dynamics Reflected into Geometric Entropy

  2015cites this paper
• RNN-based Model for Self-adaptive Systems - The Emergence of Epilepsy in the Human Brain

  2014cites this paper