We describe a Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0: up to random shifts, this process equals the two processes constructed froma Brownian bridge and a Brownian excursion by adding a drift and then taking the excursions over the current minimum. As a consequence, these three processes have the same occupation measure, which is easily found.
The three processes arise as limits, in three different ways, of profiles associated to hashing with linear probing, or, equivalently, to parking functions.
"A Vervaat-like path transformation for the reflected brownian bridge conditioned on its local time at 0." Ann. Probab. 29 (4) 1755 - 1779, October 2001. https://doi.org/10.1214/aop/1015345771