Random interlacements have been originally defined by Sznitman to study the torus disconnection problem of the simple random walk on \(\mathbb {Z}^d\) ( \(d\geq 3)\) . Later, Sznitman wrote Dynkin-type isomorphism theorems connecting random interlacements to Gaussian free fields. These theorems have been then used to handle questions related to Gaussian free fields. The notion of random interlacements has not been used to study Markov processes other than simple random walks or Brownian motions. The first obstacle is the lack of a general appropriate definition. Recently with Kaspi, we have extended Sznitman’s definition to continuous Markov processes in weak duality. We exploited this definition to extend Sznitman’s isomorphism theorem and to relate random interlacements to quasi-processes. The aim of this note is to relax the assumption of continuous paths and set a proper definition of random interlacements for standard processes. Once this obstacle suppressed, one can in particular enunciate Sznitman’s isomorphism theorem in this general framework.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Random Interlacements: The Discontinuous Case

  • Nathalie Eisenbaum

摘要

Random interlacements have been originally defined by Sznitman to study the torus disconnection problem of the simple random walk on \(\mathbb {Z}^d\) ( \(d\geq 3)\) . Later, Sznitman wrote Dynkin-type isomorphism theorems connecting random interlacements to Gaussian free fields. These theorems have been then used to handle questions related to Gaussian free fields. The notion of random interlacements has not been used to study Markov processes other than simple random walks or Brownian motions. The first obstacle is the lack of a general appropriate definition. Recently with Kaspi, we have extended Sznitman’s definition to continuous Markov processes in weak duality. We exploited this definition to extend Sznitman’s isomorphism theorem and to relate random interlacements to quasi-processes. The aim of this note is to relax the assumption of continuous paths and set a proper definition of random interlacements for standard processes. Once this obstacle suppressed, one can in particular enunciate Sznitman’s isomorphism theorem in this general framework.