Two recursive decompositions of Brownian bridge

Details Two recursive decompositions of Brownian bridge Two recursive decompositions of Brownian bridge

2004-02-25

arxiv.org/abs/math/0402399v1

Mathematics

Probability

35 pages, 1 figure

Scientific paper

Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to a reflecting Brownian bridge. Two different ways to encode a mapping as a walk lead to two different decompositions of the Brownian bridge, each defined by cutting the path of the bridge at an increasing sequence of recursively defined random times in the zero set of the bridge. The random mapping asymptotics entail some remarkable identities involving the random occupation measures of the bridge fragments defined by these decompositions. We derive various extensions of these identities for Brownian and Bessel bridges, and characterize the distributions of various path fragments involved, using the theory of Poisson processes of excursions for a self-similar Markov process whose zero set is the range of a stable subordinator of index between 0 and 1.

Affiliated with

Also associated with

No associations

Rating

Two recursive decompositions of Brownian bridge does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two recursive decompositions of Brownian bridge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two recursive decompositions of Brownian bridge will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484938