A lower bound on the spectrum of unimodular networks

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Rahman, Mustazee
Format: Preprint
Veröffentlicht: 2016
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866929518597373952
author Rahman, Mustazee
author_facet Rahman, Mustazee
contents Unimodular networks are a generalization of finite graphs in a stochastic sense. We prove a lower bound to the spectral radius of the adjacency operator and of the Markov operator of an unimodular network in terms of its average degree. This allows to prove an Alon-Boppana type bound for the largest eigenvalues in absolute value of large, connected, bounded degree graphs, which generalizes the Alon-Boppana theorem for regular graphs. A key step is establishing a lower bound to the spectral radius of a unimodular tree in terms of its average degree. Similarly, we provide a lower bound on the volume growth rate of an unimodular tree in terms of its average degree.
format Preprint
id arxiv_https___arxiv_org_abs_1609_02209
institution arXiv
publishDate 2016
record_format arxiv
spellingShingle A lower bound on the spectrum of unimodular networks
Rahman, Mustazee
Combinatorics
Discrete Mathematics
Probability
Unimodular networks are a generalization of finite graphs in a stochastic sense. We prove a lower bound to the spectral radius of the adjacency operator and of the Markov operator of an unimodular network in terms of its average degree. This allows to prove an Alon-Boppana type bound for the largest eigenvalues in absolute value of large, connected, bounded degree graphs, which generalizes the Alon-Boppana theorem for regular graphs. A key step is establishing a lower bound to the spectral radius of a unimodular tree in terms of its average degree. Similarly, we provide a lower bound on the volume growth rate of an unimodular tree in terms of its average degree.
title A lower bound on the spectrum of unimodular networks
topic Combinatorics
Discrete Mathematics
Probability
url https://arxiv.org/abs/1609.02209