Random interlacements: the discontinuous case
Résumé
Random interlacements have been originally defined by Sznitman for continuous time simple reversible transient random walks on graphs. Among their features, they are necessary to write Dynkin type isomorphism theorems involving Gaussian free fields. Recently we have extended Sznitman's definition to continuous Markov processes in weak duality and established the connections between their random interlacements, quasi-processes and extended Markov processes. Here we relax the assumption of continuous paths and show that this connections remain valid.
Origine | Fichiers produits par l'(les) auteur(s) |
---|---|
Licence |