An enumeration approach to network evolution

DOI10.18514/MMN.2023.4133MaRDI QIDQ6064719zbMATH OpenOpenAlexFDO

Authors Gábor Bacsó, József Túri

Publication date 12 December 2023

Published in Miskolc Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.18514/mmn.2023.4133

zbMATH Keywords

enumerationpreferential attachment rulerandom graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Central limit and other weak theorems (60F05)

Recommendations

• Asymptotic degree distribution in a homogeneous evolving network model
• An evolving random network and its asymptotic structure
• Persistence of hubs in growing random networks
• The \(N\)-star network evolution model
• On a 2-parameter class of scale free random graphs

This page was built for publication: An enumeration approach to network evolution

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