The regular tree completion of a given graph allows us to see important properties of the starting graph. In particular, it shows us that some subgraphs, that we call tangles, have a high second eigenvalue.
Definition
Let G be a finite connected graph with maximal degree less or equal to some integer d larger than 2. We define the d-regular tree completion of G to be the unique (up to isomorphism) infinite graph, Treed(G) which consists of attaching additional free edges to all vertices so that the graph obtained is d-regular. Equivalently, this is the universal covering of the starting graph.
Properties
Let ψ be a connected graph with maximal degree at most d > 2. Then we have
Where λ1(Treed(ψ)) is the spectral radius of that infinite graph and where λIrred(ψ) is the largest irreducible eigenvalue of the graph ψ.
Proof
|
Consider G, the VLG based on the graph ψ that realizes Treed(ψ). Then λ1(Treed(ψ)), the spectral radius of the d-regular tree completion of the the graph ψ, is the inverse of the infimum of all the positive roots, z, of the equation
In other words, we have
Where ZG(z) is the adjacency matrix of G.
Lemma
For any connected graph ψ and the variable length graph G = Treed(ψ) we have
where A = Aψ is the adjacency matrix of the graph ψ, D = Dψ is its degree matrix and
Lemma
The largest irreducible eigenvalue of the graph ψ, λIrred(ψ) is the inverse of the smallest root, y of the equation
Proof
|
This is a straight consequence of Bass' formula:
where λIrred(ψ) is the largest solution of the equation
- Failed to parse (syntax error): {\displaystyle \displaystyle \det[H - \lambda I ] = 0 }
by substituting y = 1/λ we get the equivalence of the solutions.
|
Now consider the change of variables
which is valid if
Notice that this change of variable is increasing as long as it converges. Then we have
which holds for
We can now finish the proof. First, take the case where λ1(Treed(ψ)) > 2√d-1
then there is a z0 such that
which is a root of the equation
Let
which is clearly a root of the equation
and since
we can conclude that
Finally, for the case where λ1(Treed(ψ)) = 2√d-1 then this means that if z0 is a root of det[I-ZG(z)] = 0 then we have that
Assume by contradiction that
then there exists a y0 such that
and that is a root of the equation
But then, our correspondence of eigenvalues gives an associated eigenvalue z0 such that
which contradicts our hypothesis. Hence we can claim that
which concludes the proof of this property.
|
To do
|
|
In the proof of the property, there is a lemma that is missing a proof.
|