Inverting Ray-Knight identity

  title={Inverting Ray-Knight identity},
  author={Christophe Sabot and Pierre Tarres},
  journal={Probability Theory and Related Fields},
  • C. Sabot, P. Tarres
  • Published 26 November 2013
  • Mathematics
  • Probability Theory and Related Fields
We provide a short proof of the Ray-Knight second generalized Theorem, using a martingale which can be seen (on the positive quadrant) as the Radon–Nikodym derivative of the reversed vertex-reinforced jump process measure with respect to the Markov jump process with the same conductances. Next we show that a variant of this process provides an inversion of that Ray-Knight identity. We give a similar result for the Ray-Knight first generalized Theorem. 

Inverting the Ray-Knight identity on the line

Using a divergent Bass-Burdzy flow we construct a self-repelling one-dimensional diffusion. Heuristically, it can be interpreted as a solution to an SDE with a singular drift involving a derivative

A Ray-Knight Theorem for Spectrally Positive Stable Processes

We generalize a classical second Ray-Knight theorem to spectrally positive stable processes. It is shown that the local time processes are solutions of certain stochastic Volterra equations driven by

Inverting Ray-Knight identities on trees

In this paper, we first introduce the Ray-Knight identity and percolation Ray-Knight identity related to loop soup with intensity α(≥ 0) on trees. Then we present the inversions of the above


We introduce a new exponential family of probability distributions, which can be viewed as a multivariate generalization of the inverse Gaussian distribution. Considered as the potential of a random

The Vertex Reinforced Jump Process and a Random Schr\"odinger operator on finite graphs

We introduce a new exponential family of probability distributions, which can be viewed as a multivariate generalization of the Inverse Gaussian distribution. Considered as the potential of a random

An isomorphism theorem for Ginzburg-Landau interface models and scaling limits

We introduce a natural measure on bi-infinite random walk trajectories evolving in a time-dependent environment driven by the Langevin dynamics associated to a gradient Gibbs measure with convex


We show that supersymmetric (susy) hyperbolic isomorphism theorems that relate Vertex Reinforced Jump Processes and H field, introduced in [2] and [3], are annealed version of isomorphism theorems

Speed of Vertex-Reinforced Jump Process on Galton–Watson Trees

We give an alternative proof of the fact that the vertex-reinforced jump process on Galton–Watson tree has a phase transition between recurrence and transience as a function of $$c$$c, the initial

Covariant Symanzik identities

Classical isomorphism theorems due to Dynkin, Eisenbaum, Le Jan, and Sznitman establish equalities between the correlation functions or distributions of occupation times of random paths or ensembles

Convergence of vertex-reinforced jump processes to an extension of the supersymmetric hyperbolic nonlinear sigma model

In this paper, we define an extension of the supersymmetric hyperbolic nonlinear sigma model introduced by Zirnbauer. We show that it arises as a weak joint limit of a time-changed version introduced



An isomorphism theorem for random interlacements

We consider continuous-time random interlacements on a transient weighted graph. We prove an identity in law relating the field of occupation times of random interlacements at level u to the Gaussian

Edge-reinforced random walk, vertex-reinforced jump process and the supersymmetric hyperbolic sigma model

Edge-reinforced random walk (ERRW), introduced by Coppersmith and Diaconis in 1986, is a random process that takes values in the vertex set of a graph G, which is more likely to cross edges it has

A Ray-Knight theorem for symmetric Markov processes

Let X be a strongly symmetric recurrent Markov process with state space S and let L t x denote the local time of X at x ∈ S. For a fixed element 0 in the state space S, let τ(t):= inf{s: L s 0 > t}


We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for

Continuous-time vertex reinforced jump processes on Galton-Watson trees

We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with

Limit theorems for vertex-reinforced jump processes on regular trees

Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly $b$ children, with $b \geq 3$. We prove the strong law of large numbers and the central limit

Random interlacements and the Gaussian free field

We consider continuous time random interlacements on Zd, d≥3, and characterize the distribution of the corresponding stationary random field of occupation times. When d=3, we relate this random field

Vertex-reinforced jump processes on trees and finite graphs

We study the continuous time process on the vertices of the b-ary tree which jumps to each nearest neighbor vertex at the rate of the time already spent at that vertex times δ, plus 1, where δ is a

Random walks and a sojourn density process of Brownian motion

The sojourn times for the Brownian motion process in 1 dimension have often been investigated by considering the distribution of the length of time spent in a fixed set during a fixed time interval.

Continuous time vertex-reinforced jump processes

Abstract. We study the continuous time integer valued process , which jumps to each of its two nearest neighbors at the rate of one plus the total time the process has previously spent at that