Related papers: Spectral renormalization group theory on networks
We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…
Various physical quantities -- including real-time response, inclusive cross-sections, and decay rates -- may not be directly determined from Euclidean correlators. They are, however, easily determined from the spectral density, motivating…
Multiple scales coexist in complex networks. However, the small world property makes them strongly entangled. This turns the elucidation of length scales and symmetries a defiant challenge. Here, we define a geometric renormalization group…
We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…
Complex networks have acquired a great popularity in recent years, since the graph representation of many natural, social and technological systems is often very helpful to characterize and model their phenomenology. Additionally, the…
Heterogeneous and complex networks represent intertwined interactions between real-world elements or agents. Determining the multi-scale mesoscopic organization of clusters and intertwined structures is still a fundamental and open problem…
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…
Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the many-body interactions existing in complex systems raging from the brain to high-order social networks.…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
A perturbative description of Large Scale Structure is a cornerstone of our understanding of the observed distribution of matter in the universe. Renormalization is an essential and defining step to make this description physical and…
We study the small-world network model, which mimics the transition between regular-lattice and random-lattice behavior in social networks of increasing size. We contend that the model displays a normal continuous phase transition with a…
Renormalization group calculations are used to give exact solutions for rigidity percolation on hierarchical lattices. Algebraic scaling transformations for a simple example in two dimensions produce a transition of second order, with an…
For scalar QED on a three-dimensional toroidal lattice with a fine lattice spacing we consider the renormalization problem of choosing counter terms depending on the lattice spacing, so that the theory stays finite as the spacing goes to…
We review current progress in the functional renormalization group treatment of disordered systems. After an elementary introduction into the phenomenology, we show why in the context of disordered systems a functional renormalization group…
The two- and three-dimensional transverse-field Ising models with ferromagnetic exchange interactions are analyzed by means of the real-space renormalization group method. The basic strategy is a generalization of a method developed for the…
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…
Nontrivial fixed points of the hierarchical renormalization group are computed by numerically solving a system of quadratic equations for the coupling constants. This approach avoids a fine tuning of relevant parameters. We study the…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
The density matrix renormalization group (DMRG) has been extended to study quantum phase transitions on random graphs of fixed connectivity. As a relevant example, we have analysed the random Ising model in a transverse field. If the…
We analyze a semi-infinite one-dimensional random walk process with a biased motion that is incremental in one direction and long-range in the other. On a network with a fixed hierarchy of long-range jumps, we find with exact…