Related papers: Equilibrium-preserving Laplacian renormalization g…
Expanding and improving the repertoire of numerical methods for studying quantum lattice models is an ongoing focus in many-body physics. While the density matrix renormalization group (DMRG) has been established as a practically useful…
How might one "reduce" a graph? That is, generate a smaller graph that preserves the global structure at the expense of discarding local details? There has been extensive work on both graph sparsification (removing edges) and graph…
Spectral graph signal processing is traditionally built on self-adjoint Laplacians, where orthogonal eigenbases yield an energy-preserving Fourier transform and a variational frequency ordering via a real Dirichlet form. Directed networks…
Based on the original idea of the density matrix renormalization group (DMRG), i.e. to include the missing boundary conditions between adjacent blocks of the blocked quantum system, we present a rigorous and nonperturbative mathematical…
Graph-based techniques and spectral graph theory have enriched the field of machine learning with a variety of critical advances. A central object in the analysis is the graph Laplacian L, which encodes the structure of the graph. We…
Graph diffusion models achieve state-of-the-art performance in graph generation but suffer from quadratic complexity in the number of nodes -- and much of their capacity is wasted modeling the absence of edges in sparse graphs. Inspired by…
Network renormalization has traditionally relied on spatial adjacency-grouping nearby nodes together, but this approach fails to capture the dynamical correlations that govern system-wide behavior in scale-free networks. We present a…
In this work, we address the solution of both linear and nonlinear ill-posed inverse problems by developing a novel graph-based regularization framework, where the regularization term is formulated through an iteratively updated graph…
Low-altitude Gaussian splatting (LAGS) facilitates 3D scene reconstruction by aggregating aerial images from distributed drones. However, as LAGS prioritizes maximizing reconstruction quality over communication throughput, existing…
We develop a renormalization group (RG) procedure that includes important system-specific features. The key ingredient is to systematize the coarse graining procedure that generates the RG flow. The coarse graining technology comes from…
Real-world networks exhibit universal structural properties such as sparsity, small-worldness, heterogeneous degree distributions, high clustering, and community structures. Geometric network models, particularly Random Hyperbolic Graphs…
Self-similarity, where observables at different length scales exhibit similar behavior, is ubiquitous in natural systems. Such systems are typically characterized by power-law correlations and universality, and are studied using the…
Coarse graining techniques offer a promising alternative to large-scale simulations of complex dynamical systems, as long as the coarse-grained system is truly representative of the initial one. Here, we investigate how the dynamical…
Graph generation is a critical task across scientific domains. Existing methods fall broadly into two categories: autoregressive models, which iteratively expand graphs, and one-shot models, such as diffusion, which generate the full graph…
We explore how minimal neural networks can invert the renormalization group (RG) coarse-graining procedure in the two-dimensional Ising model, effectively ``dreaming up'' microscopic configurations from coarse-grained states. This task -…
The common graph Laplacian regularizer is well-established in semi-supervised learning and spectral dimensionality reduction. However, as a first-order regularizer, it can lead to degenerate functions in high-dimensional manifolds. The…
Recently a novel real-space RG algorithm was introduced, identifying the relevant degrees of freedom of a system by maximizing an information-theoretic quantity, the real-space mutual information (RSMI), with machine learning methods.…
Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…
Graph neural networks (GNNs) achieve strong performance on graph learning tasks, but training on large-scale networks remains computationally challenging. Transferability results show that GNNs with fixed weights can generalize from smaller…
We introduce a Lagrangian formulation of the Density Matrix Renormalization Group (DMRG). We present Lagrangians which when minimised yield the optimal DMRG wavefunction in a variational sense, both within the general matrix product ansatz,…