Search arXivSearch

arXiv · math/0603702

Large deviations for many Brownian bridges with symmetrised initial-terminal condition

Abstract

Consider a large system of $N$ Brownian motions in $\mathbb{R}^d$ with some non-degenerate initial measure on some fixed time interval $[0,β]$ with symmetrised initial-terminal condition. That is, for any $i$, the terminal location of the $i$-th motion is affixed to the initial point of the $σ(i)$-th motion, where $σ$ is a uniformly distributed random permutation of $1,...,N$. Such systems play an important role in quantum physics in the description of Boson systems at positive temperature $1/β$. In this paper, we describe the large-N behaviour of the empirical path measure (the mean of the Dirac measures in the $N$ paths) and of the mean of the normalised occupation measures of the $N$ motions in terms of large deviations principles. The rate functions are given as variational formulas involving certain entropies and Fenchel-Legendre transforms. Consequences are drawn for asymptotic independence statements and laws of large numbers. In the special case related to quantum physics, our rate function for the occupation measures turns out to be equal to the well-known Donsker-Varadhan rate function for the occupation measures of one motion in the limit of diverging time. This enables us to prove a simple formula for the large-N asymptotic of the symmetrised trace of ${\rm e}^{-β\mathcal{H}_N}$, where $\mathcal{H}_N$ is an $N$-particle Hamilton operator in a trap.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefan Adams, Wolfgang König. 2006-03-30. Large deviations for many Brownian bridges with symmetrised initial-terminal condition. https://arxiv.org/abs/math/0603702

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR