Random Sequential Renormalization of Networks I: Application to Critical Trees
Golnoosh Bizhani, Vishal Sood, Maya Paczuski, and Peter Grassberger

TL;DR
This paper introduces Random Sequential Renormalization (RSR) for networks, applies it to critical trees, and analytically characterizes the evolution of network structure through three regimes, revealing power-law degree distributions and hub formation.
Contribution
It presents a simple, implementable RSR method and provides analytical and numerical insights into the structural evolution of critical trees under this renormalization.
Findings
RSR is described by a mean field theory in the initial regime.
Degree distribution broadens to a power law with exponent 2.
Star configurations with hubs emerge in the final regime.
Abstract
We introduce the concept of Random Sequential Renormalization (RSR) for arbitrary networks. RSR is a graph renormalization procedure that locally aggregates nodes to produce a coarse grained network. It is analogous to the (quasi-)parallel renormalization schemes introduced by C. Song {\it et al.} (Nature {\bf 433}, 392 (2005)) and studied more recently by F. Radicchi {\it et al.} (Phys. Rev. Lett. {\bf 101}, 148701 (2008)), but much simpler and easier to implement. In this first paper we apply RSR to critical trees and derive analytical results consistent with numerical simulations. Critical trees exhibit three regimes in their evolution under RSR: (i) An initial regime , where is the number of nodes at some step in the renormalization and is the initial size. RSR in this regime is described by a mean field theory and fluctuations from one realization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
