arXiv subjects

Titus Lupu

Publications and source records attributed to Titus Lupu.

28 records · Page 2Linked to original sources

arXiv2019

Fine mesh limit of the VRJP in dimension one and Bass-Burdzy flow

We introduce a continuous space limit of the Vertex Reinforced Jump Process (VRJP) in dimension one, which we call Linearly Reinforced Motion (LRM) on $\R$. It is constructed out of a convergent Bass-Burdzy flow. The proof goes through the representation of the VRJP as a mixture of Markov jump processes. As a by-product this gives a representation in terms of a mixture of diffusions of the LRM and of the Bass-Burdzy flow itself. We also show that our continuous space limit can be obtained out of the Edge Reinforced Random Walk (ERRW), since the ERRW and the VRJP are known to be closely related. Compared to the discrete space processes, the LRM has an additional symmetry in the initial local times (initial occupation profile): changing them amounts to a deterministic change of the space and time scales.

math.PR↗

arXiv2019

First passage sets of the 2D continuum Gaussian free field

We introduce the first passage set (FPS) of constant level $-a$ of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the boundary by a path on which the GFF does not go below $-a$. It is, thus, the two-dimensional analogue of the first hitting time of $-a$ by a one-dimensional Brownian motion. We provide an axiomatic characterization of the FPS, a continuum construction using level lines, and study its properties: it is a fractal set of zero Lebesgue measure and Minkowski dimension 2 that is coupled with the GFF $Φ$ as a local set $A$ so that $Φ+a$ restricted to $A$ is a positive measure. One of the highlights of this paper is identifying this measure as a Minkowski content measure in the non-integer gauge $r \mapsto \vert\log(r)\vert^{1/2}r^{2}$, by using Gaussian multiplicative chaos theory.

math.PR↗

arXiv2019

Inverting the coupling of the signed Gausssian free field with a loop soup

Lupu introduced a coupling between a random walk loop-soup and a Gaussian free field, where the sign of the field is constant on each cluster of loops. This coupling is a signed version of isomorphism theorems relating the square of the GFF to the occupation field of Markovian trajectories. His construction starts with a loop-soup, and by adding additional randomness samples a GFF out of it. In this article we provide the inverse construction: starting from a signed free field and using a self-interacting random walk related to this field, we construct a random walk loop-soup. Our construction relies on the previous work by Sabot and Tarrès, which inverts the coupling from the square of the GFF rather than the signed GFF itself. As a consequence, we also deduce an inversion of the coupling between the random current and the FK-Ising random cluster models introduced by Lupu and Werner.

math.PR↗

arXiv2019

Poisson ensembles of loops of one-dimensional diffusions

We study the analogue of Poisson ensembles of Markov loops ('loop soups') in the setting of one-dimensional diffusions. We give a detailed description of the corresponding intensity measure. The properties of this measure on loops lead us to an extension of Vervaat's bridge-to-excursion transformation that relates the bridges conditioned by their minimum and the excursions of all the diffusion we consider and not just the Brownian motion. Further we describe the Poisson point process of loops, their occupation fields and explain how to sample these Poisson ensembles of loops using two-dimensional Markov processes. Finally we introduce a couple of interwoven determinantal point processes on the line which is a dual through Wilson's algorithm of Poisson ensembles of loops and study the properties of these determinantal point processes.

math.PR↗

arXiv2018

The first passage sets of the 2D Gaussian free field: convergence and isomorphisms

In a previous article, we introduced the first passage set (FPS) of constant level $-a$ of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the boundary by a path along which the GFF is greater than or equal to $-a$. This description can be taken as a definition of the FPS for the metric graph GFF, and it justifies the analogy with the first hitting time of $-a$ by a one-dimensional Brownian motion. In the current article, we prove that the metric graph FPS converges towards the continuum FPS in the Hausdorff metric. This allows us to show that the FPS of the continuum GFF can be represented as a union of clusters of Brownian excursions and Brownian loops, and to prove that Brownian loop soup clusters admit a non-trivial Minkowski content in the gauge $r\mapsto |\log r|^{1/2}r^2$. We also show that certain natural interfaces of the metric graph GFF converge to SLE$_4$ processes.

math.PR↗

arXiv2017

The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph

We further investigate properties of the Gaussian free field (GFF) on the metric graph associated to a discrete weighted graph (where the edges of the latter are replaced by continuous line-segments of appropriate length) that has been introduced by the first author. On such a metric graph, the GFF is a random continuous function that generalises one-dimensional Brownian bridges so that one-dimensional techniques can be used. In the present paper, we define and study the pseudo-metric defined on the metric graph (and therefore also on the discrete graph itself), where the length of a path on the metric graph is defined to be the local time at level zero accumulated by the Gaussian free field along this path. We first derive a pathwise transformation that relates the GFF on the metric graph with the reflected GFF on the metric graph via the pseudo-distance defined by the latter. This is a generalisation of Paul Lévy's result relating the local time at zero of Brownian motion to the supremum of another Brownian motion. We also compute explicitly the distribution of certain functionals of this pseudo-metric and of the GFF. In particular, we point out that when the boundary consists of just two points, the law of the pseudo-distance between them depends solely on the resistance of the network between them. We then discuss questions related to the scaling limit of this pseudo-metric in the two-dimensional case, which should be the conformally invariant way to measure distances between CLE(4) loops introduced and studied by the second author with Wu, and by Sheffield, Watson and Wu. Our explicit laws on metric graphs also lead to new conjectures for related functionals of the continuum GFF on fairly general Riemann surfaces.

math.PR↗

arXiv2016

Loop percolation on discrete half-plane

We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of percolation at intensity 1/2 was shown in a previous work. We also show that in the supercritical regime, one can keep only the loops up to some large enough upper bound on the diameter and still have percolation.

math.PR↗

arXiv2015

A note on Ising random currents, Ising-FK, loop-soups and the Gaussian free field

We make a few elementary observations that relate directly the items mentioned in the title. In particular, we note that when one superimposes the random current model related to the Ising model with an independent Bernoulli percolation model with well-chosen weights, one obtains exactly the FK-percolation (or random cluster model) associated with the Ising model. We also point out that this relation can be interpreted via loop-soups, combining the description of the sign of a Gaussian Free Field on a discrete graph knowing its square (and the relation of this question with the FK-Ising model) with the loop-soup interpretation of the random current model.

math.PR↗

arXiv2015

The Vervaat transform of Brownian bridges and Brownian motion

For a continuous function $f \in \mathcal{C}([0,1])$, define the Vervaat transform $V(f)(t):=f(τ(f)+t \mod1)+f(1)1_{\{t+τ(f) \geq 1\}}-f(τ(f))$, where $τ(f)$ corresponds to the first time at which the minimum of $f$ is attained. Motivated by recent study of quantile transforms of random walks and Brownian motion, we investigate the Vervaat transform of Brownian motion and Brownian bridges with arbitrary endpoints. When the two endpoints of the bridge are not the same, the Vervaat transform is not Markovian. We describe its distribution by path decomposition and study its semi-martingale property. The same study is done for the Vervaat transform of unconditioned Brownian motion, the expectation and variance of which are also derived.

math.PR↗

arXiv2013

Some points on Vervaat's transform of Brownian bridges and Brownian motion

In a recent work J. Pitman and W. Tang defined the Vervaat's transform for a Brownian bridge with two different endpoints and for a Brownian motion between times $0$ and $1$. They proved some path decomposition properties for these Vervaat's transforms and raised open questions on their semi-martingale decomposition. In this paper we give an alternative proof for the path decomposition and answer the open questions.

math.PR↗