In this thesis we prove the following results.1. We show that the multiplicity of the second normalized adjacency matrix eigenvalueof any connected graph of maximum degree Δ is bounded by nΔ^(7/5)/polylog(n) for any Δ, and n*polylog(d)/polylog(n) for simple d-regular graphs when d is sufficiently large.2. Let G be a random d-regular graph. We prove that for every constant α > 0, withhigh probability every eigenvector of the adjacency matrix of G with eigenvalue less than −2√(d − 2) − α has Ω(n/polylog(n)) nodal domains.3. For every d = p + 1 for prime p and infinitely many n, we exhibit an n-vertexd-regular graph with girth Ω(log_(d−1) n) and vertex expansion of sublinear sized sets upper bounded by (d+1)/2 whose nontrivial eigenvalues a...
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix ...
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schrödinger operators i...
. We carry out a numerical study of fluctuations in the spectra of regular graphs. Our experiments i...
A d-regular graph has largest or first (adjacency matrix) eigenvalue λ1 = d. Consider for an even d ...
We present a new approach to showing that random graphs are nearly optimal expanders. This approach ...
N this thesis, we study concentration properties of eigenfunctions of the discrete Laplacian on regu...
The goal of this thesis is to upper bound the expected value of the second largest eigenvalue in mag...
For a fixed graph, B, we study a probability model of random covering maps of degree n. Specifically...
The goal of this thesis is to upper bound the expected value of the second largest eigenvalue in mag...
For a fixed graph, B, we study a probability model of random covering maps of degree n. Specifically...
We study the adjacency matrices of random $d$-regular graphs with large but fixed degree $d$. In the...
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix ...
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of ...
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of ...
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of ...
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix ...
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schrödinger operators i...
. We carry out a numerical study of fluctuations in the spectra of regular graphs. Our experiments i...
A d-regular graph has largest or first (adjacency matrix) eigenvalue λ1 = d. Consider for an even d ...
We present a new approach to showing that random graphs are nearly optimal expanders. This approach ...
N this thesis, we study concentration properties of eigenfunctions of the discrete Laplacian on regu...
The goal of this thesis is to upper bound the expected value of the second largest eigenvalue in mag...
For a fixed graph, B, we study a probability model of random covering maps of degree n. Specifically...
The goal of this thesis is to upper bound the expected value of the second largest eigenvalue in mag...
For a fixed graph, B, we study a probability model of random covering maps of degree n. Specifically...
We study the adjacency matrices of random $d$-regular graphs with large but fixed degree $d$. In the...
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix ...
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of ...
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of ...
One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of ...
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix ...
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schrödinger operators i...
. We carry out a numerical study of fluctuations in the spectra of regular graphs. Our experiments i...