2
$\begingroup$

Let $\Gamma$ be an undirected graph the degree of whose $n$ vertices is $\leq D$ without necessarily being constant. Say we have bounds of type $\leq \gamma^{2 k}$ for the number of closed geodesics of length $2 k$ for any large $k$, for some $\gamma$. Can we bound the eigenvalues of the adjacency matrix $A$ of $\Gamma$?

(If the degree were constant, this would be easy, via the Ihara zeta function and/or Hashimoto's operator. When the degree is non-constant, the relation between the Ihara zeta function, on the one hand, and the eigenvalues of $A$, on the other, is less clean.)

If it helps, you can assume $\gamma$ is of size $O(\sqrt{D})$.

$\endgroup$
15
  • $\begingroup$ Perron-Frobenius? $\endgroup$
    – markvs
    Commented Jan 10, 2021 at 23:46
  • $\begingroup$ Is that enough? If we had a bound on the number of closed walks of length 2k, the problem would be easy (you wouldn't need Perron-Frobenius). What we are actually given is a bound on the number of closed geodesics, i.e., closed, non-backtracking walks. $\endgroup$ Commented Jan 11, 2021 at 0:16
  • $\begingroup$ Alternatively: you can use Perron-Frobenius to bound the eigenvalues of Hashimito's edge-adjacency operator, but how do you go from there to the eigenvalues of A when the degree is non-constant? $\endgroup$ Commented Jan 11, 2021 at 0:29
  • $\begingroup$ I thought that the way to prove that the largest eigenvalue is unique also gives an upper bound. $\endgroup$
    – markvs
    Commented Jan 11, 2021 at 4:46
  • 1
    $\begingroup$ what is a closed geodesic? $\endgroup$ Commented Jan 11, 2021 at 13:03

0

You must log in to answer this question.

Browse other questions tagged .