We introduce a graph renormalization procedure based on the coarse-grained Laplacian, which generates reduced-complexity representations across scales. This method retains both dynamics and large-scale topological structures, while reducing redundant informati... ...

请注册登录后继续浏览