soft local times
play

Soft local times Serguei Popov, Augusto Teixeira Serguei Popov, - PowerPoint PPT Presentation

Soft local times Serguei Popov, Augusto Teixeira Serguei Popov, Augusto Teixeira Soft local times we describe a method for simulating an adapted stochastic process on a general space by means of a Poisson point process on R + ;


  1. Soft local times Serguei Popov, Augusto Teixeira Serguei Popov, Augusto Teixeira Soft local times

  2. ◮ we describe a method for simulating an adapted stochastic process on a general space Σ by means of a Poisson point process on Σ × R + ; ◮ in particular, it is useful for constructing couplings of two processes, simply by using the same realization of the Poisson point process for both of them; ◮ with this coupling, one can study the range of a stochastic process (i.e., the set { X 1 , . . . , X n } ) Serguei Popov, Augusto Teixeira Soft local times

  3. Consider the space of Radon point measures on Σ × R + � � L = η = δ ( z λ , v λ ) ; z λ ∈ Σ , v λ ∈ R + λ ∈ Λ � and η ( K ) < ∞ for all compact K . One can now canonically construct a Poisson point process η on the space ( L , D , Q ) with intensity given by µ ⊗ dv , where dv is the Lebesgue measure on R + . Serguei Popov, Augusto Teixeira Soft local times

  4. Proposition � Let g : Σ → R + be a measurable function with g ( z ) µ ( dz ) = 1 . For η = � λ ∈ Λ δ ( z λ , v λ ) ∈ L, we define ξ = inf { t ≥ 0 ; there exists λ ∈ Λ such that tg ( z λ ) ≥ v λ } . Then under the law Q of the Poisson point process η , ◮ there exists a.s. a unique ˆ λ ∈ Λ such that ξ g ( z ˆ λ ) = v ˆ λ , ◮ ( z ˆ λ , ξ ) is distributed as g ( z ) µ ( dz ) ⊗ Exp ( 1 ) , ◮ η ′ := � λ δ ( z λ , v λ − ξ g ( z λ )) has the same law as η and is λ � =ˆ independent of ( ξ, ˆ λ ) . Serguei Popov, Augusto Teixeira Soft local times

  5. R + ( z λ , v λ ) G 2 ( z ) = ξ 1 g ( z 0 , z ) + ξ 2 g ( z 1 , z ) G 1 ( z ) = ξ 1 g ( z 0 , z ) z 1 z 2 Σ Figure: An example illustrating the definition of ξ and ˆ λ in the above Proposition. Observe that this construction can be iterated to obtain a realization of a stochastic process X (here, X 1 = z 1 , X 2 = z 2 ). The quantity G n is called the soft local time of the process X at time n . Serguei Popov, Augusto Teixeira Soft local times

  6. Assume that X , Y are two stochastic processes on the same space Σ , and we want to couple them in such a way that � � { X 1 , . . . , X T 1 } ⊂ { Y 1 , . . . , Y T 2 } ≥ 1 − ε, P where T 1 , 2 are some (random) moments. The above proposition provides a way to construct such a coupling. Let ˆ G be the soft local time for the process Y , and we construct both processes using the same realization of the Poisson process η . Then ≥ P [ G T 1 ≤ ˆ � � { X 1 , . . . , X T 1 } ⊂ { Y 1 , . . . , Y T 2 } G T 2 ] , P and the last probability can be estimated in some way. Serguei Popov, Augusto Teixeira Soft local times

  7. Applications: ◮ in [Popov-Teixeira, 2012] we used soft local times to obtain some decoupling ineuqalities for random interlacements ◮ in [Comets-Gallesco-Popov-Vachkovskaia, 2013], this method was used to obtain large deviation for cover times of the torus (in these two applications, the space Σ is a certain space of excursions of SRW) ◮ a similar method was used in an earlier paper by Tsirelson [EJP , 2006] to solve the following kind of problem: let X 1 , X 2 , X 3 , . . . be i.i.d.r.v. ∼ U [ 0 , 1 ] , and let g > 0 be a density on [ 0 , 1 ] . Construct (having additional randomness) a permutation σ such that Y 1 , Y 2 , Y 3 , . . . are i.i.d.r.v. with density g , where Y k = X σ ( k ) . (It is an open problem to do that without additional randomness.) Serguei Popov, Augusto Teixeira Soft local times

  8. R + X D 0 = x 0 A 1 X S 1 A ′ X 0 1 x 1 = X D 1 A ′ 2 A 2 Z 2 ξ 1 H A ( x 0 , · ) n X S 1 ∂A 1 ∂A 2 x 2 = X D 2 X S 2 X S 2 ξ 1 H A ( x 0 , · ) + ξ 2 H A ( x 1 , · ) X D 3 X S 3 X S 3 ξ 1 H A ( x 0 , · ) + ξ 2 H A ( x 1 , · ) + ξ 3 H A ( x 2 , · ) Figure: The construction of the excursions of the SRW on the torus. Serguei Popov, Augusto Teixeira Soft local times

Recommend


More recommend