Gaussian random permutation and the boson point process
In\'es Armend\'ariz, Pablo A. Ferrari, Sergio Yuhjtman

TL;DR
This paper constructs a Gaussian random permutation model in infinite volume, connecting it to boson point processes and demonstrating its properties across different densities and temperatures.
Contribution
It introduces a novel Gaussian random permutation framework linked to boson systems, including supercritical and subcritical regimes, using loop soups and random interlacements.
Findings
The measure satisfies a Markov property and is Gibbs for the Hamiltonian.
The point marginal matches known boson point processes in different regimes.
The model extends the understanding of spatial permutations and boson systems.
Abstract
We construct an infinite volume spatial random permutation , where is locally finite and is a permutation, associated to the formal Hamiltonian The measures are parametrized by the point density and the temperature . Spatial random permutations are naturally related to boson systems through a representation originally due to Feynman (1953). Let be the critical density for Bose-Einstein condensation in Feynman's representation. Each finite cycle of induces a loop of points of~. For we define as a Poisson process of finite unrooted loops of a random walk with Gaussian increments that we call Gaussian loop soup, analogous to the…
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.
Gaussian random permutation
and the boson point process
Inés Armendáriz, Pablo A. Ferrari, Sergio Yuhjtman Universidad de Buenos Aires & IMAS-UBA-CONICET, [email protected] de Buenos Aires & IMAS-UBA-CONICET, [email protected], [email protected]
Abstract
We construct an infinite volume spatial random permutation , where is locally finite and is a permutation, associated to the formal Hamiltonian
[TABLE]
The measures are parametrized by the point density and the temperature . Spatial random permutations are naturally related to boson systems through a representation originally due to Feynman (1953). Let be the critical density for Bose-Einstein condensation in Feynman’s representation. Each finite cycle of induces a loop of points of . For we define as a Poisson process of finite unrooted loops of a random walk with Gaussian increments that we call Gaussian loop soup, analogous to the Brownian loop soup of Lawler and Werner (2004). We also construct Gaussian random interlacements, a Poisson process of doubly infinite trajectories of random walks with Gaussian increments analogous to the Brownian random interlacements of Sznitman (2010). For and we define as the superposition of independent realizations of the Gaussian loop soup at density and the Gaussian random interlacements at density . In either case we call a Gaussian random permutation at density and temperature . The resulting measure satisfies a Markov property and it is Gibbs for the Hamiltonian . Its point marginal has the same distribution as the boson point process introduced by Shirai-Takahashi (2003) in the subcritical case, and by Tamura-Ito (2007) in the supercritical case.
Keywords: Spatial random permutations, Bose gas, boson process, random interlacements, loop soup.
*AMS 2010 Subject Classification: 82B10, 82B21, 82B26, 60G55, 60G50, 60K35, *
*PACS Numbers: 03.75.Hh, 05.30.Jp, 05.70.Fh *
1 Introduction
The free Bose gas has been intensively studied from different perspectives in mathematical physics. Araki-Woods [1] and Cannon [9] construct it as an infinite volume quantum model; in these works the free Bose gas at density is given by a state of an appropriate -algebra of observables. In a finite volume box , the free Bose gas of particles at temperature is described as a quantum system on the Hilbert space of symmetric functions . The Hamiltonian is minus the Laplacian multiplied by a positive constant that we may choose as . The behavior of the grand-canonical ensemble as , , where is the volume of , was studied by Einstein by diagonalizing the Hamiltonian, reaching the famous conclusion that when there is a critical density above which the lowest energy level exhibits macroscopic occupation number. This critical density is
[TABLE]
Instead of diagonalizing the Hamiltonian, we may write the partition function as
[TABLE]
where is the Laplacian, is the symmetrization operator, and denotes the set of permutations of . We abuse notation by writing . The formula can be obtained by integrating the kernel of the integral operator along the diagonal. This partition function coincides with a statistical mechanics model of spatial random permutations on the configuration space and Radon-Nikodym density
[TABLE]
with respect to the Lebesgue measure on and the uniform counting measure on . This representation was first proposed by Feynman [12] in 1953 in order to explain the transition of Helium-4 from fluid to superfluid. Feynman claimed that the transition to the superfluid phase coincides with the appearance of infinite cycles in a typical spatial random permutation. The approach was taken up by Sütő [28], [29], who proved Feynman’s claim for Bose-Einstein condensation of the free Bose gas.
The thermodynamic limit of the point marginal of the spatial random permutation associated to (1.4) with has been considered by several authors. In the subcritical case when the point density is , Tamura and Ito [33] identified the limit with the boson point process studied by Macchi [25] and Shirai and Takahashi [27], a process with -point correlation functions
[TABLE]
where the parameter , if , and , if , is an increasing function of the density , and denotes the permanent of the matrix . Since the series (1.6) diverges for , the process with these correlations is well defined for densities in dimensions and , and , the solution of , if . Tamura-Ito [32] consider the supercritical boson point process at density in dimension and show that it consists of the superposition of the critical boson point process at density with another point process at density , see §3.1 for a precise description of the latter.
In this paper, to every positive density and temperature we associate an infinite volume spatial random permutation , where is a discrete subset of and is a permutation, that is, a bijection. The law of is translation-invariant and has point density . Our construction stems from the observation that the density (1.4) can be written as a product of weights assigned to the loops induced by the cycles of the permutation . An unrooted loop of size is described as with ; the square brackets indicate that . We denote by the set of points in the loop, and write . A spatial permutation , when is finite, can be decomposed in loops induced by the cycles of . We will say that if is a loop with and for all ; with this notation we have . The numerator of the density function (1.4) factorizes as follows
[TABLE]
The independence of loops suggested by (1.7) was already present in Sütő [28].
We define the Gaussian loop soup as a Poisson process of unrooted loops with Gaussian increments analogous to the Brownian loop soup introduced by Lawler and Werner in [20], see also Lawler and Trujillo Ferreras [19] and Le Jan [23]. The process was previously considered by Fichtner [13, 36], who related it to the ideal Bose Gas. We consider the loop soup at density . When and the point density exceeds the critical density , we allocate the leftover density to an independent realization of Gaussian random interlacements, a Poisson process of doubly infinite trajectories of a discrete-time random walk with Gaussian increments. This process is the discrete-time version of the Brownian random interlacements introduced by Sznitman [30].
We define the Gaussian random permutation in with temperature and density as the spatial random permutation obtained by superposing independent realizations of a Gaussian loop soup with increments of variance at point density , and a Gaussian random interlacements at point density with the same increments.
Our main result can now be stated as follows.
Theorem 1.1**.**
For any dimension , temperature and point density , the Gaussian random permutation with these parameters satisfies a Markov property, and is a Gibbs measure for the specification induced by the finite-volume distribution (1.4). Furthermore, the point marginal of this measure is the boson point process.
This result follows from propositions 4.2, 4.3 and 5.1. In this context, the Markov property means that when (a) the points in and the arrows connecting points in , and (b) the arrows pointing into or out of , are given as a boundary condition, the distribution of the spatial permutation inside only depends on the positions of those points in such that the arrows emanating from them point into , or the arrows pointing to them originate in , and the directions of these arrows; see Fig. 7 in §4.1.
We show in Proposition 2.9 that the point marginal of the loop soup is a permanental process, with correlations (1.5). This result also follows from the equivalence between the point marginal of the loop soup and the subcritical boson point process shown in §5 and the results in [33]. It can be understood as a simple version of the identification of the occupation field moments of loop soups as permanents, see [22].
The boson point process is a Cox process, that is, a Poisson process with a random intensity measure. In the subcritical case, the result is a consequence of the fact that the boson point process is permanental, see (1.5). The property was established for the supercritical case by Eisenbaum in [10]. With the representation of the boson point process as the point marginal of the loop soup or the superposition of the loop soup and the random interlacements, the property can be interpreted as an instance of the isomorphism theorems derived by Le Jan [21] and Sznitman [31].
There are several results concerning the marginal distribution of the permutations. Benfatto, Cassandro, Merola and Presutti [3] proved that in the thermodynamic limit of the supercritical case, the maximal cycle-size rescales with the volume. Betz and Ueltschi [6] prove a phase transition for a family of annealed models that includes the one described by (1.4). Precisely, they prove that above a critical density that equals for the model considered here, a typical permutation in a box of volume contains macroscopic cycles, and the sequence of their rescaled lengths, when sorted in decreasing order, converges to a Poisson-Dirichlet distribution. These results were recently extended to a different class of models by Bogachev and Zeindler [8] and Elboim and Peled [11].
Our results refer to the annealed model, where configurations of points and permutations of these points are jointly sampled. Spatial permutations over fixed sets of points have also been studied. An early result due to Fichtner [14] in 1991, and more recently works by Gandolfo, Ruiz and Ueltschi [16], Betz and Ueltschi [5], Betz [4], Biskup and Richthammer [7] and Armendáriz, Ferrari, Groisman and Leonardi [2], consider these issues when the set of points is fixed as either the regular lattice or a realization of a locally finite point process. It is expected that for dimensions there is a critical temperature below which, almost surely on the realization of the point process, a typical infinite volume permutation will contain infinite cycles. This is a challenging problem, at present all rigorous results pertain to the high temperature regime.
We expect that the Gaussian random permutation with temperature and density is the thermodynamic limit of the distribution in (1.4), and that infinite cycles evolve out of macroscopic cycles. In particular, this would provide an alternative proof that the Gaussian random permutation is a Gibbs measure for the specification associated to (1.4). Vogel [35] has recently derived the thermodynamic limit in a discrete space setting.
The rest of the article is structured as follows. We construct the Gaussian loop soup in §2. In §2.1 we identify the Gaussian loop soup in finite volume conditioned to having a fixed number of points as the canonical measure of the spatial random permutation associated to (1.4), and the unconditioned Gaussian loop soup in finite volume as the grand-canonical measure. We then compute the Laplace functionals of the Gaussian loop soup point marginal and its -point correlations in §2.2. In §3 we introduce Gaussian random interlacements, and derive the Laplace functionals and -point correlations of the point marginal in §3.1. These Laplace functionals and -point correlations are employed in §5 to prove that the boson point process, in any dimension and at any density, is in fact the point marginal of the Gaussian Random permutation with the same parameters; the latter is formally defined in §4. We finally show in §4.1 that the Gaussian random permutation has the Markov property, and moreover it is a Gibbs measure for the specification determined by (1.4).
2 Gaussian loop soup
In this section we construct the Gaussian loop soup. We first introduce the Gaussian loop soup following the construction of the simple random walk loop soup by Lawler and Trujillo Ferreras [19]. In §2.1 we show that the loop soup restricted to a bounded set and conditioned to having points is equal to the canonical distribution on permutations given by (1.4); an analogous result is obtained in the grand-canonical case. In §2.2 we show that the -point correlations of the point marginal of the loop soup match those of the boson point process (1.5), a permanental process.
Consider the Brownian transition density
[TABLE]
Given and , we consider the set of rooted loops of length , or rooted -loops for short,
[TABLE]
with the Borel -algebra of , and define , the rooted Gaussian -loop measure with fugacity , on , as
[TABLE]
We can naturally define the periodic extension of a -loop as a function by setting , where is such that . Let denote the time shift by , . An unrooted loop of length , or unrooted -loop, is an equivalence class of rooted -loops under the equivalence if there exists such that . Let
[TABLE]
denote the set of unrooted -loops and
[TABLE]
the projection. Consider the -algebra on given by the sets such that is measurable, and denote the induced unrooted Gaussian -loop measure with fugacity on defined by
[TABLE]
The factor in front of the push-forward measure compensates for the fact that a loop class is counted times by , according to each possible root choice. For a non negative measurable function , definitions (2.6) and (2.3) yield
[TABLE]
We use the letter to denote an unrooted loop . We will abuse notation and define the support of as the set , and consider as a permutation of satisfying . Given a Borel set and an unrooted loop with support , consider the cardinality of the set
[TABLE]
If the set has finite Lebesgue measure , the mean density of points belonging to -loops in is defined as
[TABLE]
Proposition 2.1** (Point density).**
For any compact set with , we have
[TABLE]
Proof.
By (2.7) we have
[TABLE]
Consider a compact set with positive Lebesgue measure, call the point density of the measure , which does not depend on the particular choice of , and define
[TABLE]
We have
[TABLE]
Define the critical density by
[TABLE]
The space of finite unrooted loops in is
[TABLE]
with the minimal -algebra that contains .
If and satisfy (2.12), so that , define the Gaussian loop soup intensity measure on as
[TABLE]
This measure has point density .
Proposition 2.2**.**
Let and be as in (2.12). Then is -finite.
Proof.
We start by showing that for and , the measure on is -finite. Let be the ball of radius in , and define \Upsilon_{k,j}:=\big{\{}\gamma\in{{\mathbb{D}}}_{k}:\{\gamma\}\cap B_{j}\neq\emptyset\big{\}}\,. Then , and
[TABLE]
by (2.9) and Proposition 2.1. Letting , we have . Then
[TABLE]
Definition 2.3** (Gaussian loop soup).**
Let and satisfy (2.12). We define the Gaussian loop soup at fugacity as a Poisson process on with intensity measure . We will use to denote a realization of the process, and to denote its law.
A configuration of a Gaussian loop soup is a countable collection of unrooted Gaussian loops in , with the property that any compact set contains finitely many points in the supports of these loops. Let be the set of locally finite loop soup configurations,
[TABLE]
where is defined in (2.8).
Let have finite Gaussian loop soup intensity measure, , and consider a measurable, bounded function that is determined by the loops of the configuration that belong to , i.e. if . By definition of Poisson process, we can explicitly write
[TABLE]
where
[TABLE]
and where for any bounded measurable ,
[TABLE]
if the right hand side is well defined. Taking for some bounded and recalling the assumption , we conclude that (2.21) is well defined for this and it is bounded by .
Given denote the set of loop configurations contained in by
[TABLE]
Denote . Given a bounded test function , we get
[TABLE]
which is equivalent to (2.18). In the above equation we consider the total order in induced by the lexicographic order in : if . Definitions (2.18) and (2.23) are equivalent because and do not depend on the order. The function is the density of the Gaussian loop soup at fugacity in the set .
2.1 Finite-volume loop soup and spatial permutations
In this subsection we show that the spatial random permutation with density (1.4) has the same law as the Gaussian loop soup in the bounded domain , conditioned to have points; this measure is well defined as the conditioning set has positive probability. Similarly, we prove that the grand-canonical measure associated to (1.4) is the loop soup in .
Note that there is a bijection between and the set
[TABLE]
the space of finite cycle permutations with locally finite supports. Indeed, for any , let be given by and , . Conversely, given a spatial permutation in the set (2.24), define the loop soup configuration
[TABLE]
where is the size of the cycle in containing . Define the sets
[TABLE]
Canonical measures
The Gaussian loop soup restricted to loops contained in is defined by
[TABLE]
We now show that conditioned to have points in equals the spatial random permutation with density (1.4), that we denote .
Proposition 2.4** (Canonical measure and loop soup).**
For any measurable, bounded test function , we have
[TABLE]
Proof.
Since there is a bijection between the supports of these probability measures, it suffices to verify that the weights assigned by their densities to any given configuration satisfy a fixed ratio. Let be a spatial permutation such that and , where is the cardinality of . Let be the cycle decomposition of ; clearly . Then, by (2.23), the loop soup conditioned density of is
[TABLE]
where was defined in (2.20). On the other hand, the density (1.4) of the canonical measure can be written as a function of the cycle decomposition of by
[TABLE]
Since both (2.28) and (2.29) determine probability measures, the normalization factors must be the same. ∎
Grand-canonical measures
The grand-canonical spatial random permutation at fugacity if , or if , associated to the canonical density (1.4), is defined by
[TABLE]
where , and
[TABLE]
Elementary computations show that for in the specified domains. We next show the equivalence of the loop soup and the grand-canonical measure.
Proposition 2.5** (Grand canonical measure and loop soup).**
Let if , or if . The Gaussian loop soup at fugacity restricted to defined in (2.26) and the grand-canonical measure (2.30) at the same fugacity are equal,
[TABLE]
Proof.
By (2.30) and (2.31), the grand canonical measure is a mixture of canonical measures:
[TABLE]
By (2.27), the loop soup restricted to is also a mixture of canonical measures:
[TABLE]
The identity between (2.28) and (2.29) implies that
[TABLE]
We add over and apply (2.31) to get , so that the weights in (2.33) and (2.34) are equal. ∎
2.2 Point marginal of the Gaussian loop soup
In this subsection we study the law of the point marginal of the Gaussian loop soup. Let be the loop soup with distribution and denote the set of points in the support of :
[TABLE]
For , , define
[TABLE]
where . With and as in (2.12), defined in (1.6) satisfies .
Let be the distribution of a point process on and be a non-negative measurable function with compact support. Recall that \mathcal{L}(\phi):=\int\nu(d{\mathsf{X}})\exp\big{(}-\sum_{x\in{\mathsf{X}}}\phi(x)\big{)} is the Laplace functional of the point process with probability distribution . Denote
[TABLE]
Proposition 2.6** (Laplace functionals).**
Let if , or if . Let be a non-negative measurable function with compact support. Denote the Laplace functional of the point marginal of the Gaussian loop soup at fugacity . Then, if satisfies we have
[TABLE]
with the convention that and in the integrals over and , respectively, on the right of (2.39) and (2.40).
Proof.
Let , , so that we can write
[TABLE]
by Campbell’s theorem. Notice that is bounded and vanishing in the complement of defined in Proposition 2.2, if is such that the support , the ball of radius in . We saw in the proof of Proposition 2.2 that is finite, hence the integral in the exponent of (2.2) converges.
If then
[TABLE]
where means that the trace of the loop is a subset of the trace of : with , and there is a subsequence of such that .
Then
[TABLE]
In order to derive (2.44) we first fix the points , i.e. the arguments of the factors in (2.42), and integrate over the remaining points of those loops , such that . This leads to the sum over the family of indices and the product of transition kernels in the integral over \big{(}{\mathbb{R}}^{d}\big{)}^{j}. Note that the integral in (2.43) assigns density
[TABLE]
to an unrooted loop and a choice of indices , which is corrected by the factor in front to match the corresponding expression in (2.42). Now (2.39) follows by changing the order of the sum and the integral. This works if there is absolute convergence of the exponent in (2.39); using K_{\lambda}(x_{i},x_{i+1})\leq K_{\lambda}(0,0)=\sum_{k\geq 1}\bigl{(}\frac{\alpha}{\pi k}\bigr{)}^{\frac{d}{2}}\lambda^{k} and , we have the absolute convergence.
In order to prove (2.40), write
[TABLE]
where denotes the set of cycles of length ,
[TABLE]
the set of permutations of elements. We replace this expression in (2.44) and denote by the cardinality of , to get
[TABLE]
where in identity (2.45) we have used Lemma 2.8. This shows (2.40). ∎
Remark 2.7**.**
Identity (2.45) is used in quantum field theory and statistical mechanics to express the log of the partition function as a sum over connected graphs. We thank a referee for mentioning that a version of the identity is contained in Theorem II.1 of Flajolet and Sedgewick [15], a reference in combinatorics. For the convenience of the reader, we include an elementary proof in our next lemma. **
Lemma 2.8** (Combinatorial lemma).**
Let be such that . Then
[TABLE]
where is defined in (2.38) and stands for the cardinality of the set .
Proof.
By the series expansion of the exponential function
[TABLE]
which is the right hand side of (2.46). The interchange of and in the last line is justified by the absolute convergence of . ∎
2.2.1 Point correlations
Given a random point process on , a non-negative, measurable function \varphi:\big{(}{\mathbb{R}}^{d}\big{)}^{n}\to{\mathbb{R}} is the -point correlation density of , if for any collection of bounded, pairwise disjoint Borel sets ,
[TABLE]
Proposition 2.9** (Point correlations).**
The -point correlation density of is given by
[TABLE]
where is the permanent of the matrix .
Sketch of the proof.
We compute the -point correlation density. To simplify notation, in this proof we will denote , and . Given pairwise disjoint bounded Borel sets , the third moment measure for the point marginal over is given by
[TABLE]
To go from (2.49) to (2.50) we use that if is a Poisson process of loops, then (a) the expectation of the product of functions of different loops factorizes (Theorem 3.2 in [26]), and (b) , denoted , by Campbell’s theorem.
Define
[TABLE]
and compute
[TABLE]
where (2.53) follows from partitioning the set of cycles that go through according to the order in which they visit the points, and (2.54) can be proved using the argument applied to derive (2.39) from (2.42). Using the same argument to compute the other terms in (2.50), we conclude that the third moment measure (2.48) is absolutely continuous with respect to Lebesgue measure in with Radon-Nikodym derivative
[TABLE]
which proves (2.47) for ; see Fig. 4. We leave the proof of the general case to the reader. ∎
Remark 2.10**.**
A Cox process is a Poisson process with a random intensity measure [17]. Let and be independent, centered Gaussian fields with covariance \big{(}K_{\lambda}(x,y),\,x,y\in{\mathbb{R}}^{d}\big{)}. Using moment formulas for Gaussian random vectors it is not hard to show that a Cox process with intensity measure \bigl{(}\frac{1}{2}\Phi^{2}_{\lambda}(x)+\frac{1}{2}\Psi^{2}_{\lambda}(x)\bigr{)}\,dx is permanental with -point correlation function . This is a particular case of a general identification of -permanental point processes as Cox processes when is a positive integer, see e.g.[18], Chapter 14. In particular, since correlation densities identify this point process (see the proof of Proposition 5.1), this implies that the point marginal of the Gaussian loop soup is Cox, with (random) intensity measure \bigl{(}\frac{1}{2}\Phi^{2}_{\lambda}(x)+\frac{1}{2}\Psi^{2}_{\lambda}(x)\bigr{)}\,dx.
3 Gaussian random interlacements
In this section we construct a measure on the space of doubly infinite trajectories in , , analogous to the intensity measure of the Gaussian loop soup. We then define the Gaussian random interlacements as a Poisson process with an intensity measure proportional to this measure. We adapt the strategy developed by Sznitman [30] to introduce the model of random interlacements in . The intensity measure of the set of paths that intersect a bounded set is obtained as the projection of a measure supported on trajectories that visit at time [math] for the first time. Precisely, the location of the first visit to is distributed according to the equilibrium measure of the associated random walk, and from this location two independent random walk trajectories are drawn, with the one running up to time being conditioned to never return to . We here propose an alternative, equivalent measure that chooses the location of the trajectory at time [math] uniformly in , draws two independent random walk trajectories starting at , up to and times respectively, and assigns weight to the resulting doubly infinite path that is inversely proportional to its total number of visits to . In §3.1 we compute the density, Laplace functionals and point correlations of the point marginal of the Gaussian random interlacements.
For , define
[TABLE]
the space of discrete -valued doubly infinite trajectories that spend finite time in compact subsets of . Endow with the -algebra generated by the canonical coordinates , . Given a bounded set , let be the set of trajectories that enter ,
[TABLE]
and for define the entrance time of in by
[TABLE]
Notice that because by definition intersects at most finitely many times.
Define the time shift by , and let be the shift by time units, , . Given a function let .
Given let denote the probability measure on \big{(}{{\mathbb{W}}^{\operatorname{root}}},{\mathscr{W}}^{\operatorname{root}}\big{)} having finite dimensional distributions
[TABLE]
where is the Dirac distribution at , and is defined in (2.1). That is, is the law of a doubly infinite random walk in that satisfies and has independent, identically distributed Gaussian increments . The fact that the walk is transient implies . Denote by the expectation with respect to . Since the Lebesgue measure is reversible for the random walk, we have
[TABLE]
for bounded measurable test functions .
Consider the measure on , that integrates a test function as
[TABLE]
The function is the density of a measure on supported on called the equilibrium measure associated to the Gaussian random walk. The capacity of is defined by ; see [30]. The equilibrium measure satisfies
[TABLE]
where is defined in (1.6). To show (3.7), consider and write
[TABLE]
Define the measure on by
[TABLE]
where
[TABLE]
is the number of visits of the trajectory to . The weight assigns to a trajectory is inversely proportional to the number of visits of to the set .
Proposition 3.1**.**
For any bounded set and measurable bounded function invariant under time shifts, , we have
[TABLE]
Proof.
Write
[TABLE]
Lemma 3.2** (Compatibility and additivity).**
Let be Borel bounded sets of , and let be a test function that is invariant under time shifts, . Then
[TABLE]
where . The same holds for .
Proof.
Write . Then
[TABLE]
since . This proves (3.11). To get (3.12) write
[TABLE]
Since , and , Proposition 3.1 implies that (3.11) and (3.12) hold for as well. ∎
Now let us identify trajectories that differ by time shift: given two doubly-infinite trajectories , we say that if there exists such that . Let
[TABLE]
be the space of trajectories modulo time shift, the projection, and the push-forward -algebra on . Given let . If is shift invariant, then it can be extended to by , for any choice of representative .
Proposition 3.3** (Infinite volume measure).**
There exists a unique -finite measure on such that for each bounded set
[TABLE]
where and denote the push-forward measures.
Proof.
Let and define by . Then and
[TABLE]
by Proposition 3.1. This proves the second equality in (3.14).
Let be an increasing sequence of bounded sets such that . Then and uniqueness of the measure satisfying (3.14) follows. Define on by
[TABLE]
Let be a bounded set and take sufficiently large such that . Then
[TABLE]
where the last identity follows from (3.11). In the case when for some , (3.16) proves that the definition (3.15) is consistent and that the measure defined in (3.15) satisfies (3.14). By (3.14), , which proves the -finite property. ∎
For a trajectory , let for any , this is just the set of points in the trajectory . Recall is the number of points in . Denote by the space of locally finite interlacement configurations,
[TABLE]
Definition 3.4** (Gaussian random interlacements).**
Let and . The Gaussian random interlacement process at level is the Poisson point process on the space , with intensity measure . We will use to denote a configuration of the random interlacements at level , and to denote its law.
This definition is slightly simpler than the one proposed by Sznitman [30] in . The original definition considers a point process in the product space with intensity measure , so that each trajectory is sampled with an associated level used to couple realizations of the model at different densities. For our purposes it is enough to a priori fix the level .
3.1 Point marginal of the Gaussian random interlacements
We now study the point marginal of the random interlacements. Define the random point process
[TABLE]
Recall that denotes the number of points of a locally finite set of points in . The mean density of in is defined by
[TABLE]
Lemma 3.5** (Point density).**
For any bounded Borel set we have
[TABLE]
In particular the mean density does not depend on the set .
Proof.
To show (3.20), write
[TABLE]
To show (3.21), we compute the mean number of points of the process in as
[TABLE]
where the first identity follows from Campbell’s theorem and the second one by (3.20). ∎
We next compute the Laplace functionals of , denoted by
[TABLE]
To simplify notation, in the rest of this section we will write instead of , the kernel defined in (1.6).
Proposition 3.6** (Laplace functionals).**
Let be a measurable function with compact support and satisfying . Then
[TABLE]
with .
Proof.
Define by
[TABLE]
The definition does not depend on the choice of representative . Then,
[TABLE]
by Campbell’s theorem. Let which is compact by hypothesis. Then
[TABLE]
by Proposition 3.3. For , let us write
[TABLE]
The trajectory enters the support of finitely many times and the factor vanishes outside this set, hence the sum on the second line above may be restricted to finite sets to get the third line.
Let denote the product of copies of , . We replace the last expression from (3.1) in (3.26), and exchange the order of the sums and the integral, which is justified later, to obtain
[TABLE]
where the first term in expression (3.28) corresponds to and in the second term there is a change of variables . If we replace in the last expression by , we obtain a convergent series thanks to the condition . Thus we can apply the dominated convergence theorem to exchange the integral with infinite sums. The result follows by replacing the last expression in (3.25). ∎
3.1.1 Point correlations
Proposition 3.7** (Point correlations).**
The -point correlation density of the point process is given by
[TABLE]
where we recall that is the set of partitions of given in (2.38) and is the set of permutations of .
This result is a consequence of Proposition 3.6. A direct proof of (3.30) can be obtained as in the loop soup case, Proposition 2.9. For instance, for , taking distinct points in and denoting we have
[TABLE]
The terms in (3.31) are associated to the partition of the set of trajectories containing , illustrated in Fig. 5. For instance, the first term is the density of the event and belong to different trajectories in , while is the density of and are visited by one trajectory in in this or the reverse order, the factor 2 accounts for the two possible orders.
4 Infinite volume Gaussian random permutation
In this section we define the infinite volume Gaussian random permutation. In §4.1 we show that the Gaussian random permutation has a Markov property and in §4.2 that it is a Gibbs measure for the specification induced by (1.4). Let be defined by
[TABLE]
this is the space of superpositions of locally finite loop and interlacement configurations. A configuration is in bijection with the spatial permutation defined by
[TABLE]
We will abuse notation and use indistinctly and to refer to the spatial permutation.
Recall the definition of the critical density in (2.13), so that if . Define
[TABLE]
Given two independent processes and with laws and , we denote by
[TABLE]
the law of the superposition of the processes.
Definition 4.1**.**
The Gaussian random permutation in at density is defined by
[TABLE]
where the Gaussian loop soup and the Gaussian random interlacements are as in Definitions 2.3 and 3.4, respectively.
4.1 Markov property
We show that for all the Gaussian spatial permutation is Markov in the sense of Proposition 4.2.
We define the “inside” and “outside” components of a spatial permutation with respect to a bounded Borel set . Define the sets of points
[TABLE]
and the maps
[TABLE]
Colors and labels refer to Fig. 6. We have dropped from the notation the dependence on , the dependence on of the definition of and and the dependence on of the definition of and . Denote the inside and outside components of with respect to , and the boundary points, by
[TABLE]
In the next proposition we show that the law of the inside component of a random spatial permutation given its outside component is determined by the outside boundary points. Let be a bounded Borel set and call , and the -algebras generated by the maps , and , respectively.
Proposition 4.2** (Markov property).**
The Gaussian random permutation satisfies the following Markovian property: let be a bounded Borel set and be an measurable bounded function. Then
[TABLE]
Informally, the statement is: if we condition on the purple and yellow labeled points and the purple arrows of Fig. 6, then the law of the red points and red arrows is determined by the positions and labels of the yellow points.
Proof.
Recall that consists of the loops contained in , and is the set of trajectories intersecting . Call the set of loops that intersect both and , the boundary loops. We have the following partition:
[TABLE]
Let be a sample of . The intersection of with the above sets produces five independent Poisson processes. The loops contained in are independent of ; on the other hand, the loops contained in and the infinite trajectories not intersecting are independent of . The problem thus reduces to proving identity (4.15) for measurable with respect to {{\mathscr{F}}}_{{\mathtt{i}}\Lambda}\big{|}_{{\mathbb{B}}_{\Lambda}\cup{\mathbb{W}}_{\Lambda}}, the -algebra generated by the mapping restricted to .
Define the inside and outside components of by
[TABLE]
where and . In particular and . In Fig. 6 each element of is a red path from a point to a point, while the elements of are purple paths joining a point to a point and semi-infinite purple paths contained in starting at a point or ending at a point. Each path in the inside boundary contains at least one point in , so that . The outside boundary may contain a path with , so that in this case (see the upper in Fig. 6). There is no path when . Notice that for , , as does not have any loops or trajectories that do not intersect . On the other hand, differs from in that the former includes the boundary points of the loops and trajectories in .
We first prove the result for , that is the loop soup with fugacity and for . Given , denote
[TABLE]
where is the Gaussian density in (2.1). Recall the loop soup weight defined in (2.19) and observe that for , we have
[TABLE]
where denotes the cardinality of the set . By (2.23), if has finite intensity measure , when is determined by the loops of that belong to , we have
[TABLE]
Let now be {{\mathscr{F}}}_{{\mathtt{i}}\Lambda}\big{|}_{{\mathbb{B}}_{\Lambda}} measurable, and consider a bounded, {{\mathscr{F}}}_{{\mathtt{o}}\Lambda}\big{|}_{{\mathbb{B}}_{\Lambda}}-measurable function . With the lexicographic order in , by (4.24), we have
[TABLE]
where denotes the set of inside components of permutations with boundary conditions , and similarly is the set of outside components of permutations compatible with the boundary conditions , as in (2.25). For a bounded test function , the integral in (4.26) is defined as
[TABLE]
where the integral over inside paths from to is given by
[TABLE]
a bounded test function. Similarly,
[TABLE]
where the integration over outside paths from to is defined by
[TABLE]
From (4.26), with definitions (4.27)-(4.30), it is clear that
[TABLE]
and , are independent given , the Markov property.
We turn now to the supercritical case, that is, and . The Gaussian random permutation is the law of the superposition of independent realizations of the Gaussian loop soup at density (fugacity ) and the Gaussian random interlacements at density .
A trajectory enters for the first time from a point and visits for the last time before jumping to a point . More precisely,
[TABLE]
For each , denote by the piece of trajectory between and ,
[TABLE]
where is the number of points of between the first and the last visits to , in particular . Note that and belong to but intermediate points may not. By the definition of , the marginal weight of the piece of trajectory under is
[TABLE]
where was defined in (4.21), and , where was defined in (3.4). By definitions (4.17) and (4.18), are the red paths of joining yellow and/or green points in Fig. 7 and are the purple paths of between yellow/green points and the purple semi-infinite paths starting from green points.
Given the positions and labels of the points , the semi-infinite trajectories starting at or finishing at for are independent of , the piece of trajectory between these points, by the Markov property of the random walk. This and the properties of the Poisson processes imply that given the positions and labels of the points , those semi-infinite trajectories are independent of .
Given a spatial permutation , denote by , the boundary loops and , the pieces of interlacements intersecting . Using (4.23) and (4.34), the weight of these configurations under are given by
[TABLE]
An argument similar to (4.24)-(4.31) proves (4.15) for . ∎
4.2 Gibbs measures
We show here that is Gibbs for the specification associated to the canonical measure (1.4).
We first define the specification related to (1.4). Given a bounded Borel set we say that the spatial permutations and are -compatible, and write , if their outside components with respect to match, that is, if , see definition (4.10). Given a spatial permutation , define
[TABLE]
For , and if let G_{\Lambda,\lambda}\big{(}\cdot\big{|}({\mathsf{Y}},\kappa)\big{)} be the measure acting on bounded measurable test functions by
[TABLE]
where we recall that denotes the cardinality of . The partition function is
[TABLE]
For each , and if , the family of kernels bounded Borel set of is called the specification associated to the Hamiltonian at fugacity . The next result says that the Gaussian random permutation is Gibbs with respect to this specification.
Proposition 4.3** (Gibbs measures).**
For and if , the measure is Gibbs for the specification , that is, it satisfies the DLR equations
[TABLE]
Furthermore, if , for all the measure is Gibbs for the specification .
Proof.
When there are no external boundary points, that is when , the specification (4.37) equals the grand-canonical measure (2.30), which by Proposition 2.5 is the Gaussian loop soup at fugacity intersected with . When , the specification (4.37) factorizes as the product of the grand-canonical measure (2.30) and the distribution of crossings of . We conclude that the specification coincides with the conditional probabilities:
[TABLE]
where for , or and , and for and . ∎
Remark 4.4**.**
All supercritical measures , for are Gibbs for the same specification . The different point densities inside arise from the boundary conditions. Indeed, the number of paths crossing is equal to the cardinality of (or ). Part of those - points belong to loops of the critical loop soup, and have the same law for all supercritical densities. The contribution to the extra density is given by the - points belonging to infinite trajectories, whose number increases with . The mean number of points in from trajectories that connect - points arising from the random interlacements is .
Consider now a large box with volume . The trace left in by an interlacement trajectory that intersects this box typically comprises points. On the other hand, for supercritical densities , a macroscopic loop in the canonical measure with points in consists of points. The heuristic explanation for this discrepancy is that, in the conjectured thermodynamic limit, macroscopic cycles will become infinite cycles going through , and they will break up into several (infinitely many) random interlacement trajectories.
5 The point marginal and the boson point process
We show that the point marginal of the Gaussian random permutation coincides with the boson point process associated to the free Bose gas. Let be defined as in (4), and denote the point marginal of the Gaussian random permutation (4.5) by
[TABLE]
where and are defined in (2.36) and (3.18), respectively.
The boson point process
Subcritical and critical cases. In [33] Tamura and Ito show that the point process for the free Bose gas in at density if , and if , and fugacity , is the point process described by Theorem 1.2 in Shirai and Takahashi [27]. Its law, denoted , has Laplace functional given by
[TABLE]
where is a non-negative function with compact support, is the linear operator on with kernel
[TABLE]
and is the Fredholm determinant. They also show that the -point correlation functions of are given by
[TABLE]
Supercritical case. Bose-Einstein condensation occurs for the free Bose gas when and . In this case Tamura and Ito [32] describe the boson point process as the superposition of the process defined above with a process , with Laplace functional
[TABLE]
where is a non-negative function with compact support, is the operator defined in (5.2), and is the usual inner product in .
Summarizing, Tamura and Ito define the boson point process by
[TABLE]
Proposition 5.1** (Equivalence of point processes).**
For any we have
[TABLE]
where the processes are defined in (5.1) and (5.5), respectively.
Proof.
Subcritical and critical cases. By Proposition 2.9, and have the same -point correlation functions, . By a theorem of Lenard [24], the measures coincide if the correlation functions satisfy the following bounds
[TABLE]
Since under the conditions of the proposition, we have
[TABLE]
This satisfies (5.6). Alternatively, one can simply observe that the Laplace functional of provided by (2.39)-(2.40) coincides with the Laplace functional of , computed in Theorem 4.1 of [27].
Supercritical case. Let be a non-negative function with compact support with . This condition allows to expand and replace in (5.4) to obtain the Laplace functional computed in (3.23). ∎
Remark 5.2**.**
For and , Eisenbaum [10] proves that the supercritical boson point process is a Cox process with (random) intensity
[TABLE]
where and are independent, centered Gaussian fields with covariance \big{(}K_{1}(x,y),\,x,y\in{\mathbb{R}}^{d}\big{)}.
Remark 5.3**.**
In view of Remarks 2.10 and 5.2, by Campbell’s formula, given a bounded, compactly supported test function , we get
[TABLE]
Identities (5.8) and (5.9) may be interpreted as versions, for the boson point process, of the occupation times formulas derived by Le Jan [21] for the loop soup, and Sznitman [31] for the random interlacements.
6 Conclusions
We have shown that the Gaussian random permutation, consisting of the superposition of independent realizations of a Gaussian loop soup and a Gaussian random interlacements process, is Gibbs for the specification induced by the Feynman’s representation of the free Bose gas. The random interlacements are present only for point densities . We then used the fact that the two processes are independent Poisson processes to show that the point marginal of the Gaussian random permutation coincides with the boson point process, studied previously in the literature.
The interacting Bose gas proposed by Feynman [12] can be seen as a measure on the set of continuous trajectories , , where . The canonical measure associated to a pair interaction potential acts on a test function by
[TABLE]
where denotes the law of independent Brownian bridges such that and , for each , and the partition function is given in (1.3), see [34]. An example of interaction is the hard-core potential if , and zero otherwise.
The challenge is to construct a Gibbs measure in for the specification associated to . For the ideal Bose gas, , the Gibbs measure can be easily constructed from the spatial Gaussian permutation with law (4.5), by considering a collection of independent Brownian bridges \bigl{(}B^{x})_{x\in{\mathsf{X}}}, where is a Brownian bridge between and at time . The resulting measure is Gibbs for the specification associated to with . Concatenating the bridges, one obtains a Brownian loop soup where the duration of each loop is a multiple of , superposed in the supercritical case with a Brownian interlacement process. One may conjecture that there are pair potentials (say, bounded below and vanishing when exceeds some value ) such that there is a corresponding Gibbs measure for whose realizations are local perturbations of the realizations of .
7 Acknowledgments
We thank the referees for their comments and suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Araki and E. J. Woods, Representations of the canonical commutation relations describing a nonrelativistic infinite free Bose gas , J. Mathematical Phys. 4 (1963), 637–662. MR 0152295
- 2[2] Inés Armendáriz, Pablo A. Ferrari, Pablo Groisman, and Florencia Leonardi, Finite cycle Gibbs measures on permutations of ℤ d superscript ℤ 𝑑 {\mathbb{Z}}^{d} , J. Stat. Phys. 158 (2015), no. 6, 1213–1233. MR 3317411
- 3[3] Giuseppe Benfatto, Marzio Cassandro, I. Merola, and E. Presutti, Limit theorems for statistics of combinatorial partitions with applications to mean field Bose gas , J. Math. Phys. 46 (2005), no. 3, 033303, 38. MR 2125575
- 4[4] Volker Betz, Random permutations of a regular lattice , Journal of Statistical Physics 155 (2014), no. 6, 1222–1248.
- 5[5] Volker Betz and Daniel Ueltschi, Spatial random permutations and infinite cycles , Comm. Math. Phys. 285 (2009), no. 2, 469–501. MR 2461985
- 6[6] , Spatial random permutations and Poisson-Dirichlet law of cycle lengths , Electron. J. Probab. 16 (2011), no. 41, 1173–1192. MR 2820074
- 7[7] Marek Biskup and Thomas Richthammer, Gibbs measures on permutations over one-dimensional discrete point sets , Ann. Appl. Probab. 25 (2015), no. 2, 898–929. MR 3313758
- 8[8] Leonid V. Bogachev and Dirk Zeindler, Asymptotic statistics of cycles in surrogate-spatial permutations , Commun. Math. Phys. 334 (2015), no. 1, 39–116 (English).
