Surprising behavior of the average degree for a node's neighbors in growth networks

DOI10.1007/978-3-030-93409-5_39MaRDI QIDQ2086624zbMATH OpenOpenAlexFDO

Authors Sergey Tyshkevich, Sergei P. Sidorov, Sergei V. Mironov

Publication date 25 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-93409-5_39

zbMATH Keywords

average nearest neighbor degreecomplex networksmean-field methodnetwork analysisnetwork evolutionnode degreepreferential attachment model

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15)

Recommendations

• Finite-time fluctuations in the degree statistics of growing networks
• A note on mean-field theory for scale-free random networks
• Asymptotic behavior of connecting-nearest-neighbor models for growing networks
• Rate equation appraoch for growing networks
• Finiteness and fluctuations in growing networks

Cites work

• A generalised model for asymptotically-scale-free geographical networks
• Degree-degree correlation in networks with preferential attachment based growth
• Growth network models with random number of attached links
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
• The Bass diffusion model on finite Barabasi-Albert networks

This page was built for publication: Surprising behavior of the average degree for a node's neighbors in growth networks

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