Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
0 answers
141 views

algebraic connectivity of a tree

Suppose that $T$ is a tree with $n$ vertices and $L$ is the Laplacian matrix of $T$ and $0=\mu_1 \leq \mu_2 \leq \cdots \leq \mu_n$ are laplacian eigenvalues. I think the multiplicity of $\mu_2$ can ...
5 votes
1 answer
1k views

The spectrum of the discrete Laplacian

Consider a connected (we define connected components by defining the set of vertices where every vertex has one neighbour) sublattice $V$ of the square lattice $V \subset\mathbb{Z}^2.$ On this we ...
3 votes
1 answer
775 views

Is there some quantitative version of interlacing of eigenvalues of a matrix under rank-1 update?

Given a real symmetric matrix $A$ and a vector $v$ of the same dimension we know that the eigenvalues of $A + vv^T$ are left interlaced by the eigenvalues of $A$. But do we have any quantitative ...
1 vote
1 answer
225 views

About expectation norms on graphs

Let $S \subseteq V$ of a $d-$regular graph $G$ such that $\mu = \frac{\vert S \vert }{\vert V \vert } $. Let $A$ be the adjacency matrix of the graph. Then define the quantity $\phi(S)= \frac{E(S,\bar{...