Sampling-based box-covering algorithm for renormalization of networks

DOI10.1063/1.5093174zbMath1440.05186OpenAlexW2954125717WikidataQ91559881 ScholiaQ91559881MaRDI QIDQ5227591

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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