A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0
type: Item
instance of: scholarly article
title: A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0
zbMATH Open document ID: 1032.60076
author: Philippe Chassaing
author: Svante Janson
published in: The Annals of Probability
publication date: 2003-05-06T00:00:00Z
review text: Let \(b\) be a Brownian bridge, extended to a process with period \(1\), indexed by \(t\in {\mathbb R}\), \(e\) be the positive normalized Brownian excursion, \(X_{a}\) be \(|b|\) conditioned to have local time at \(0\) equal to \(a\), \(Y_{a}=\Psi_{a} b\), \(Z_{a}=\Psi_{a} e\), where \((\Psi_{a}f)(t)= \sup_{s\leq t}(f(t)-f(s)-a(t-s))\). For a process \(X\), \(T(X)\) is the inverse of the local time \(L(X)\) at \(0\) of \(X\). Let \(U\) be uniform on \([0,1]\). Results: \(Z_{a}(U+\cdot)\) is identical in law with \(Y_{a}\) if \(U\) is independent of \(Z_{a}\) and the same replacing \(Z_{a}\) by \(X_{a}\). For \(a>0\), \(X_{a}\) is identical in law to \(Z_{a}(\cdot +T_{aU}(Z_{a}))\) if \(U\) is independent of \(Z_{a}\) and the same replacing (everywhere) \(Z_{a}\) by \(Y_{a}\). If \(a>0\), then \(L_{t}(X_{a})\) reaches its maximum at a unique \(V\in [0,1)\) and \(X_{a}(V+\cdot)\) is identical in law with \(Z_{a}\) and the same replacing (everywhere) \(X_{a}\) by \(Y_{a}\); the \(V\) for \(Y_{a}\) is uniform on \([0,1]\) and independent of \(Y_{a}(V+\cdot)\). We have \(b(t)= Y_{a}(t)-Y_{a}(0)-L_{t}(Y_{a})+at\) and \(e(t)=Z_{a}(t)-L_{t}(Z_{a})+at\). The Vervaat results are the first two for \(a=0\). Proofs are given in the paper; they rely upon a concept of ``parking scheme'': Consider \(1,\dots ,n\) written in a circular order and \(\omega_{1},\dots ,\omega_{m}\) among them, the \(i\)th car parks in the first place in \(\omega_{i},\omega_{i}+1,\dots \) which is empty after the previous parked. Among the results involving such schemes we mention those related to the uniform distribution, convergence in law to \(Y_{a}\) of a process constructed from random schemes using the numbers of cars which tried to park in \(k\). In the final section the possibility of other ``shifts'' relating \(X_{a}\), \(Y_{a}\), \(Z_{a}\) is discussed and the following corollary is mentioned: let \(\varrho\) be uniform on \([0,1]\), independent of \(X_{a}\), let \(d\),\(g\) denote the first \(…
Mathematics Subject Classification ID: 60J65
Mathematics Subject Classification ID: 60J55
zbMATH DE Number: 1906039
zbMATH Keywords: Vervaat path transformation
zbMATH Keywords: parking scheme
zbMATH Keywords: weak convergence of processes
zbMATH Keywords: local time
zbMATH Keywords: occupation measure
reviewed by: Ion Cuculescu
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aop/1015345771
OpenAlex ID: W1583867612
cites work: Hashing with Linear Probing under Nonuniform Probabilities
cites work: The continuum random tree. I
cites work: Brownian excursions, critical random graphs and the multiplicative coalescent
cites work: Brownian excursion conditioned on its local time
cites work: Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
cites work: Brownian bridge asymptotics for random mappings
cites work: The standard additive coalescent
cites work: A fragmentation process connected to Brownian motion
cites work: Clustering statistics for sticky particles with Brownian initial velocity
cites work: Q4290908
cites work: Relations entre pont et excursion du mouvement brownien réel. (Relations between bridge and excursion of real Brownian motion)
cites work: Q5560061
cites work: Phase transition for Parking blocks, Brownian excursion and coalescence
cites work: Parking functions, empirical processes, and the width of rooted labeled trees
cites work: Functionals of Brownian meander and Brownian excursion
cites work: Construction of Markovian coalescents
cites work: On the analysis of linear probing hashing
cites work: Q4344097
cites work: Linear probing and graphs
cites work: Q3742402
cites work: An Occupancy Discipline and Applications
cites work: The Asymptotic Distribution of Maximum Tree Size in a Random Forest
cites work: Q4217631
cites work: Size-biased sampling of Poisson point processes and excursions
cites work: The SDE solved by local times of a Brownian excursion or bridge derived from the height profile of a random tree or forest
cites work: A polytope related to empirical distributions, plane trees, parking functions, and the associahedron
cites work: Arcsine Laws and Interval Partitions Derived from a Stable Subordinator
cites work: Q4226355
cites work: Q4328337
cites work: Enumerating graphs and Brownian motion
cites work: Parking functions and noncrossing partitions
cites work: Q4400939
cites work: A relation between Brownian bridge and Brownian excursion
DOI: 10.1214/AOP/1015345771
description: scientific article; zbMATH DE number 1906039