# A Markov Chain Algorithm for determining Crossing Times through nested Graphs

Abstract : 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$.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [15 references]

https://hal.inria.fr/hal-01194670
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, September 7, 2015 - 12:50:53 PM
Last modification on : Monday, November 29, 2021 - 3:39:01 PM
Long-term archiving on: : Tuesday, December 8, 2015 - 12:54:45 PM

### File

dmAI0134.pdf
Publisher files allowed on an open archive

### Citation

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⟩

Record views