Let Graphd denote the set of all finite simple graphs G (up to isomorphism) for which deg(x)≤d for every x∈V(G). For a graph G and x,y∈V(G) let dG(x,y) denote the distance of x and y, that is the length of the shortest path from x to y. A rooted (r,d)-ball is a graph G∈Graphd with a marked vertex x∈V(G) called the root such that dG(x,y)≤r for every y∈V(G). By Ur,d we shall denote the set of rooted (r,d)-balls.
If G∈Graphd is a graph and x∈V(G) then Br(x)∈Ur,d shall denote the rooted (r,d)-ball around x in G. For any α∈Ur,d and G∈Graphd we define the set T(G,α)=\mboxdef{x∈V(G):Br(x)≅α} and let pG(α)=\mboxdef∣V(G)∣∣T(G,α)∣. A graph sequence G={Gn}n=1∞⊂Graphd is weakly convergent if limn→∞∣V(Gn)∣=∞ and for every r and every α∈Ur,d the limit limn→∞pGn(α) exists (see ).
Let Grd denote the set of all countable, connected rooted graphs G for which deg(x)≤d for every x∈V(G). If G,H∈Grd let dg(G,H)=2−r, where r is the maximal number such that the r-balls around the roots of G resp. H are rooted isomorphic. The distance dg makes Grd a compact metric space. Given an α∈Ur,d let T(Grd,α)={(G,x)∈Grd:Br(x)≅α}. The sets T(Grd,α) are closed-open sets. A convergent graphs sequence {Gn}n=1∞ define a local limit measure μG on Grd, where μG(T(Grd,α))=limn→∞pGn(α). However, not all the probability measures on Grd arise as local limits. A necessary condition for a measure μ being a local limit is its involution invariance (see Section 2). The goal of this paper is to answer a question of Bollobás and Riordan (Question 6.8 ):
Any involution-invariant measure μ on Grd concentrated on trees arises as a local limit of some convergent graph sequence.
As it was pointed out in such graph sequences are asymptotically treelike, thus μ must arise as the local limit of a convergent large girth sequence.
Involution invariance
Let Grd be the compact space of all connected countable rooted graphs G (up to isomorphism) of vertex degree bound d with a distinguished directed edge pointing out from the root. Note that G and H are considered isomorphic if there exists a rooted isomorphism between them mapping distinguished edges into each other. Let Ur,d be the isomorphism classes of all rooted (r,d)-graphs α with a distinguished edge e(α) pointing out from the root. Again, T(Grd,α) is well-defined for any α∈Ur,d and defines a closed-open set in Grd. Clearly, the forgetting map F:Grd→Grd is continuous. Let μ be a probability measure on Grd. Then we define a measure μ on Grd the following way.
Let α∈Ur,d and let F(α)=α∈Ur,d be the underlying rooted ball. Clearly, F(T(Grd,α))=T(Grd,α).Let
where l is the number of edges e pointing out from the root such that there exists a rooted automorphism of α mapping e(α) to e. Observe that
We define the map T:Grd→Grd as follows. Let T(G)=H, where :
the underlying graphs of G and H are the same,
the root of H is the endpoint of e(G),
the distinguished edge of H is pointing to the root of G.
Note that T is a continuous involution. Following Aldous and Steele , we call μ involution-invariant if T∗(μ)=μ. It is important to note , that the limit measure of convergent graphs sequences are always involution-invariant.
We need to introduce the notion of edge-balls. Let G∈Grd. The edge-ball Bre(G) of radius r around the root of G is the following spanned rooted subgraph of G:
The root of Bre(G) is the same as the root of G.
y is a vertex of Bre(G) if d(x,y)≤r or d(x′,y)≤r, where x is the root of G and x′ is the endpoint of the directed edge e(G).
The distinguished edge of Bre(G) is (x,x′).
Let Er,d be the set of all edge-balls of radius r up to isomorphism. Then if ϕ∈Er,d, let s(ϕ)∈Ur,d be the rooted ball around the root of ϕ. Also, let t(ϕ)∈Ur,d be the r-ball around x′ with distinguished edge (x′,x).
The involution Tr,d:Er,d→Er,d is defined the obvious way and t(Tr,d(ϕ))=s(ϕ), s(Tr,d(ϕ))=t(ϕ). Since μ is a measure we have
since T(T(Grd,ϕ))=T(Grd,Tr,d(ϕ). Therefore by (1),
Labeled graphs
Let Grdn be the isomorphism classes of
connected countable rooted graphs with vertex degree bound d
with a distinguished edge pointing out from the root
with vertex labels from the set {1,2,…,n}.
Note that if G∗ and H∗ are such graphs then they called isomorphic if there exists a map ρ:V(G∗)→V(H∗) preserving both the underlying Grd-structure and the the vertex labels. The labeled r-balls Unr,d and the labeled r-edge-balls Enr,d are defined accordingly. Again, Grdn is a compact metric space and T(Grdn,α∗), T(Grdn,ϕ∗) are closed-open sets, where α∗∈Ur,d, ϕ∗∈Enr,d. Now let μ be an involution-invariant probability measure on Grd with induced measure μ. The associated measure μn on Grdn is defined the following way.
Let α∈Ur,d and κ1,κ2 be vertex labelings of α by {1,2,…,n}. We say that κ1 and κ2 are equivalent if there exists a rooted automorphism of α preserving the distinguished edge and mapping κ1 to κ2. Let C(κ) be the equivalence class of the vertex labeling κ of α. Then we define
μn extends to a Borel-measure.
μ(T(Grd,α))=∑α∗,F(α∗)=αμn(T(Grdn,α∗)).
Proof. The second equation follows directly from th definition. In order to prove that μn extends to a Borel-measure it is enough to prove that
where α∗∈Unr,d and Nr+1(α∗) is the set of elements β∗ in Unr+1,d such that the r-ball around the root of β∗ is isomorphic to α∗. Let α=F(α∗)∈Ur,d and let Nr+1(α)⊂Ur,d be the set of elements β such that the r-ball around the root of β is isomorphic to α. Clearly
Let κ be a labeling of α by {1,2,…,n} representing α∗. For β∈Nr+1(α) let L(β) be the set of labelings of β that extends some labeling of α that is equivalent to κ.
Observe that ∣L(β)∣=∣C(κ)∣n∣V(β)∣−V(α)∣. Hence
Therfore using equation (4) our lemma follows.
The following proposition shall be crucial in our construction.
Proof. The first equation follows from the fact that μn is a Borel-measure. Thus the second equation will be an immediate corollary of the third one. So, let us turn to the third equation. Let F(ψ∗)=ψ∈Er,d and let κ be a vertex-labeling of ψ representing ψ∗. It is enough to prove that
where C(κ) is the set of labelings of ψ equivalent to κ. Let Nr+1(ψ)∈Ur,d be the set of elements β such that the edge-ball of radius r around the root of β is isomorphic to ψ. Then
where k(β,ψ∗) is the number of labelings of β extending an element that is equivalent to κ. Notice that k(β,ψ∗)=∣C(κ)∣n∣V(β)∣−∣V(ψ)∣. Hence by (5) μn(T(Grdn,ψ∗))=n∣V(ψ)∣∣C(κ)∣μ(T(Grd,ψ)), thus our proposition follows.
Label-separated balls
Let Grdn be the isomorphism classes of
connected countable rooted graphs with vertex degree bound d
with vertex labels from the set {1,2,…,n}.
Again, we define the space of labeled r-balls Unr,d. Then Grdn is a compact space with closed-open sets T(Grdn,M),M∈Unr,d. Similarly to the previous section we define an associated probability measure μn, where μ in an involution-invariant probability measure on Grd.
Let M∈Unr,d and let R(M) be the set of elements of Unr,d with underlying graph M. If A∈R(M), then the multiplicity of A, lA is the number of edges e pointing out from the root of A such that there is a label-preserving rooted automorphism of A moving the distinguished edge to e. Now let
The following lemma is the immediate consequence of Lemma 3.1.
μn is a Borel-measure on Grdn and ∑M∈M(α)μn(M)=μ(A) if α∈Ur,d and M(α) is the set of labelings of α by {1,2,…,n}.
M∈Unr,d is called label-separated if all the labels of M are different.
For any α∈Ur,d and δ>0 there exists an n>0 such that
where T(n,α) is the number of {1,2,…,n}-labelings of α with different labels. Clearly, n∣V(α)∣T(n,α)→1 as n→∞.
The proof of Theorem 1
Let μ be an involution-invariant probability measure on Grd supported on trees. It is enough to prove that for any r≥1 and ϵ>0 there exists a finite graph G such that for any α∈Ur,d
The idea we follow is close to the one used by Bowen in . First, let n>0 be a natural number such that
Then we define a directed labeled finite graph H to encode some information on μn. If A∈Unr+1,d then let LA be the unique element of Enr,d contained in A.
The set of vertices of H; V(H):=Unr+1,d. If A,B∈Unr+1,d and LA=LB−1 (we use the inverse notation instead of writing out the involution operator) then there is a directed edge (A,LA,B) from A to B labeled by LA and a directed edge (B,LB,A) from B to A labeled by LB=LA−1. Note that we might have loops. We define the weight function w on H by
w(A)=μn(T(Grdn,A)).
w(A,LA,B)=μ(T(Grdn,LA,B)), where LA,B∈Enr+1,d the unique element such that s(LA,B)=A,t(LA,B)=B.
By Proposition 3.1 we have the following equation for all A,B that are connected in H:
where lA is the multiplicity of w(A).
Since the equations (7), (8), (9) have rational coefficients we also have weight functions wδ on H
such that ∣wδ(A)−w(A)∣<δ for any A∈V(H), where the exact value of δ will be given later.
Now let N be a natural number such that
Step 1. We construct an edge-less graph Q such that:
V(Q)=∪A∈V(H)Q(A) (disjoint union)
each Q(A) is partitioned into ∪(A,LA,B)∈E(H)Q(A,LA,B) such that ∣Q(A,LA,B)∣=Nwδ(A,LA,B).
Since wδ satisfy our equations such Q can be constructed.
Step 2. We add edges to Q in order to obtain the graph R. For each pair A,B that are connected in the graph H form a bijection ZA,B:Q(A,LA,B)→Q(B,LB,A). If there is a loop in H consider a bijection ZA,A. Then draw an edge between x∈Q(A,LA,B) and y∈Q(B,LB,A) if ZA,B(x)=y.
Step 3. Now we construct our graph G. If M∈Unr+1,d is a rooted labeled tree such that μn(M)=0 let Q(M)=∪A∈R(M)Q(A). We partition Q(M) into ∪i=1sMQi(M) such a way that each Qi(M) contains exactly lA elements from the set Q(A). By the definition of N, we can make such partition.
The elements of V(G) will be the sets {Qi(M)}M∈Unr+1,d,1≤i≤sM. We draw one edge between Qi(M) and Qj(M′) if there exists x∈Qi(M),y∈Qj(M′) such that x and y are connected in R. We label the vertex Qi(M) by the label of the root of M. Let Qi(M) be a vertex of G such that M is a label-separated tree. Note that if M is not a rooted tree then μn(M)=0. It is easy to see that the r+1-ball around Qi(M) in the graph G is isomorphic to M as rooted labeled balls. Also if M is not label-separated then the r+1-ball around Qi(M) can not be a label-separated tree. Therefore
Also, if M is a label-separated tree then
Thus by (6),(11),(13) if δ is choosen small enough then for any α∈Ur+1,d