Measuring the variability of local characteristics in complex networks: empirical and analytical analysis
DOI10.1063/5.0148803zbMATH Open1545.90041MaRDI QIDQ6548686FDOQ6548686
Authors: Sergei V. Sidorov, Sergei V. Mironov, A. A. Grigor'ev 
Publication date: 1 June 2024
Published in: Chaos (Search for Journal in Brave)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex degrees (05C07)
Cites Work
- Power-law distributions in empirical data
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Influence of the nearest-neighbor connections on shaping weighted evolving network
- The friendship paradox in real and model networks
- Degree-Degree Correlation in Networks with Preferential Attachment Based Growth
- Clustering coefficients of large networks
- GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness
- Centrality-friendship paradoxes: when our friends are more important than us
- Dynamics of node influence in network growth models
This page was built for publication: Measuring the variability of local characteristics in complex networks: empirical and analytical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548686)
