Measuring the variability of local characteristics in complex networks: empirical and analytical analysis

DOI10.1063/5.0148803MaRDI QIDQ6548686zbMATHFDO

Authors Sergei V. Sidorov, Sergei V. Mironov, A. A. Grigor'ev

Publication date 1 June 2024

Published in Chaos (Search for Journal in Brave)

zbMATH Keywords

Markov stochastic processBarabási-Albert network

Mathematics Subject Classification ID

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

• Centrality-friendship paradoxes: when our friends are more important than us
• Clustering coefficients of large networks
• Degree-degree correlation in networks with preferential attachment based growth
• Dynamics of node influence in network growth models
• Emergence of Scaling in Random Networks
• GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness
• Influence of the nearest-neighbor connections on shaping weighted evolving network
• Power-law distributions in empirical data
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• The friendship paradox in real and model networks

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)