Resolvent of large random graphs
From MaRDI portal
Abstract: We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such graphs. We illustrate our results on the uniform regular graphs, Erdos-Renyi graphs and preferential attachment graphs. We sketch examples of application for weighted graphs, bipartite graphs and the uniform spanning tree of n vertices.
Recommendations
Cites work
- A critical point for random graphs with a given degree sequence
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A Survey on Spectra of infinite Graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Eigenvalue distribution of large weighted random graphs
- scientific article; zbMATH DE number 3711987 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 3435823 (Why is no real title available?)
- scientific article; zbMATH DE number 1465044 (Why is no real title available?)
- scientific article; zbMATH DE number 858898 (Why is no real title available?)
- scientific article; zbMATH DE number 3383043 (Why is no real title available?)
- Limits of dense graph sequences
- On limits of finite graphs
- Processes on unimodular random networks
- Random graph dynamics
- Random incidence matrices: moments of the spectral density
- Recurrence of distributional limits of finite planar graphs
- Sparse random matrices: the eigenvalue spectrum revisited
- Spectrum estimation for large dimensional covariance matrices using random matrix theory
- Spectrum of large random reversible Markov chains: heavy-tailed weights on the complete graph
- Symmetric Random Walks on Groups
- The expected eigenvalue distribution of a large regular graph
- The semicircle law for semiregular bipartite graphs
- The spectrum of an infinite graph
- Walk generating functions and spectral measures of infinite graphs
Cited in
(50)- Mean quantum percolation
- Delocalization and limiting spectral distribution of Erdős-Rényi graphs with constant expected degree
- Empirical spectral distributions of sparse random graphs
- Emergence of extended states at zero in the spectrum of sparse random graphs
- Spectra of random regular hypergraphs
- Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
- Local picture and level-set percolation of the Gaussian free field on a large discrete torus
- On some spectral properties of large block Laplacian random matrices
- Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group
- Stationary solutions and local equations for interacting diffusions on regular trees
- Spectra of large diluted but bushy random graphs
- The large connectivity limit of the Anderson model on tree graphs
- Eigenvalue distribution of bipartite large weighted random graphs. Resolvent approach
- On the phase transition in random simplicial complexes
- Matchings on infinite graphs
- Central Limit Theorems and Asymptotic Spectral Analysis on Large Graphs
- Spectral asymptotic expansion of Wishart matrices with exploding moments
- Lévy-Khintchine random matrices and the Poisson weighted infinite skeleton tree
- Spectral properties of the trap model on sparse networks
- Lack of hyperbolicity in asymptotic Erdős-Renyi sparse random graphs
- A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes
- Glassy dynamics on networks: local spectra and return probabilities
- The rank of diluted random graphs
- Spectrum of large random Markov chains: Heavy-tailed weights on the oriented complete graph
- Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős-Rényi random graphs
- On local weak limit and subgraph counts for sparse random graphs
- Spectral theory of sparse non-Hermitian random matrices
- Top eigenpair statistics for weighted sparse graphs
- Second largest eigenpair statistics for sparse graphs
- scientific article; zbMATH DE number 7653400 (Why is no real title available?)
- Spectral gap in random bipartite biregular graphs and applications
- On the probabilistic representation of the free effective resistance of infinite graphs
- Global eigenvalue fluctuations of random biregular bipartite graphs
- Bernoulli random matrices
- Random matrices with row constraints and eigenvalue distributions of graph Laplacians
- Localization of eigenvectors in random graphs
- Lifshitz tails on the Bethe lattice: A combinatorial approach
- Local limit of the random degree constrained process
- Eigenvalue spectral tails and localisation properties of asymmetric networks
- Sparse regular random graphs: spectral density and eigenvectors
- Complex systems in ecology: a guided tour with large Lotka-Volterra models and random matrices
- The critical Karp-Sipser core of random graphs
- Spectral properties, localization transition and multifractal eigenvectors of the Laplacian on heterogeneous networks
- Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes
- Large deviation principle for the norm of the Laplacian matrix of inhomogeneous Erdős-Rényi random graphs
- Spectra of large random trees
- Statistical field theory of random graphs with prescribed degrees
- Limiting spectra of inhomogeneous random graphs
- A note on the graph's resolvent and the multifilar structure
- On quantum percolation in finite regular graphs
This page was built for publication: Resolvent of large random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055896)
