Cover Image

Spectral convergence of random regular graphs: Chebyshev polynomials, non-backtracking walks, and unitary-color extensions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gong, Yulin, Li, Wenbo, Liu, Shiping
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Probability Spectral Theory 05C31, 05C50, 05C80, 60B20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Shotgun assembly of random regular graphs
by: Huang, Brice, et al.
Published: (2015)

The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Are sparse graphs typically determined by their spectrum?
by: Van de Berg, Nils, et al.
Published: (2026)

Sparse graphs and their Benjamini-Schramm limits: a spectral tour
by: Bordenave, Charles
Published: (2025)

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

Semilocalization for inhomogeneous random graphs
by: Buc-d'Alché, Thomas, et al.
Published: (2026)

Spectral properties of the stochastic block model and their application to hitting times of random walks
by: Löwe, Matthias, et al.
Published: (2024)

Mixing time of the random walk on the giant component of the random geometric graph
by: Haaland, Magnus H., et al.
Published: (2025)

Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)

Gaussian fluctuations of generalized $U$-statistics and subgraph counting in the binomial random-connection model
by: Liu, Qingwei, et al.
Published: (2025)

Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Condensation in subcritical Cauchy Bienaymé trees
by: Kortchemski, Igor, et al.
Published: (2025)

Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Local limit of the random degree constrained process
by: Ráth, Balázs, et al.
Published: (2024)

The top eigenvalue of uniformly random trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

The non-backtracking random walk and its usage for vertex clustering
by: Bolla, Marianna
Published: (2025)

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

Optimal subgraphs in geometric scale-free random graphs
by: Michielan, Riccardo, et al.
Published: (2024)

Upper tails of subgraph counts in directed random graphs
by: Park, Jiyun
Published: (2024)

Normal approximation for exponential random graphs
by: Fang, Xiao, et al.
Published: (2024)

Hitting Time Distributions of Random Walks on Finite Graphs
by: Kumar, Anuraag
Published: (2025)

Tripodal structure in undersaturated random graphs
by: DiCarlo, William, et al.
Published: (2025)

Asymptotics for cliques in scale-free random graphs
by: Daly, Fraser, et al.
Published: (2020)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

On the jump of the cover time in random geometric graphs
by: Martinez, Carlos, et al.
Published: (2025)

Mixing trichotomy for random walks on directed stochastic block models
by: Bianchi, Alessandra, et al.
Published: (2025)

Mixing cutoff for simple random walks on the Chung-Lu digraph
by: Bianchi, Alessandra, et al.
Published: (2024)

Conditional central limit theorems for exponential random graphs
by: Fang, Xiao, et al.
Published: (2025)

Normal approximation for number of edges in random intersection graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)

Small maximal clusters are very unlikely in critical random graphs
by: De Ambroggio, Umberto
Published: (2024)

Semicircle laws with combined variance for non-uniform Erdős-Rényi hypergraphs
by: Avena, Luca, et al.
Published: (2026)

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)

Almost all graphs have no cospectral mate with fixed level
by: Wang, Wei, et al.
Published: (2025)

Animal social networks as intersections graphs of random walks
by: Cermelli, Paolo, et al.
Published: (2025)

The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)