Spectra of large random trees

DOI10.1007/s10959-011-0360-9zbMath1255.05114arXiv0903.3589OpenAlexW2055033386MaRDI QIDQ715739

Arnab Sen, Shankar Bhamidi, Steven N. Evans

Publication date: 1 November 2012

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.3589

zbMATH Keywords

eigenvalueadjacency matrixbranching processrandom matrixrandom graphmaximal matchingisospectralinterlacinglocal weak convergencepreferential attachmentYule treegraph Laplacianexchange propertyKarp-Sipser algorithmprobability fringe convergencerecursive random tree

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (8)

Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ Mean quantum percolation ⋮ Community modulated recursive trees and population dependent branching processes ⋮ On the distribution of eigenvalues of increasing trees ⋮ Change point detection in network models: preferential attachment and long range dependence ⋮ Sparse regular random graphs: spectral density and eigenvectors ⋮ Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs ⋮ Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Harmonic analysis of finite lamplighter random walks
• Convergence rate of expected spectral distributions of large random matrices. I: Wigner matrices
• The continuum random tree. I
• Asymptotic fringe distributions for general families of random trees
• Spectral computations on lamplighter groups and Diestel-Leader graphs
• The spectra of some trees and bounds for the largest eigenvalue of any tree
• On the spectra of certain rooted trees
• On the spectra of some weighted rooted trees and applications
• The spectra of a graph obtained from copies of a generalized Bethe tree
• Spectra of weighted generalized Bethe trees joined at the root
• On the spectrum of lamplighter groups and percolation clusters
• General branching processes as Markov fields
• Recent results in the theory of graph spectra
• Eigenvalue interlacing and weight parameters of graphs
• Eigenvalues of random power law graphs
• Graphs and Hermitian matrices: eigenvalue interlacing
• Interlacing eigenvalues and graphs
• An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
• The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
• Resolvent of large random graphs
• Almost all trees share a complete set of immanantal polynomials
• The growth and composition of branching populations
• Markov Chains
• On the kernel of tree incidence matrices
• Robustness and Vulnerability of Scale-Free Random Graphs
• The Maximum Degree of the Barabási–Albert Random Tree
• The stable doubly infinite pedigree process of supercritical branching populations
• Random trees and general branching processes
• Spectra of random graphs with given expected degrees
• High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Random incidence matrices: moments of the spectral density

This page was built for publication: Spectra of large random trees