1,934 research outputs found
Spectral density of the non-backtracking operator
The non-backtracking operator was recently shown to provide a significant
improvement when used for spectral clustering of sparse networks. In this paper
we analyze its spectral density on large random sparse graphs using a mapping
to the correlation functions of a certain interacting quantum disordered system
on the graph. On sparse, tree-like graphs, this can be solved efficiently by
the cavity method and a belief propagation algorithm. We show that there exists
a paramagnetic phase, leading to zero spectral density, that is stable outside
a circle of radius , where is the leading eigenvalue of the
non-backtracking operator. We observe a second-order phase transition at the
edge of this circle, between a zero and a non-zero spectral density. That fact
that this phase transition is absent in the spectral density of other matrices
commonly used for spectral clustering provides a physical justification of the
performances of the non-backtracking operator in spectral clustering.Comment: 6 pages, 6 figures, submitted to EP
Spectral Clustering of Graphs with the Bethe Hessian
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 non-backtracking walk on the graph, leads to improved
performance in detecting clusters, and even to optimal performance for the
stochastic block model. Here, we propose to use instead a simpler object, a
symmetric real matrix known as the Bethe Hessian operator, or deformed
Laplacian. We show that this approach combines the performances of the
non-backtracking operator, thus detecting clusters all the way down to the
theoretical limit in the stochastic block model, with the computational,
theoretical and memory advantages of real symmetric matrices.Comment: 8 pages, 2 figure
Clustering from Sparse Pairwise Measurements
We consider the problem of grouping items into clusters based on few random
pairwise comparisons between the items. We introduce three closely related
algorithms for this task: a belief propagation algorithm approximating the
Bayes optimal solution, and two spectral algorithms based on the
non-backtracking and Bethe Hessian operators. For the case of two symmetric
clusters, we conjecture that these algorithms are asymptotically optimal in
that they detect the clusters as soon as it is information theoretically
possible to do so. We substantiate this claim for one of the spectral
approaches we introduce
Spectral redemption: clustering sparse networks
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 class of spectral algorithms based on a
non-backtracking walk on the directed edges of the graph. The spectrum of this
operator is much better-behaved than that of the adjacency matrix or other
commonly used matrices, maintaining a strong separation between the bulk
eigenvalues and the eigenvalues relevant to community structure even in the
sparse case. We show that our algorithm is optimal for graphs generated by the
stochastic block model, detecting communities all the way down to the
theoretical limit. We also show the spectrum of the non-backtracking operator
for some real-world networks, illustrating its advantages over traditional
spectral clustering.Comment: 11 pages, 6 figures. Clarified to what extent our claims are
rigorous, and to what extent they are conjectures; also added an
interpretation of the eigenvectors of the 2n-dimensional version of the
non-backtracking matri
Cutoff on Graphs and the Sarnak-Xue Density of Eigenvalues
It was recently shown by Lubetzky and Peres (2016) and by Sardari (2018) that
Ramanujan graphs, i.e., graphs with the optimal spectrum, exhibit cutoff of the
simple random walk in optimal time and have optimal almost-diameter. We prove
that this spectral condition can be replaced by a weaker condition, the
Sarnak-Xue density of eigenvalues property, to deduce similar results.
We show that a family of Schreier graphs of the
-action on the projective line satisfies the
Sarnak-Xue density condition, and hence exhibit the desired properties. To the
best of our knowledge, this is the first known example of optimal cutoff and
almost-diameter on an explicit family of graphs that are neither random nor
Ramanujan
- …