A Markov Chain Algorithm for determining Crossing Times through nested Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2008

A Markov Chain Algorithm for determining Crossing Times through nested Graphs

Résumé

According to the by now established theory developed in order to define a Laplacian or ― equivalently ― a Brownian motion on a nested fractal, one has to solve certain renormalization problems. In this paper, we present a Markov chain algorithm solving the problem for certain classes of simple fractals $K$ provided that there exists a unique Brownian motion and hence, a unique Laplacian on $K$.
Fichier principal
Vignette du fichier
dmAI0134.pdf (494.59 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01194670 , version 1 (07-09-2015)

Identifiants

Citer

Uta Freiberg, Christoph Thäle. A Markov Chain Algorithm for determining Crossing Times through nested Graphs. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.501-518, ⟨10.46298/dmtcs.3587⟩. ⟨hal-01194670⟩

Collections

TDS-MACS
85 Consultations
1222 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More