Spectral method detects communities in sparse hypergraphs, achieving detection threshold.
problem Community detection in sparse hypergraphs.
method Non-backtracking operator and spectral approach.
result Spectral method achieves detection threshold for sparse HSBMs.
Spectral clustering is a standard approach to label nodes on a graph by studying the (largest or lowest) eigenvalues of a symmetric real matrix such as e.g. the adjacency or the Laplacian. Recently, it has been argued that using instead a more complicated, non-symmetric and higher dimensional operator, related to the n…
New matrix reveals cluster info in sparse directed graphs.
problem Analyzing cluster information in directed graphs.
method Proposed complex non-backtracking matrix integrating Hermitian adjacency matrix and non-backtracking matrix properties.
result The complex non-backtracking matrix holds cluster information, especially for sparse directed graphs.
Spectral algorithms are classic approaches to clustering and community detection in networks. However, for sparse networks the standard versions of these algorithms are suboptimal, in some cases completely failing to detect communities even when other algorithms such as belief propagation can do so. Here we introduce a…
New method detects communities in complex hypergraphs, matching theoretical limits.
problem Detecting communities in non-uniform hypergraphs with varying hyperedge sizes.
method Developed a spectral theory for weighted non-backtracking operators on non-uniform hypergraphs.
result Achieved the Kesten-Stigum bound for weak recovery in a general class of non-uniform HSBMs.
A new graph neural network (NBA-GNN) avoids revisiting nodes to improve accuracy.
problem Redundancy in graph neural network updates causes over-squashing and inaccurate recognition.
method Proposes non-backtracking graph neural networks (NBA-GNN) that update messages without revisiting nodes.
result The NBA-GNN alleviates over-squashing and improves performance on graph benchmarks.
New findings support a new community recovery threshold for Stochastic Block Model with many communities.
problem Recovering communities in Stochastic Block Model with more than sqrt(n) communities.
method Counting specific motifs to achieve polynomial-time community recovery above a new threshold.
result LDP fails below the new threshold, but polynomial-time recovery is possible above it.
This paper presents VEC-NBT, a variation on the unsupervised graph clustering technique VEC, which improves upon the performance of the original algorithm significantly for sparse graphs. VEC employs a novel application of the state-of-the-art word2vec model to embed a graph in Euclidean space via random walks on the n…
We consider the problem of clustering partially labeled data from a minimal number of randomly chosen pairwise comparisons between the items. We introduce an efficient local algorithm based on a power iteration of the non-backtracking operator and study its performance on a simple model. For the case of two clusters, w…
Community detection is a fundamental problem in network analysis with many methods available to estimate communities. Most of these methods assume that the number of communities is known, which is often not the case in practice. We study a simple and very fast method for estimating the number of communities based on th…
Unified spectral clustering for sparse networks with heterogeneous degrees.
problem Efficiently detecting communities in sparse networks with varying degrees.
method Developed a parametrized regularized Laplacian matrix for spectral clustering.
result Improved parametrization accounts for network heterogeneity and community hardness.
Motivated by community detection, we characterise the spectrum of the non-backtracking matrix B in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random graph on n vertices partitioned into two equal-sized clusters. The vertices have i.i.d. weights {φu}u=1n with second moment $Φ…
A distinguishing property of communities in networks is that cycles are more prevalent within communities than across communities. Thus, the detection of these communities may be aided through the incorporation of measures of the local "richness" of the cyclic structure. In this paper, we introduce renewal non-backtrac…
There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the non-backtracking matrix. However they are far from being tight when the network is sparse and displays clustering or transitivity, which is repr…
HollowFlow speeds up likelihood evaluation for large-scale models.
problem Prohibitive scaling of sample likelihood computations in flow-based models.
method Introduces HollowFlow, a flow-based generative model using a NoBGNN with a block-diagonal Jacobian structure.
result Achieves up to O(n^2) speed-up in likelihood evaluation for large systems.
New Bethe-Hessian method improves community detection in sparse networks.
problem Detect communities in sparse networks efficiently.
method Spectral clustering using the Bethe-Hessian matrix.
result Bethe-Hessian consistently estimates block number above Kesten-Stigum threshold.
Traditionally, community detection in graphs can be solved using spectral methods or posterior inference under probabilistic graphical models. Focusing on random graph families such as the stochastic block model, recent research has unified both approaches and identified both statistical and computational detection thr…
This paper investigates the behavior of the Min-Sum message passing scheme to solve systems of linear equations in the Laplacian matrices of graphs and to compute electric flows. Voltage and flow problems involve the minimization of quadratic functions and are fundamental primitives that arise in several domains. Algor…
New formula refutes random CSPs with fewer constraints.
problem Refuting random constraint satisfaction problems efficiently.
method Introduced a non-backtracking matrix and proved an Ihara-Bass formula.
result Efficiently refutes random CSPs with fewer constraints.
New findings on community recovery in SBM with many communities.
problem Determining community recovery conditions in SBM with more than sqrt(n) communities.
method Constructing motifs and counting them to prove community recovery above the proposed threshold.
result Proving community recovery above the proposed threshold in SBM with K >= sqrt(n) communities.
We say that a subset S⊆FN is \emph{spectrally rigid} if whenever T1,T2∈cvN are points of the (unprojectivized) Outer space such that ∣∣g∣∣T1=∣∣g∣∣T2 for every g∈S then T1=T2 in $\cvn$. It is well-known that FN itself is spectrally rigid; it also follows from the result of Smil…
The paper proves geometric and spectral alignment for deep neural networks.
problem Understanding the singular spectra of deep neural network layers.
method Proves deterministic quotient-geometric estimates for singular spectra of Frobenius-normalized layer factors.
result Exact power-law spectra form a trace-normalized Cartan orbit under Frobenius normalization.
Spectral methods are popular in detecting global structures in the given data that can be represented as a matrix. However when the data matrix is sparse or noisy, classic spectral methods usually fail to work, due to localization of eigenvectors (or singular vectors) induced by the sparsity or noise. In this work, we …
Graph energy helps detect communities in networks better than traditional methods.
problem Detecting communities in sparse networks where traditional methods fail.
method Using graph energy based on the full spectrum of adjacency matrices.
result The difference in graph energy between a planted partition model and an Erdős--Rényi network has a distinct transition at the detectability threshold.
Several probabilistic models from high-dimensional statistics and machine learning reveal an intriguing --and yet poorly understood-- dichotomy. Either simple local algorithms succeed in estimating the object of interest, or even sophisticated semi-definite programming (SDP) relaxations fail. In order to explore this p…
The paper describes the K-theory of C∗-algebras of locally finite graphs.
problem Computing the K-theory of C∗-algebras of locally finite graphs. method Using a directed graph representation and Cuntz-Krieger algebra, the paper computes the K-theory of C∗(Γ). result The K-theory of C∗(Γ) is determined by the graph's genus, number of ends, and dead-ends. AI methods often fail to outperform classical CPU-based solvers on Maximum Independent Set problems.
problem Comparing AI methods with classical CPU-based solvers on Maximum Independent Set problems.
method Comparison of AI methods (e.g., generative models, reinforcement learning) with classical CPU-based solvers (e.g., KaMIS) on Maximum Independent Set problem.
result AI-inspired methods are often outperformed by classical CPU-based solvers, even with post-processing techniques.
Community detection is considered for a stochastic block model graph of n vertices, with K vertices in the planted community, edge probability p for pairs of vertices both in the community, and edge probability q for other pairs of vertices. The main focus of the paper is on weak recovery of the community based on the …
This paper analyzes DeepWalk and node2vec for community detection in large networks.
problem Community detection in large, sparse networks.
method Low-dimensional network embedding algorithms (DeepWalk and node2vec) applied to random walk segments.
result The performance of DeepWalk and node2vec in recovering communities depends on the length of random walk segments and sparsity of the network.
In \cite{KSS06} it was shown that with respect to the simple non-backtracking random walk on the free group FN=F(a1,…,aN) the Whitehead algorithm has strongly linear time generic-case complexity and that "generic" elements of FN are "strictly minimal" in their Out(FN)-orbits. Here we generalize these res…
This paper completes the construction of arbitrary order conformally invariant differential operators in higher spin spaces. Jan Slovák has classified all conformally invariant differential operators on locally conformally flat manifolds. We complete his results in higher spin theory by giving explicit expressions for …
The paper connects eigenvalue problems for various operators and establishes inequalities and asymptotic formulas for heat traces.
problem Eigenvalue problems and heat trace asymptotics for different operators.
method Establishes connections and inequalities for eigenvalues and heat traces.
result Eigenvalue inequalities and three-term asymptotic formulas for heat traces of various operators.
Introduces a new elliptic operator with positive eigenvalue.
problem None explicitly stated in the abstract.
method Introduces a new elliptic operator called the two-radical Laplace operator.
result The eigenvalue of the new operator is the positive square root of the Laplace operator's eigenvalue.
Proves Kato inequalities for various conformal operators.
problem Proving inequalities for differential operators.
method Analyzes a class of first order differential operators, including Dirac and Penrose twistor operators.
result Derives Kato inequalities that interpolate between classical and refined versions.
We describe a set of conformally covariant boundary operators associated to the Paneitz operator, in the sense that they give rise to a conformally covariant energy functional for the Paneitz operator on a compact Riemannian manifold with boundary. These operators naturally give rise to a first- and third-order conform…
Study on biharmonic hypersurfaces with specific recurrent operators in Euclidean space.
problem Characterizing biharmonic hypersurfaces with recurrent operators.
method Analysis of various recurrent operators and their impact on biharmonic hypersurfaces.
result Some well-known recurrent operators play a significant role in making biharmonic hypersurfaces minimal.
Local index theorem for chiral geometric operators proved using heat kernel.
problem Proving a local index theorem for geometric first-order differential operators.
method Using Gilkey's invariance theory and heat kernel techniques.
result Supertrace of heat kernel converges to Chern-Weil form.
Study estimates eigenvalues for concave Hessian operators on convex domains.
problem Estimating eigenvalues for concave elliptic Hessian operators.
method Investigates Dirichlet eigenvalue problem for a broad class of concave elliptic Hessian operators.
result Existence and properties of the first nonzero eigenvalue and eigenfunction.
The paper proves homotopy equivalences for spaces of unbounded Fredholm operators.
problem Spaces of unbounded Fredholm operators and their properties.
method Analyzing the spaces and proving homotopy equivalences.
result Natural maps between four spaces of unbounded Fredholm operators are homotopy equivalences.
GJMS operators connect geometry, analysis, and physics.
problem None explicitly stated; focus on operators and their impact.
method Construction of conformally invariant differential operators.
result GJMS operators have significant impact in geometry, analysis, and physics.
Extends Calabi operator to Riemannian locally symmetric spaces.
problem Local integrability conditions on Riemannian locally symmetric spaces.
method Generalizes Calabi operator to Riemannian locally symmetric spaces.
result Generalised operator works in irreducible case and fails in products.
New spectral torsion defined for rescaled Dirac operators.
problem Defining spectral torsion for rescaled Dirac operators.
method Using three vector fields and noncommutative residue.
result Computed spectral torsion for one form rescaled Dirac operators.
Proves formal self-adjointness of certain differential operators.
problem Verifying conjectures about differential operators.
method Proving formal self-adjointness through mathematical proof.
result Proves two conjectures about differential operators.
Researchers create new operators from Riemannian invariants.
problem Developing new mathematical tools for Riemannian geometry.
method Introducing formally self-adjoint conformally covariant polydifferential operators.
result Found a fourth-order, conformally covariant tridifferential operator.
The paper proves new theorems about specific types of operator perturbations.
problem Analyzing conformal perturbations of Dirac and signature operators.
method Developed Kastler-Kalau-Walze type theorems for specific operator types.
result Established new theorems for six-dimensional manifolds with boundary.
Study of Dirac-like operators on spin manifolds with large mass parameters.
problem Understanding spectra of Dirac-like operators with piecewise constant mass terms.
method Analysis of asymptotic regimes to derive effective operators.
result Extension of MIT Bag operator concept to spin geometry.
Study essential spectrum of differential operators on geometrically finite orbifolds.
problem Analyzing the essential spectrum of differential operators over specific geometric structures.
method Investigates first order and Laplace type elliptic differential operators on Riemannian vector bundles over geometrically finite orbifolds.
result Discovers properties of essential spectra for these operators.
The study proves inequalities for complex operators on curved spaces.
problem Establishing inequalities for nonlocal operators on curved spaces.
method Defining and analyzing nonlocal Pucci operators on manifolds with nonnegative sectional curvatures, proving Harnack inequalities and Holder estimates.
result Harnack inequalities and Holder estimates for nonlocal operators on manifolds with nonnegative sectional curvatures.