Sampling-based box-covering algorithm for renormalization of networks

DOI10.1063/1.5093174zbMATH Open1440.05186OpenAlexW2954125717WikidataQ91559881 ScholiaQ91559881MaRDI QIDQ5227591FDOQ5227591

Bing-Hong Wang, Yu He, Ming-Yang Zhou, Xingtong Wu, Zong-Wen Wei, Hao Liao

Publication date: 6 August 2019

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.5093174

Recommendations

• Minimal partition coverings and generalized dimensions of a complex network
• A max-min ant colony algorithm for fractal dimension of complex networks
• Maximal entropy coverings and the information dimension of a complex network
• Stable network topologies using the notion of covering
• A survey of fractal dimensions of networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Algorithm 457: finding all cliques of an undirected graph
• A faster algorithm for betweenness centrality*
• A note on the problem of reporting maximal cliques
• Renormalization group theory: Its basis and formulation in statistical physics
• A box-covering algorithm for fractal scaling in scale-free networks
• Enumerating all connected maximal common subgraphs in two graphs

This page was built for publication: Sampling-based box-covering algorithm for renormalization of networks

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