Statistical mechanics of random hyperbolic graphs within the fermionic maximum-entropy framework
From MaRDI portal
Cites work
- A critical point for random graphs with a given degree sequence
- A first course in network science
- A Mathematical Theory of Communication
- An Exponential Family of Probability Distributions for Directed Graphs
- Analysis of Complex Networks
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Clustering and the hyperbolic geometry of complex networks
- Clustering in a hyperbolic model of complex networks
- Collective dynamics of `small-world' networks
- Connected components in random graphs with given expected degree sequences
- Constructing and sampling directed graphs with given degree sequences
- Dynamical Processes on Complex Networks
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- scientific article; zbMATH DE number 2205220 (Why is no real title available?)
- Information Theory and Statistical Mechanics
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Network science. With Márton Pósfai
- Networks. An introduction.
- On the diameter of hyperbolic random graphs
- Power-law distributions in empirical data
- Random Graphs
- Random graphs with a given degree sequence
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- Random Plane Networks
- Scaling up real networks by geometric branching growth
- Soft communities in similarity space
- Sparse maximum-entropy random graphs with a given power-law degree distribution
- Spectral gap of random hyperbolic graphs and related parameters
- Statistical mechanics of complex networks
- Statistical mechanics of complex networks. Selected contributions from the XVIII Sitges Conference ``Statistical mechanics of complex networks, Sitges, Barcelona, Spain, June 10--14, 2002
- The asymptotic number of labeled graphs with given degree sequences
- The average distances in random graphs with given expected degrees
- The diameter of KPKVB random graphs
- The diameter of sparse random graphs
- Typical distances in a geometric model for complex networks
This page was built for publication: Statistical mechanics of random hyperbolic graphs within the fermionic maximum-entropy framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313847)
