Related papers: Spectral Monotonicity under Leaf Attachment and Li…

We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…

We calculate exponential growth constants $\phi$ and $\sigma$ describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensional lattices,…

We investigate monotonicity properties of eigenvalues of the Dirichlet Laplacian in polyhedral layers of fixed width. We establish that eigenvalues below the essential spectrum threshold monotonically depend on geometric parameters defining…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We compute the entanglement entropy and the entanglement spectrum of the vacuum state in the massive Schwinger model at a finite $\theta$ angle. The $\theta$ term is implemented through a chirally rotated lattice Hamiltonian that preserves…

In this paper we study threshold-one contact processes on lattices and regular trees. The asymptotic behavior of the critical infection rates as the degrees of the graphs growing to infinity are obtained. Defining \lambda_c as the supremum…

This paper investigates the asymptotic behavior of the principal eigenvalue $\lambda(s)$, as $s\to+\infty$, for the following elliptic eigenvalue problem \begin{equation*}\label{E} -\Delta_{M}u-s\langle \nabla_M f, \nabla_M u\rangle_g +c…

We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…

It has been conjectured that the statistical properties of zeros of the Riemann zeta function near $z = 1/2 + \ui E$ tend, as $E \to \infty$, to the distribution of eigenvalues of large random matrices from the Unitary Ensemble. At finite…

Liu, Hong, Gu, and Lai proved if the second largest eigenvalue of the adjacency matrix of graph $G$ with minimum degree $\delta \ge 2m+2 \ge 4$ satisfies $\lambda_2(G) < \delta - \frac{2m+1}{\delta+1}$, then $G$ contains at least $m+1$…

Using a nonperturbative approach we examine the large frequency asymptotics of the two-point level density correlator in weakly disordered metallic grains. This allows us to study the behavior of the two-level structure factor close to the…

We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…

We study the mixing time of the single-site update Markov chain, known as the Glauber dynamics, for generating a random independent set of a tree. Our focus is obtaining optimal convergence results for arbitrary trees. We consider the more…

We study the edge overlap and local limit of the random spanning tree in random environment (RSTRE) on the complete graph with $n$ vertices and weights given by $\exp(-\beta \omega_e)$ for $\omega_e$ uniformly distributed on $[0,1]$. We…

We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…

Bassino et al. (arXiv:1907.08517) have shown that uniform random co-graphs (graphs without induced $P_4$) of size $n$ converge to a certain non-deterministic graphon. The edge-density of this graphon is a random variable $\Lambda \in [0,1]$…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right],$ define the matrix $A_{\alpha}\left(G\right) $ as \[ A_{\alpha}\left(G\right) =\alpha…

We consider Erd\H{o}s-R\'{e}nyi graphs $G(n,p_n)$ with large constant expected degree $\lambda$ and $p_n=\lambda/n$. Bordenave and Lelarge (2010) showed that the infinite-volume limit, in the Benjamini-Schramm topology, is a Galton-Watson…

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…