Loop interactions and their representations in Fock space
Yves Le Jan

TL;DR
This paper introduces two types of natural interactions in Fock space derived from weighted graphs, involving loop ensembles, spanning trees, loop holonomies, and random connections, expanding the mathematical framework for such systems.
Contribution
It presents novel methods to define and analyze interactions in Fock space based on graph structures, specifically involving loops and holonomies.
Findings
Defined interactions between Fock spaces using graph-based structures
Connected loop ensembles with spanning trees in a new framework
Linked loop holonomies with random connections in Fock space
Abstract
Given a weighted graph, we show how to define two types of natural interactions which correspond to local interactions between two Fock spaces. The first type of interaction involves loop ensembles and spanning trees. The second type of interaction involves loop holonomies and random connections.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Data Management and Algorithms · Advanced Combinatorial Mathematics
Loop interactions and their representations in Fock space
Yves Le Jan
Abstract
It has been observed that on a weighted graph, an extension of Wilson’s algorithm provides an independent pair , being a spanning tree and a Poissonian loop ensemble. This association can be interpreted in the framework of symmetric and skew symmetric Fock spaces. Given a weighted graph, we show how to define two types of natural interactions which correspond to local interactions between two Fock spaces. The first type of interaction involves loop ensembles and spanning trees. The second type of interaction involves loop holonomies and random connections.
00footnotetext: Key words and phrases: Free fields, Markov loops, spanning trees, connections, Fock space00footnotetext: AMS 2010 subject classification: 60J27, 60G60.
1 Framework and definitions
Consider a system of conductances on a finite connected graph without loop edges nor multiple edges. After the choice of a root , we denote by the set of edges not incident to and by the set of oriented such edges. Consider the energy defined on by the conductances on edges of and the killing measure :
[TABLE]
We set and denote by the diagonal matrix representing the multiplication by . The Green function on associated with is . Recall that
Recall that an extension of Wilson’s algorithm yields an independent pair, being a spanning tree rooted in and a Poissonian loop ensemble on with intensity given by the loop measure defined by the symmetric continuous time Markov chain associated wth (see [2]). We denote by and their distributions.
The loops are obtained by dividing, at each vertex, the concatenation of the erased excursions according to a Poisson-Dirichlet distribution (in continuous time), then by forgetting the base points. We denote by the number of crossings of the edge by the loops of , by the number of crossings of the oriented edge by the loops of , and by the total time spent by the loops of at the vertex normalized by .
Recall that for any complex function , , defined on the set of oriented edges, and defined on , denoting by the Hadamard product,
[TABLE]
2 An interaction between tree and loops
Given a parameter we can define an interacting pair by the joint distribution:
[TABLE]
being a normalization constant.
As tends to 0, the loops of tend to be carried by . In particular, they tend to have trivial holonomies, i.e. to be contractible to a point. As tends to 1, and tend to be independent.
Similarly, Given a parameter we can define an interacting pair by the joint distribution:
[TABLE]
being a normalization constant.
3 Interaction in supersymmetric Fock space
The independent pair , associating a spanning tree and a Poissonian loop ensemble can be interpreted in the framework of symmetric and skew symmetric Fock spaces (see [2]).
The partition function and more generally expectations of various functionals of the random pair can be expressed in terms of the supersymmetric Fock space associated with . First note that if denotes the complex Bose field and the Fermi field, it follows from (1) and from Fock space calculations (see for example [3] and [2]) that for any complex function , , defined on the set of oriented edges, and defined on , denoting the vacuum state by 1,
[TABLE]
Note that the same representation can be given in terms of expectation of functionals of complex Gaussian variables. This is in fact the usual terminology in probability but we are using Bose fields to emphasize the symmetry with the Fermi field.
Also, for any function and defined on edges, setting
[TABLE]
,
[TABLE]
Note that the same representation can be given in terms of complex differential forms (see the introduction of [3]), or in terms of and Grassmann integration ([1]).
Then we have the following representation of :
Theorem 3.1
*For any ,
*More generally, for any defined on edges, defined on vertices and any complex function , , defined on oriented edges, the expression equals:
**
Proof. The first expression equals:
Note that for close to 1, the joint distribution is a perturbation of the product . The Fock space representation allows to expand the partition function and related expressions according to powers of .
A similar representation can be given for .
4 Connections and holonomy
Consider a finite group and a -connection on the graph. A -connection can be defined as an equivalence class of maps from oriented edges into , such as opposite orientations have inverse images. is equivalent to if and only if there exist a map from vertices into such that . The choice of a representative of a connection is often refered to as a choice of gauge. A connection defines a non-ramified cover of the graph. Fibers have cardinality and acts faithfully and transitively on them. The conductances and the killing measure can be lifted to the covering graph. We denote by the associated Green function and by the associated loop ensemble.
If , we note that connections are defined by percolation configurations.
Given a connection , any loop defines a conjugacy class of , denoted . It is obtained by choosing a base point in , some representing , by multiplying the group elements assigned to the edges of the loop in cyclic order and by taking the conjugacy class of the product. Clearly, the holonomy depends only on the geodesic (i.e. non-backtracking) loop associated with by removing tree-like subloops. Geodesic loops represent the conjugacy classes of the fundamental group.
The projection of the loop ensemble on the graph is the set of loops of trivial holonomy in , the union of independent copies of (which is a Poisson process with intensity ) (see [4]). Denoting by the unity of , image of is . Conversely, the loop ensemble can be constructed by taking independently and uniformly a lift of all loops of trivial holonomy in .
The counterpart of this property in Fock space is that in a given gauge, the density of the Gaussian free field on the cover with respect to the densities of independent free fields on is given by :
[TABLE]
In particular,
[TABLE]
5 Interaction with connections
Given a spanning tree , we say that is -reduced if for all edges of . One easily sees that any connection has a unique -reduced representative. If is a symmetric probability on , assigning to the edges of the tree, oriented arbitrarily, independent -distributed random elements of defines a random connection . Its distribution does not depend on the chosen orientation. Then is a natural distribution on the space of connections and a joint probability distribution on spanning tree and connections. The tree and the connection are generally not independent, unless is chosen to be uniform.
Any non-negative central function on defines a distribution on triples , denoting a countable family of time continuous loops on the graph, not visiting :
[TABLE]
denotes a normalization constant (partition function).
can be decomposed using the characters of the unitary representations of .
A natural choice of is . Then the partition function is
[TABLE]
Note that if is close to , the joint distribution of and is close to The Fock space representation can yield a perturbation expansion of the partition function and related expressions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Felix Berezin. The Method of Second Quantization, Academic Press (1966).
- 2[2] Yves Le Jan. Markov paths, loops and fields. École d’Été de Probabilités de Saint-Flour XXXVIII - 2008. Lecture Notes in Mathematics 2026. (2011) Springer-Verlag, Berlin-Heidelberg.
- 3[3] Yves Le Jan, On the Fock space representation of functionals of the occupation field and their renormalization. J.F.A. 80, 88-108 (1988)
- 4[4] Yves Le Jan. Markov loops, coverings and fields. Ann. Fac. Sci. Toulouse Math. (6) 26 (2017), no. 2, 401–416.
