Related papers: Spectral Monotonicity under Leaf Attachment and Li…

Modern applications in statistics, computer science and network science have seen tremendous values of finer matrix spectral perturbation theory. In this paper, we derive a generic $\ell_{2\rightarrow\infty}$ eigenspace perturbation bound…

Making use of the theory of noncommutative motives, we characterize the topological Dennis trace map as the unique multiplicative natural transformation from algebraic K-theory to topological Hochschild homology (THH) and the cyclotomic…

Ben Arous, Fribergh and Sidoravicius \cite{GAV2014} proved that speed of biased random walk $RW_\lambda$ on a Galton-Watson tree without leaves is strictly decreasing for $\lambda\leq \frac{m_1}{1160},$ where $m_1$ is minimal degree of the…

Let $G$ be an irregular graph on $n$ vertices with maximum degree $\Delta$ and diameter $D$. We show that \Delta-\lambda_1>\frac{1}{nD} where $\lambda_1$ is the largest eigenvalue of the adjacency matrix of $G$. We also study the effect of…

Let $H_0$ be a periodic operator on $\R^+$(or periodic Jacobi operator on $\N$). It is known that the absolutely continuous spectrum of $H_0$ is consisted of spectral bands $\cup[\alpha_l,\beta_l]$. Under the assumption that $\limsup_{x\to…

We compare our upper bounds on the exponential growth constant $\phi(\Lambda)$ characterizing the asymptotic behavior of spanning forests on Archimedean lattices $\Lambda$ with recently derived upper bounds. Our upper bounds on…

We are interested in the asymptotics of random trees built by linear preferential attachment, also known in the literature as Barab\'asi-Albert trees or plane-oriented recursive trees. We first prove a conjecture of Bubeck, Mossel \& R\'acz…

Let $\theta$ be a Bernoulli measure which is stationary for a random walk generated by finitely many contracting rational affine dilations of $\mathbb{R}^d$, and let $\mathcal{K} = \mathrm{supp}(\theta)$ be the corresponding attractor. An…

This work studies the relation between two graph parameters, $\rho$ and $\Lambda$. For an undirected graph $G$, $\rho(G)$ is the growth rate of its universal covering tree, while $\Lambda(G)$ is a weighted geometric average of the vertex…

On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…

The paper studies the spectral properties of the Schr\"odinger operator $A_{gV} = A_0 + gV$ on a homogeneous rooted metric tree, with a decaying real-valued potential $V$ and a coupling constant $g\ge 0$. The spectrum of the free Laplacian…

Late time cosmic acceleration may be achieved by modifying gravity on large scales. This should also have consequences on the evolution of perturbations. We thus extend our study of exponential infrared $f(T)$ teleparallel gravity to…

For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…

The \textit{eccentricity matrix} $\mathcal{E}(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The…

In this paper, we adapt the well-known \emph{local} uniqueness results of Borg-Marchenko type in the inverse problems for one dimensional Schr{\"o}dinger equation to prove \emph{local} uniqueness results in the setting of inverse…

We develop an analytic perturbation theory for eigenvalues with finite multiplicities, embedded into the essential spectrum of a self-adjoint operator $H$. We assume the existence of another self-adjoint operator $A$ for which the family…

In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…

We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…

We consider a family of domains $(\Omega_N)_{N>0}$ obtained by attaching an $N\times 1$ rectangle to a fixed set $\Omega_0 = \{(x,y): 0<y<1, -\phi(y)<x<0\}$, for a Lipschitz function $\phi\geq 0$. We derive full asymptotic expansions, as…

We compute an asymptotic expansion in $1/c$ of the limit in $n$ of the empirical spectral measure of the adjacency matrix of an Erd\H{o}s-R\'enyi random graph with $n$ vertices and parameter $c/n$. We present two different methods, one of…