Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Mean distance on metric graphs

Luís N. Baptista, James B. Kennedy, Delio Mugnolo

Abstract

We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of the spectral gap of the graph Laplacian with standard vertex conditions: it is maximised among all graphs of fixed length by the path graph (interval), or by the loop in the restricted class of doubly connected graphs, and it is minimised among all graphs of fixed length and number of edges by the equilateral flower graph. We also establish bounds for the correctly scaled product of the spectral gap and the square of the mean distance which depend only on combinatorial, and not metric, features of the graph. This raises the open question whether this product admits absolute upper and lower bounds valid on all compact metric graphs.

Mean distance on metric graphs

Abstract

We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of the spectral gap of the graph Laplacian with standard vertex conditions: it is maximised among all graphs of fixed length by the path graph (interval), or by the loop in the restricted class of doubly connected graphs, and it is minimised among all graphs of fixed length and number of edges by the equilateral flower graph. We also establish bounds for the correctly scaled product of the spectral gap and the square of the mean distance which depend only on combinatorial, and not metric, features of the graph. This raises the open question whether this product admits absolute upper and lower bounds valid on all compact metric graphs.
Paper Structure (7 sections, 11 theorems, 83 equations, 2 figures)

This paper contains 7 sections, 11 theorems, 83 equations, 2 figures.

Table of Contents

  1. Introduction
  2. Notation and assumptions
  3. Main results
  4. Examples
  5. Surgery principles
  6. Symmetrisation and doubly connected graphs
  7. A variational comparison method

Key Result

Theorem 3.1

Let $\mathcal{G}$ be a compact metric graph of diameter $\mathop{\mathrm{diam}}\nolimits (\mathcal{G}) > 0$. Then Moreover, there exists a sequence of graphs $\mathcal{G}_n$ for which $\frac{\rho (\mathcal{G}_n)}{\mathop{\mathrm{diam}}\nolimits (\mathcal{G}_n)} \to 1$ as $n \to \infty$.

Figures (2)

  • Figure 4.1: A firework graph with $m=4$, $n=7$, and $J=5j$.
  • Figure 5.1: "Unfolding pendant edges": replacing the configuration of $e_1 \cup e_2$ in $\mathcal{H}$ by the one in $\widetilde{\mathcal{H}}$ increases $\rho$.

Theorems & Definitions (29)

  • Definition 2.1
  • Definition 2.2
  • Theorem 3.1
  • proof
  • Theorem 3.2
  • Corollary 3.3
  • proof : Proof of Corollary \ref{['cor:comparison']}
  • Theorem 3.5
  • Corollary 3.6
  • Example 4.1: Star graph
  • ...and 19 more