A robust method for fitting degree distributions of complex networks

DOI10.1093/COMNET/CNAD023MaRDI QIDQ6079539zbMATH OpenFDO

Authors

Publication date 29 September 2023

Published in Journal of Complex Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/COMNET/CNAD023

zbMATH Keywords

complex networksdegree distributiongraphmaximum likelihood estimatorsnetworkpower law

Mathematics Subject Classification ID

Statistics (62-XX) Operations research, mathematical programming (90-XX)

Cited in

(6)

• The adaptive coupling scheme and the heterogeneity in intrinsic frequency and degree distributions of the complex networks
• Method of characteristic functions for classes of networks with fixed node degrees
• A coarse graining algorithm based on \(m\)-order degree in complex network
• Universal method on degree distribution of the improved Barabási-Albert model
• Laplacian spectra and coherence analysis of asymmetric networks under noise disturbance
• The topological characteristics and robustness analysis for a class of fractal weighted networks

This page was built for publication: A robust method for fitting degree distributions of complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079539)