SearcharxivSearch

arXiv · 2609.03968

A one-parameter family of local-time conditioned processes : the generalized Brownian burglars

Abstract

We construct and characterize the one-parameter family of real-valued processes that allow to recover the law of a Brownian loop-soup of any intensity on the real line conditionally on its occupation time field. These processes generalize the Brownian burglar constructed by Warren and Yor (that corresponds to our process in the limiting case where the intensity vanishes and there is just one Brownian motion). These processes are closely related to the Bass-Burdzy flow and recent work of A\"id\'ekon, Hu and Shi on the stochastic Jacobi flow. Our approach uses a formalism, building on the notion of driver processes, where one considers the evolving object to be the line that we ``stretch", instead of the burglar itself and its remaining occupation time. This leads to a characterization of these (generalized) Brownian burglars by simple natural axioms. It also allows to treat ``negative intensities'' and provides fairly direct derivations of several properties of the burglars, and in particular a ``target-independence/locality" property at the special intensity where the local time is the square of a Gaussian Free Field.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arthur Dremaux. 2026-09-03. A one-parameter family of local-time conditioned processes : the generalized Brownian burglars. https://arxiv.org/abs/2609.03968

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR