Complex networks: structure and functionality
From MaRDI portal
Publication:2119911
DOI10.2969/aspm/08710137zbMath1486.05289OpenAlexW4290667762MaRDI QIDQ2119911
Publication date: 30 March 2022
Full work available at URL: https://doi.org/10.2969/aspm/08710137
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81) Density (toughness, etc.) (05C42)
Cites Work
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- The large deviation principle for the Erdős-Rényi random graph
- Equivalence and nonequivalence of ensembles: thermodynamic, macrostate, and measure levels
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Cutoff phenomena for random walks on random regular graphs
- Mixing times of random walks on dynamic configuration models
- Covariance structure behind breaking of ensemble equivalence in random graphs
- Random walks on the random graph
- Ensemble equivalence for dense graphs
- Cutoff for nonbacktracking random walks on sparse random graphs
- Random walks on dynamic configuration models: a trichotomy
- Singularities in the entropy of asymptotically large simple graphs
- Ensemble nonequivalence in random graphs with modular structure
- Information Theory and Statistical Mechanics
- A graphon approach to limiting spectral distributions of Wigner‐type matrices
- Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs
This page was built for publication: Complex networks: structure and functionality
