805 research outputs found
Moment asymptotics for multitype branching random walks in random environment
We study a discrete time multitype branching random walk on a finite space
with finite set of types. Particles follow a Markov chain on the spatial space
whereas offspring distributions are given by a random field that is fixed
throughout the evolution of the particles. Our main interest lies in the
averaged (annealed) expectation of the population size, and its long-time
asymptotics. We first derive, for fixed time, a formula for the expected
population size with fixed offspring distributions, which is reminiscent of a
Feynman-Kac formula. We choose Weibull-type distributions with parameter
for the upper tail of the mean number of type particles
produced by an type particle. We derive the first two terms of the
long-time asymptotics, which are written as two coupled variational formulas,
and interpret them in terms of the typical behavior of the system
Affinity and Fluctuations in a Mesoscopic Noria
We exhibit the invariance of cycle affinities in finite state Markov
processes under various natural probabilistic constructions, for instance under
conditioning and under a new combinatorial construction that we call ``drag and
drop''. We show that cycle affinities have a natural probabilistic meaning
related to first passage non-equilibrium fluctuation relations that we
establish.Comment: 30 pages, 1 figur
Functional limit theorems for random regular graphs
Consider d uniformly random permutation matrices on n labels. Consider the
sum of these matrices along with their transposes. The total can be interpreted
as the adjacency matrix of a random regular graph of degree 2d on n vertices.
We consider limit theorems for various combinatorial and analytical properties
of this graph (or the matrix) as n grows to infinity, either when d is kept
fixed or grows slowly with n. In a suitable weak convergence framework, we
prove that the (finite but growing in length) sequences of the number of short
cycles and of cyclically non-backtracking walks converge to distributional
limits. We estimate the total variation distance from the limit using Stein's
method. As an application of these results we derive limits of linear
functionals of the eigenvalues of the adjacency matrix. A key step in this
latter derivation is an extension of the Kahn-Szemer\'edi argument for
estimating the second largest eigenvalue for all values of d and n.Comment: Added Remark 27. 39 pages. To appear in Probability Theory and
Related Field
Asymptotic Feynman-Kac formulae for large symmetrised systems of random walks
We study large deviations principles for random processes on the
lattice with finite time horizon under a symmetrised
measure where all initial and terminal points are uniformly given by a random
permutation. That is, given a permutation of elements and a
vector of initial points we let the random processes
terminate in the points and then sum over
all possible permutations and initial points, weighted with an initial
distribution. There is a two-level random mechanism and we prove two-level
large deviations principles for the mean of empirical path measures, for the
mean of paths and for the mean of occupation local times under this symmetrised
measure. The symmetrised measure cannot be written as any product of single
random process distributions. We show a couple of important applications of
these results in quantum statistical mechanics using the Feynman-Kac formulae
representing traces of certain trace class operators. In particular we prove a
non-commutative Varadhan Lemma for quantum spin systems with Bose-Einstein
statistics and mean field interactions.
A special case of our large deviations principle for the mean of occupation
local times of simple random walks has the Donsker-Varadhan rate function
as the rate function for the limit but for finite time . We give an interpretation in quantum statistical mechanics for this
surprising result
- …