Related papers: Uniqueness of the second eigenspace of the interch…

We discuss several natural metrics on spaces of unbounded self--adjoint operators and their relations, among them the Riesz and the graph metric. We show that the topologies of the spaces of Fredholm operators resp. invertible operators…

A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…

The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…

We present an exact analysis of two conductor-insulator transitions in the random graph model. The average connectivity is related to the concentration of impurities. The adjacency matrix of a large random graph is used as a hopping…

We prove a conjecture of Penrose about the standard random geometric graph process, in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of lengths taken in the l_p norm. We show…

The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander…

The transition law of every exchangeable Feller process on the space of countable graphs is determined by a $\sigma$-finite measure on the space of $\{0,1\}\times\{0,1\}$-valued arrays. In discrete-time, this characterization amounts to a…

Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other vertex in finite time, provided they are connected. Discrete-time quantum walks on finite connected graphs however, can have…

We consider a random bistochastic matrix of size $n$ of the form $M Q$ where $M$ is a uniformly distributed permutation matrix and $Q$ is a given bistochastic matrix. Under mild sparsity and regularity assumptions on $Q$, we prove that the…

Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…

When a flux quantum is pushed through a gapped two-dimensional tight-binding operator, there is an associated spectral flow through the gap which is shown to be equal to the index of a Fredholm operator encoding the topology of the Fermi…

We prove that for each $d\geq 3$ and $k\geq 2$, the set of limit points of the first $k$ eigenvalues of sequences of $d$-regular graphs is \[ \{(\mu_1,\dots,\mu_k): d=\mu_1\geq \dots\geq \mu_{k}\geq2\sqrt{d-1}\}. \] The result for $k=2$ was…

The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…

Let $G$ be a graph on $n$ vertices, with complement $\overline{G}$. The spectral gap of the transition probability matrix of a random walk on $G$ is used to estimate how fast the random walk becomes stationary. We prove that the larger…

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…

The probabilities for gaps in the eigenvalue spectrum of finite $ N\times N $ random unitary ensembles on the unit circle with a singular weight, and the related hermitian ensembles on the line with Cauchy weight, are found exactly. The…

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

We give a lower bound on the spectral gap for a class of binary collision processes. In 2008, Caputo showed that, for a class of binary collision processes given by simple averages on the complete graph, the analysis of the spectral gap of…

The spectral flow is a well-known quantity in spectral theory that measures the variation of spectra about $0$ along paths of selfadjoint Fredholm operators. The aim of this work is twofold. Firstly, we consider homotopy invariance…

Denote the Laplacian of a graph $G$ by $L(G)$ and its second smallest Laplacian eigenvalue by $\lambda_2(G)$. If $G$ is a graph on $n\ge 2$ vertices, then it is shown that the second smallest eigenvalue of $L(G) + \frac{1}{n}…