The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and explicitly allow infinite graphs. Motivated by the general form of a Laplacian on …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “spectral graph theory”
Root Laplacian Eigenmaps help in spectral embedding of graphs.
problem Efficient spectral embedding of graphs.
method Square root of graph-Laplacian operator.
result Improved spectral embedding techniques.
Graph convolutional networks (GCNs) are powerful tools for graph-structured data. However, they have been recently shown to be vulnerable to topological attacks. To enhance adversarial robustness, we go beyond spectral graph theory to robust graph theory. By challenging the classical graph Laplacian, we propose a new c…
Developed a framework for designing filters in spectral GCNNs with improved performance.
problem Designing effective filters for spectral GCNNs with regularization properties.
method Exploring regularization properties of graph Laplacian and proposing a generalized framework for filter design.
result New filters derived from the framework outperform state-of-the-art techniques in semi-supervised node classification.
The goal of this paper is to show that there exists a simple, yet universal statistical logic of spectral graph analysis by recasting it into a nonparametric function estimation problem. The prescribed viewpoint appears to be good enough to accommodate most of the existing spectral graph techniques as a consequence of …
Optimizing quantum graphs yields geodesic nets on surfaces.
problem Finding optimal quantum graphs for geodesic nets.
method Optimizing functionals from spectral theory to find geodesic nets.
result Critical metrics for eigenvalues give rise to geodesic nets.
The paper defines surface area for graphs and derives spectral estimates.
problem Understanding connectivity measures and spectral properties of graphs.
method Introducing surface area concepts related to inverse degree and deriving spectral bounds.
result An upper bound on the second eigenvalue for planar graphs.
Spectral Method is a commonly used scheme to cluster data points lying close to Union of Subspaces by first constructing a Random Geometry Graph, called Subspace Clustering. This paper establishes a theory to analyze this method. Based on this theory, we demonstrate the efficiency of Subspace Clustering in fairly broad…
Novel Haar-Laplacian for directed graphs enhances spectral graph applications.
problem Lack of suitable Laplacian for directed graphs in spectral graph theory.
method Inspired by Haar-like transformation, introduces a Hermitian matrix preserving direction and weight.
result HaarNet outperforms in weight prediction and denoising on directed graphs.
Unified framework for analyzing graph neural operators converging to graph limits.
problem Analyzing convergence of graph neural operators to graph limits.
method Develops a unified spectral framework for graph neural operators under various graphon assumptions.
result Unified framework enables direct comparison of convergence rates and tradeoffs.
Method reconstructs missing wind farm data using graph theory and nearest neighbors.
problem Missing data in wind farm records due to sensor failures.
method Combines spectral graph theory and k-Nearest Neighbors to estimate missing data.
result Significant improvement in data reconstruction over existing methods.
Deep learning's success has been widely recognized in a variety of machine learning tasks, including image classification, audio recognition, and natural language processing. As an extension of deep learning beyond these domains, graph neural networks (GNNs) are designed to handle the non-Euclidean graph-structure whic…
The paper improves GNN generalization theory by considering graph manifolds.
problem Improper GNN generalization bounds ignoring graph structures.
method Taking a manifold perspective, the paper establishes GNN generalization theory.
result GNN generalization bounds decrease linearly with graph size and spectral continuity.
New model learns graph spectra accurately, outperforming existing methods.
problem Graph diffusion models struggle to distinguish certain graph families and their spectra.
method Leveraged random matrix theory to analytically extract spectral properties, introducing Dyson Diffusion Model.
result Dyson Diffusion Model learns graph spectra accurately and outperforms existing models.
Fiedler regularization uses spectral graph theory to improve neural network performance.
problem Improving neural network performance by penalizing weights based on connectivity.
method Uses the Fiedler value of the neural network's graph as a regularization tool, providing theoretical and computational methods.
result Demonstrates Fiedler regularization's effectiveness in improving neural network performance.
This paper refines understanding of decentralized learning by considering graph topology.
problem Current theory fails to predict performance in decentralized learning settings.
method Quantifies how graph topology influences convergence in decentralized learning.
result Graph topology significantly impacts convergence in decentralized learning, contrary to spectral gap theory.
A novel 3D shape registration method using spectral graph embedding and probabilistic matching.
problem Challenges in 3D shape analysis and registration, especially with large variability.
method Combining spectral graph matching with Laplacian embedding for large graphs, using commute-time embedding and PCA.
result A method to register shapes with different samplings and isometric deformations.
This paper analyzes various graph clustering methods and their applications.
problem Dividing graphs into homogeneous groups for diverse applications.
method Traditional and deep learning-based clustering methods are compared.
result Deep learning techniques improve clustering accuracy.
Developed a new homology theory for graph chromatic polynomials.
problem Categorification of chromatic polynomials.
method Introduced a new homology theory and developed a spectral sequence.
result Spectral sequence converges to , supporting .
Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about performance guarantees for spectral clustering. This issue is partly due to the…
Proposes a probabilistic framework for stationary topological signals on simplicial complexes.
problem Complex data structures require new models and tools.
method Generalizes stationarity to topological signals on simplicial complexes.
result Defines topological power spectral density (PSD) for stationary signals.
New method clusters evolving networks using spatio-temporal graph Laplacian.
problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.
Spectral sparsification improves Laplacian-constrained graph learning.
problem Improving accuracy of Laplacian-constrained graph learning.
method Spectral graph sparsification as a post-estimation operation.
result Improved accuracy of Laplacian-constrained graph learning.
The paper introduces a quantum state system to count perfect matchings in graphs.
problem Counting perfect matchings in graphs using quantum state systems.
method Topological quantum field theory (TQFT) and spectral sequences.
result The filtered -color vertex homology for is generated by perfect matchings.
Simplicial complexes are increasingly used to study complex system structure and dynamics including diffusion, synchronization and epidemic spreading. The spectral dimension of the graph Laplacian is known to determine the diffusion properties at long time scales. Using the renormalization group here we calculate the s…
Autoencoding Random Forestsstat.ML
Proposes autoencoding with random forests using spectral graph theory.
problem Learning low-dimensional embeddings of random forest models.
method Combines nonparametric statistics and spectral graph theory for optimization.
result Establishes a universal consistent decoder for random forest models.
We study the spectral gap of the Erdős--Rényi random graph through the connectivity threshold. In particular, we show that for any fixed if then the normalized graph Laplacian of an Erdős--Rényi graph has all of its nonzero eigenvalues tightly concentrated around . We est…
New centrality-based graph shift operators improve graph neural networks.
problem Improving graph neural networks by enhancing graph shift operators.
method Proposed Centrality Graph Shift Operators (CGSOs) using global centrality metrics.
result CGSOs lead to improved performance in graph neural networks on real-world datasets.
Paper explores embedding methods for detecting pseudo-cliques in random graphs, showing limitations and potential.
problem Detecting planted pseudo-cliques in random dot product graphs.
method Adjacency Spectral Embedding (ASE) and Graph Encoder Embedding (GEE).
result These methods can localize pseudo-cliques with additional clean network data, but not without it.
Generalized Dirichlet Energy and Graph Laplacians for Clustering Directed and Undirected Graphsstat.ML
New method clusters directed and undirected graphs without losing directional information.
problem Clustering directed graphs due to asymmetry in edge connectivity.
method Generalized Dirichlet Energy (GDE) and generalized spectral clustering (GSC).
result GSC outperforms existing methods in clustering accuracy and robustness.
Generative model controls heterophily in graph signals.
problem Controlling heterophily in graph signals for better model effectiveness.
method Combines graphon-based generator with spectral filtering of Gaussian node features.
result Establishes theoretical guarantees for heterophily control and convergence.
When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different edge-weight representations, under a generic low rank model. We measure the quality of dif…
Graph learning from data represents a canonical problem that has received substantial attention in the literature. However, insufficient work has been done in incorporating prior structural knowledge onto the learning of underlying graphical models from data. Learning a graph with a specific structure is essential for …
In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or words' embedding, represented by graphs. We present a formulation o…
Paper shows graphs can be embedded in lower dimensions than expected.
problem Choosing the right embedding dimension for graph analysis.
method Utilizes hidden manifold structure to predict lower-dimensional embedding.
result Graphs can be embedded in much lower dimensions than previously thought.
We study the problem of determining the optimal low dimensional projection for maximising the separability of a binary partition of an unlabelled dataset, as measured by spectral graph theory. This is achieved by finding projections which minimise the second eigenvalue of the graph Laplacian of the projected data, whic…
We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to perform optimally both theoretically using asymptotic theory and empirically.
Coherent structure coloring: identification of coherent structures from sparse data using graph theoryphysics.flu-dyn
We present a frame-invariant method for detecting coherent structures from Lagrangian flow trajectories that can be sparse in number, as is the case in many fluid mechanics applications of practical interest. The method, based on principles used in graph coloring and spectral graph drawing algorithms, examines a measur…
New method for faster graph parameter inference from large random Kronecker graphs.
problem Efficiently infer graph parameters from large random Kronecker graphs.
method Decompose adjacency matrix into signal and noise components, then use denoising and solving approach.
result Proposed method achieves comparable or better performance than existing methods at lower computational cost.
The study explores discrete versions of Riemannian geometry structures on manifolds.
problem Understanding the relationship between discrete structures and continuous Riemannian geometry.
method Surveying and analyzing discrete counterparts of Riemannian geometry concepts on graphs and simplicial complexes.
result Recent developments include Cheeger type inequalities for higher-dimensional simplicial complexes and Floer type constructions.
Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper present…
Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised learning algorithms. When suitably scaled, graph Laplacians approach limiting cont…
Inference for the stochastic blockmodel is currently of burgeoning interest in the statistical community, as well as in various application domains as diverse as social networks, citation networks, brain connectivity networks (connectomics), etc. Recent theoretical developments have shown that spectral embedding of gra…
Spectral clustering identifies clusters of multivariate extremes.
problem Analyzing the dependence structure of multivariate extremes.
method Spectral clustering based on a random -nearest neighbor graph.
result Spectral clustering can consistently identify clusters of multivariate extremes under certain conditions.
InfiniteWalk connects deep network embeddings to spectral graph theory with a nonlinear transformation.
problem Learning node representations from networks with deep learning methods.
method Study of the DeepWalk objective in the limit as window size goes to infinity, linking to spectral graph embeddings with a nonlinear transformation.
result Simple binary thresholding of the Laplacian pseudoinverse can approximate DeepWalk embeddings.
This paper uses the relationship between graph conductance and spectral clustering to study (i) the failures of spectral clustering and (ii) the benefits of regularization. The explanation is simple. Sparse and stochastic graphs create a lot of small trees that are connected to the core of the graph by only one edge. G…
Introduces Spectral Graph Network combining spatial and spectral message passing.
problem Relational reasoning in graph structured data.
method Applies message passing to both spatial and spectral domains of a graph.
result Promotes efficient training with fewer iterations and robustness to edge dropout.
Enhanced spectral clustering for geometric graphs improves clustering accuracy.
problem Ineffective standard spectral clustering for geometric graphs.
method Higher-order spectral clustering using higher-order eigenvectors.
result Established weak and strong consistency for Soft Geometric Block Model.