Related papers: Equilibrium-preserving Laplacian renormalization g…
Low-dose computed tomography (LDCT) reconstruction faces a critical tradeoff between reconstruction quality and resource requirements. While recent deep learning methods achieve state-of-the-art performance, they typically rely on over…
In data science, hypergraphs are natural models for data exhibiting multi-way relations, whereas graphs only capture pairwise. Nonetheless, many proposed hypergraph neural networks effectively reduce hypergraphs to undirected graphs via…
The absence of intrinsic adjacency relations and orientation systems in hypergraphs creates fundamental challenges for constructing sheaf Laplacians of arbitrary degrees. We resolve these limitations through symmetric simplicial sets…
We study how far a diffusion process on a graph can deviate from a designed starting pattern when the pattern is generated via Laplacian regularisation. Under standard stability conditions for undirected, entrywise nonnegative graphs, we…
In a recent breakthrough STOC~2015 paper, a continuous diffusion process was considered on hypergraphs (which has been refined in a recent JACM 2018 paper) to define a Laplacian operator, whose spectral properties satisfy the celebrated…
In this work, we study the spectrum of the regularized normalized Laplacian for random geometric graphs (RGGs) in both the connectivity and thermodynamic regimes. We prove that the limiting eigenvalue distribution (LED) of the normalized…
There are reasons to believe that the Standard Model is only an effective theory, with new Physics lying beyond it. Supersymmetric extensions are one possibility: they address some of the Standard Model's shortcomings, such as the…
The celebrated Cheeger's Inequality establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the adjacency…
The popularity of deep learning techniques renewed the interest in neural architectures able to process complex structures that can be represented using graphs, inspired by Graph Neural Networks (GNNs). We focus our attention on the…
We study random graphs with possibly different edge probabilities in the challenging sparse regime of bounded expected degrees. Unlike in the dense case, neither the graph adjacency matrix nor its Laplacian concentrate around their…
On the lattice, a renormalization group (RG) flow for two-dimensional partition functions expressed as a tensor network can be obtained using the tensor network renormalization (TNR) algorithm [G. Evenbly, G. Vidal, Phys. Rev. Lett. 115…
A new strategy is presented for systematically treating super-leading logarithmic contributions including higher-order Glauber exchanges for non-global LHC observables in renormalization-group (RG) improved perturbation theory. This…
In this paper we present a new two-level iterative algorithm for tomographic image reconstruction. The algorithm uses a regularization technique, which we call edge-preserving Laplacian, that preserves sharp edges between objects while…
Recent spectral graph sparsification research allows constructing nearly-linear-sized subgraphs that can well preserve the spectral (structural) properties of the original graph, such as the first few eigenvalues and eigenvectors of the…
We present a hybrid lattice Hamiltonian truncation method that integrates the numerical renormalization group (NRG) with a truncated lattice integrable spectrum. The technique is tailored for generic deformations of integrable lattice…
Laplacian matrices of graphs arise in large-scale computational applications such as machine learning; spectral clustering of images, genetic data and web pages; transportation network flows; electrical resistor circuits; and elliptic…
The renormalization group (RG) approach is largely responsible for the considerable success that has been achieved in developing a quantitative theory of phase transitions. Physical properties emerge from spectral properties of the…
In this paper, we present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and…
A new symmetry-preserving loop regularization method proposed in \cite{ylw} is further investigated. It is found that its prescription can be understood by introducing a regulating distribution function to the proper-time formalism of…
The Kato-Bloch perturbation formalism is used to present a density-matrix renormalization-group (DMRG) method for strongly anisotropic two-dimensional systems. This method is used to study Heisenberg chains weakly coupled by the transverse…