Cover Image

The non-backtracking random walk and its usage for vertex clustering

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Bolla, Marianna
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Statistics Theory 05C50, 05C80, 62H30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Structure and Noise in Dense and Sparse Random Graphs: Percolated Stochastic Block Model via the EM Algorithm and Belief Propagation with Non-Backtracking Spectra
by: Bolla, Marianna, et al.
Published: (2023)

KRAFTY: Khatri-Rao Framework for Joint Cluster Recovery
by: Gao, Siyi, et al.
Published: (2026)

Spectral convergence of random regular graphs: Chebyshev polynomials, non-backtracking walks, and unitary-color extensions
by: Gong, Yulin, et al.
Published: (2024)

On defining Kemeny's constant for non-backtracking random walks
by: Breen, Jane, et al.
Published: (2025)

Dependencies in Multiplex Networks: A Motif Count Approach
by: Sawaya, Karl, et al.
Published: (2026)

Consistent line clustering using geometric hypergraphs
by: Alaluusua, Kalle, et al.
Published: (2025)

Finite-sample confidence regions for spectral clustering and graph centrality
by: Gokavarapu, Chandrasekhar, et al.
Published: (2026)

Discrete trace formulas and holomorphic functional calculus for the adjacency matrix of regular graphs
by: Gong, Yulin, et al.
Published: (2024)

Dense and nondense limits for uniform random intersection graphs
by: Bassino, Frédérique, et al.
Published: (2024)

The limit theorem with respect to the matrices on non-backtracking paths of a graph
by: Hasegawa, Takehiro, et al.
Published: (2020)

Subgraphs in random graphs with specified degrees and forbidden edges
by: Larkin, John, et al.
Published: (2025)

Pair-Matching: Links Prediction with Adaptive Queries
by: Giraud, Christophe, et al.
Published: (2019)

SDSR: A Spectral Divide-and-Conquer Approach for Species Tree Reconstruction
by: Reshef, Ortal, et al.
Published: (2026)

Star-collision in random hypergraphs
by: Adhikari, Kartick, et al.
Published: (2026)

Motif Estimation via Subgraph Sampling: The Fourth Moment Phenomenon
by: Bhattacharya, Bhaswar B., et al.
Published: (2020)

Rank-based linkage I: triplet comparisons and oriented simplicial complexes
by: Darling, R. W. R., et al.
Published: (2023)

Stein's method of moment estimators for local dependency exponential random graph models
by: Fischer, Adrian, et al.
Published: (2025)

Graph sequences sampled from Robinson graphons
by: Ghandehari, Mahya, et al.
Published: (2020)

Almost all graphs have no cospectral mates with height relative small to its order
by: Zhao, Da
Published: (2026)

The distance to the border of a random tree
by: Maciá, Víctor J.
Published: (2022)

Quiver Laplacians and Feature Selection
by: Sumray, Otto, et al.
Published: (2024)

New Lower Bounds for C4-Free Subgraphs of the Hypercubes Q6, Q7, and Q8: Constructions, Structure, and Computational Method
by: Minamoto, Minamo
Published: (2026)

Defective eigenvalues of the non-backtracking matrix
by: Heysse, Kristin, et al.
Published: (2024)

Semi-supervised Community Detection using Glauber Dynamics for an Ising Model
by: Avrachenkov, Konstantin, et al.
Published: (2025)

A note on plane trees with decreasing labels
by: Cheung, Tsun-Ming, et al.
Published: (2025)

Combinatorial Identities Using the Matrix Tree Theorem
by: Deepthi, Nayana Shibu, et al.
Published: (2025)

A tail bound for cumulant series for complex functions of independent random variables
by: Isaev, Mikhail
Published: (2025)

Arithmetical Structures on Coconut Trees
by: Diaz-Lopez, Alexander, et al.
Published: (2024)

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026)

Matrix Concentration for Random Signed Graphs and Community Recovery in the Signed Stochastic Block Model
by: Robertson, Sawyer Jack
Published: (2024)

On empirical Hodge Laplacians under the manifold hypothesis
by: Lerch, Jan-Paul, et al.
Published: (2025)

Maximization of the first Laplace eigenvalue of a finite graph
by: Gomyou, T., et al.
Published: (2022)

Maximization of the first Laplace eigenvalue of a finite graph II
by: Gomyou, Takumi, et al.
Published: (2024)

Pseudo-Euclidean representations of switching classes of Johnson and Hamming graphs with minimal dimension
by: Nozaki, Hiroshi, et al.
Published: (2025)

Monodromy representation of graphs
by: Yuan, Kai, et al.
Published: (2025)

Network Cross-Validation for Nested Models by Edge-Sampling
by: Yang, Bokai, et al.
Published: (2025)

On the number of small edge-weighted subgraphs
by: Yu, Feng, et al.
Published: (2025)

Exploring structural properties of $k$-trees and block graphs
by: Markenzon, Lilian, et al.
Published: (2023)

Pseudo-orientable ribbon graphs: Matrix--Quasi-tree Theorem and log-concavity
by: Ding, Changxin, et al.
Published: (2026)

On the Maximum Number of Spanning Trees in $C_4$-Free Graphs
by: London, András
Published: (2026)