Paper proves convergence of bi-stochastically normalized graph Laplacian to manifold Laplacian and robustness to outlier noise.
problem Convergence of bi-stochastically normalized graph Laplacian to manifold Laplacian and robustness to outlier noise.
method Proves convergence of bi-stochastically normalized graph Laplacian to manifold Laplacian with rates, and proposes an approximate and constrained matrix scaling problem to achieve the same consistency rate.
result Graph Laplacian consistency rate matches the rate for clean manifold data plus an additional term proportional to the boundedness of the inner-products of the noise vectors.
Paper generalizes graph Laplacian to hypergraphs for semi-supervised learning.
problem Analyzing hypergraphs with edges connecting multiple nodes.
method Proposes hypergraph p-Laplacian and semi-supervised learning method. result Hypergraph p-Laplacian outperforms standard hypergraph Laplacians. This short note aims at (re)proving that the symmetrically normalized graph Laplacian $L=\Id - D^{-1/2}WD^{-1/2}$ (from a graph defined from a Gaussian weighting kernel on a sampled smooth manifold) converges towards the continuous Manifold Laplacian when the sampling become infinitely dense. The convergence rate with …
Detects illegal stock market trading behaviors using graph ranking methods.
problem Detecting irregular trade behaviors in the stock market.
method Three graph Laplacian based semi-supervised ranking methods.
result Un-normalized and symmetric normalized graph Laplacian based methods outperform the random walk Laplacian method.
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 stochastic blockmodel graphs, the rows of the spectral embedding of the normalized La…
Study ancient solutions on graphs with unbounded Laplacians, generalizing previous results.
problem Understanding ancient solutions on graphs with unbounded Laplacians.
method Generalizing Colding and Minicozzi's theorem and Hua's result to graphs with unbounded Laplacians.
result The dimension of the space of ancient solutions of polynomial growth is bounded by the dimension of harmonic functions with the same growth.
A new method for spectral barycentre of graph datasets.
problem Creating a summary graph from a set of graphs with community structure.
method Using multiscale spectral distance based on normalized graph Laplacian eigenvalues.
result The barycentre inherits the topological structure of the graphs in the sample dataset.
Graph Laplacians adapt to different manifold dimensions, while Dirichlet energies converge to a tensorized Dirichlet energy.
problem Understanding machine learning methods for data with varying intrinsic dimensions.
method Γ-convergence of graph Dirichlet energies and spectral convergence of graph Laplacians on intersecting manifolds of varying dimensions.
result Normalized Dirichlet energy converges to a tensorized Dirichlet energy that adapts to all dimensions simultaneously.
We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more generally, we do not impose any boundedness assumption on the geometry. This is achieved …
Protein function prediction is the important problem in modern biology. In this paper, the un-normalized, symmetric normalized, and random walk graph Laplacian based semi-supervised learning methods will be applied to the integrated network combined from multiple networks to predict the functions of all yeast proteins …
Improves Graph Convolutional Network performance on citation datasets.
problem Improving Graph Convolutional Network performance on citation datasets.
method Exploring graph regularization and alternative graph convolution approaches.
result Explicit graph regularization was incorrectly rejected by Kipf & Welling (2016).
The paper proves spectral convergence rates for graph Laplacian to manifold Laplace-Beltrami operator.
problem Spectral convergence of graph Laplacian to manifold Laplace-Beltrami operator.
method Analysis of Dirichlet form convergence and construction of approximate eigenfunctions via manifold heat kernel.
result Proves spectral convergence rates for Gaussian kernelized graph Laplacian.
Study on harmonic maps between cones, linking degrees to graph Laplacian eigenvalues.
problem Understanding harmonic maps between singular spaces.
method Analyzing homogeneous harmonic maps between simplicial cones and their degrees.
result Degrees of homogeneous harmonic maps are related to eigenvalues of discrete graph Laplacians.
This paper tackles credit card fraud detection using graph-based learning methods.
problem Detecting credit card fraud to reduce financial losses.
method Graph p-Laplacian based semi-supervised learning combined with undersampling techniques.
result Graph p-Laplacian semi-supervised learning outperforms current methods.
Study shows rates for Laplacian-eigenmap methods in nonparametric regression.
problem Minimizing error in nonparametric regression using Laplacian-eigenmap.
method Adaptive and non-adaptive minimax rates using Sobolev space constraints.
result Extends minimax rates to various weighted Laplacian matrices.
Spectral clustering achieves strong consistency in the stochastic block model under certain conditions.
problem Achieving strong consistency in spectral clustering for the stochastic block model.
method Entrywise analysis of the Fielder eigenvector of graph Laplacians.
result Spectral clustering achieves exact recovery of hidden communities under matching information-theoretic limits.
New method clusters signed graphs using matrix power means.
problem Clustering signed graphs with positive and negative relations.
method Signed Power Mean Laplacian, defined as matrix power mean of normalized standard and signless Laplacians.
result Signed power mean Laplacian captures ground truth clusters under reasonable settings.
Paper establishes statistical inference for pairwise comparison models.
problem Statistical inference for pairwise comparison models when the number of subjects diverges.
method Identifies Fisher information matrix as a weighted graph Laplacian for asymptotic normality.
result Near-optimal asymptotic normality result for maximum likelihood estimator.
Graph neural networks over-smooth when layers increase, reducing discriminative power.
problem Over-smoothing in graph neural networks reduces model performance as the number of layers increases.
method Analyzed over-smoothing in general graph neural network architecture using Dirichlet energy.
result The Dirichlet energy of embeddings converges to zero, leading to loss of discriminative power.
New theory for eigenvectors of generalized Laplacian matrices, addressing dependency issues.
problem Dependency in random matrix theory hinders eigenvector analysis for latent embeddings.
method Introduces generalized Laplacian matrices and a new asymptotic theory framework.
result Established asymptotic normalities for spiked eigenvectors and eigenvalues.
Kernel smoothing on unknown manifolds with bounds and asymptotic normality.
problem Data on unknown manifolds without boundaries.
method Finite sample bounds and asymptotic normality for kernel smoothing and its derivatives.
result Established finite sample bounds and asymptotic normality for kernel smoothing.
A novel hypergraph partitioning method using tensor eigenvalue decomposition captures super-dyadic interactions.
problem Capturing super-dyadic interactions in k-uniform hypergraphs.
method Tensor-based representation and tensor eigenvalue decomposition for capturing interactions.
result Improved min-cut solution on 2-uniform hypergraphs (graphs) compared to standard spectral partitioning.
Networks or graphs can easily represent a diverse set of data sources that are characterized by interacting units or actors. Social networks, representing people who communicate with each other, are one example. Communities or clusters of highly connected actors form an essential feature in the structure of several emp…
A fast graph embedding method for large graphs.
problem Efficiently embedding large graphs for various applications.
method One-hot graph encoder embedding with linear complexity.
result Graph encoder embedding is approximately normally distributed and converges to its mean.
Study shows SNN graph Laplacians converge to k-NN graph Laplacians under large scale asymptotics.
problem Understanding the convergence of SNN graph Laplacians to k-NN graph Laplacians.
method Analyzing the asymptotic behavior of SNN and k-NN graph Laplacians.
result The graph Laplacians of SNN and k-NN graphs converge to the same limit under large scale asymptotics.
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.
Graphs approximate Laplacian spectra on manifolds.
problem Approximating Laplacian spectra on complex manifolds.
method Graph Laplacians on proximity graphs.
result Spectra of graph Laplacians approximate the Laplacian spectra of manifolds.
New algorithms for clustering and dimension reduction using relative von Neumann entropy.
problem Clustering and dimension reduction for complex data sets.
method Construct graphs from data points, select graph maximizing relative von Neumann entropy, use eigenvectors for dimension reduction.
result Outperforms existing methods on non-trivial data sets.
Survey on statistical inference methods for random dot product graphs.
problem Statistical inference on random dot product graphs.
method Spectral embeddings of adjacency and Laplacian matrices.
result Consistency and asymptotic normality of spectral embeddings.
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.
Optimal bounds for Laplacian eigenvalues on weighted graphs.
problem Finding lower bounds for Laplacian eigenvalues in weighted graphs.
method Formulating bounds in terms of graph geometry, specifically inradius of subsets.
result Optimal lower bounds for the first non-zero eigenvalue in finite volume and Dirichlet Laplacian on subsets with geometric conditions.
Novel spectral embedding considers node weights for graph analysis.
problem Graph node importance quantification.
method Normalized Laplacian eigenvectors for low-energy configurations.
result Weighted embeddings improve graph configurations.
Study on convergence of graph neural networks on random graphs.
problem Convergence of message passing graph neural networks on large random graphs.
method Extended convergence results to a broad class of aggregation functions using McDiarmid inequality.
result Non-asymptotic bounds for convergence quantified with high probability.
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 δ>0 if p≥n(1/2+δ)logn, then the normalized graph Laplacian of an Erdős--Rényi graph has all of its nonzero eigenvalues tightly concentrated around 1. We est…
Paper learns Cartesian product graphs with Laplacian constraints.
problem Learning Cartesian product graphs from Laplacian constraints.
method Penalized maximum likelihood estimation (MLE) and efficient algorithm.
result Statistical consistency for Cartesian product Laplacian estimation.
Survey of Laplacian-based methods for data dimensionality reduction and embedding.
problem Efficiently reducing high-dimensional data to lower dimensions while preserving important features and structures.
method Laplacian-based methods including spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
result Comprehensive overview of various optimization variants and applications of Laplacian-based techniques.
Most network-based protein (or gene) function prediction methods are based on the assumption that the labels of two adjacent proteins in the network are likely to be the same. However, assuming the pairwise relationship between proteins or genes is not complete, the information a group of genes that show very similar p…
The paper compares Steklov and Laplacian eigenvalues on graphs.
problem Understanding the relationship between Steklov and Laplacian eigenvalues on graphs.
method Analyzing eigenvalues and discussing rigidity.
result Obtained Lichnerowicz-type estimates and combinatorial estimates for Steklov eigenvalues.
Spectral clustering is widely used to partition graphs into distinct modules or communities. Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is closely associated with random walks on graphs. We propose a new spectral partitioning method that exploi…
Gradient estimates for unbounded graph Laplacians under Bakry-Emery curvature.
problem Gradient estimates for unbounded graph Laplacians.
method Proving gradient estimates under Bakry-Emery curvature bounds for unbounded graph Laplacians with ellipticity assumption.
result Gradient estimates and applications to completeness and finiteness of stochastically complete graphs.
Paper derives Li-Yau inequality for unbounded Laplacian on graphs.
problem Deriving Li-Yau inequality for unbounded Laplacian on graphs.
method Assumption of curvature-dimension inequality CDE′(n,K) and derivation of Li-Yau inequality. result First results on Li-Yau inequality for unbounded Laplacian on graphs.
Bayesian method predicts labels on large graphs using Laplacian eigenfunctions.
problem Binary classification on large graphs.
method Hierarchical Bayesian approach with truncated Laplacian regularization.
result Improved scalability for large graphs compared to untruncated Laplacian.
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 …
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.
Develops a new weighted Laplacian method for graph problems.
problem Graph partitioning and balanced minimum cut problems.
method Weighted Laplacian method based on graph theory and PDEs.
result Established equivalence relations among graph problems.
We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of the signed Laplacian may be meaningless, in contrast to partitioning based on th…
Study eigenvalues of conformal Laplacian under Sire-Xu normalization.
problem Existence and properties of extremal eigenvalues under a specific normalization.
method Variational analysis of eigenvalue functional under Sire-Xu normalization.
result Necessary conditions and existence results for extremal eigenvalues.
The paper studies eigenvalues and Cheeger constants on symmetric graphs.
problem Characterizing eigenvalues and Cheeger constants on symmetric graphs.
method Characterization of the first eigenfunction via sign condition, and calculation of Cheeger constants using the limit of p-Laplacian eigenvalues. result Identifies Cheeger constants of symmetric graphs and their quotients.