This question can be phrased in different settings. I will discuss a spectral formulation and the equivalent random walk version. The question came up naturally in [recent work](https://arxiv.org/abs/2302.06021) with Devriendt and Ottolini. We have no particular reason to think the inequality is true except that it would fit very naturally into our other results and seems naturally related to some existing results.


**Spectral version.** Suppose $G=(V,E)$ is a finite, connected graph on $n$ vertices and $L=D-A$ is the associated (Kirchhoff) Graph Laplacian. $L$ has eigenvalues $ 0 = \lambda\_1 < \lambda\_2 \leq \lambda\_3 \leq \dots$



> 
> **Question.** Is it true that, for some universal constant $c>0$, that
> $$ \mbox{diam}(G)^2 \leq c \sum\_{i=2}^{n} \frac{1}{\lambda\_i} \qquad ?$$
> 
> 
> 


The right-hand side is also sometimes known as the Kirchhoff index of a graph but we couldn't find the inequality in the literature. The inequality would be sharp up to constants for the cycle graph $C\_n$ in the sense that both sides are $\sim n^2$. There's a related inequality of Alon-Milman saying that, with $\Delta$ being the largest degree, that
$$ \mbox{diam}(G)^2 \leq c \cdot \Delta \cdot (\log n)^2 \cdot \frac{1}{\lambda\_2}$$
and one way of phrasing our question is whether one can remove the dependence on $|V| = n$ and $\Delta$ by taking the remainder of the spectrum into account. We also note that there is an inequality by McKay that can be written as
$$ \mbox{diam}(G) \geq \frac{4}{n} \frac{1}{\lambda\_2} \geq \sum\_{i=2}^{n} \frac{1}{\lambda\_i}$$
where the second inequality is of course quite suboptimal, however, it does naturally suggest the question of whether there is a converse statement along these lines.


**Random walk version.** A way of phrasing the question probabilistically is as follows: define the commute time $C\_{ij}$ between two vertices $i,j \in V$ as the expected time a random walk needs to go from $i$ to $j$ and then return to $i$. Note that this definition is symmetric $C\_{ij} = C\_{ji}$.



> 
> **Question.** Is there a universal $c>0$ such that
> $$ \mbox{average commute time} = \frac{1}{n^2} \sum\_{i,j \in V} C\_{ij} \geq c \frac{ \mbox{diam}(G)^2 \cdot |E|}{|V|}.$$
> 
> 
> 


This seems like a really nice inequality: in order for random walks to travel quickly between a `typical' pair of vertices we want small diameter and few edges. It's easy to see that for a cycle graph $C\_n$ both sides are $\sim n^2$. If we take an expander graph on $n$ vertices, then one would expect the left-hand side to be $\sim n$ while the right-hand side is $\sim 1$ (since $|E| \sim |V|$ and $\mbox{diam}(G) \sim 1$), so the inequality would be far from sharp in that case.


One way of showing the equivalence between the two formulations is as follows. Define the resistance distance between two vertices as
$ \Omega\_{ij} = C\_{ij}/(2|E|).$
Using the identity
$ \frac{1}{n} \sum\_{i < j \in V} \Omega\_{i,j} = \sum\_{i=2}^{n} \frac{1}{\lambda\_i}$
and we can rewrite our question as
$$ \mbox{diam}(G)^2 \leq c \sum\_{i=2}^{n} \frac{1}{\lambda\_i} = \frac{c}{n} \sum\_{i < j \in V} \Omega\_{i,j} = \frac{c}{2|E| n} \sum\_{i <j} C\_{ij}.$$



Diameter bound for graphs: spectral and random walk versions
The conjectured inequality is false in General.




---


Proof: Let $\ell=\lfloor n^{1/2}/2 \rfloor$ and let
$G\_1,G\_2,\dots,G\_\ell$ be disjoint cliques of size $\ell$. Let $K$ be a clique on $n-\ell^2 >n/2$ nodes. Connect every node in $G\_i$ to every node in $G\_{i+1}$ for $i<\ell$, and connect every node in $G\_\ell$ to every node of $K$. This defines the graph $G$ of diameter $\ell$.
For $i<\ell/2$, the effective resistance between a node $v$ in $G\_i$ and a node $w$ in $K$ is $\Theta(1/\ell)$,
so the commute time between $v$ and $w$ is $\Theta(\ell^3)$.


Consequently, the average commute time between all pairs in $G$ is $\Theta(\ell^3)$ as well, which contradicts the conjectured inequality.


