Geodesic
A Markov Chain Algorithm for determining Crossing Times through nested Graphs
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science (2008).

Voir la notice de l'article provenant de la source Episciences

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$. 
@article{DMTCS_2008_special_254_a33,
     author = {Freiberg, Uta and Th\"ale, Christoph},
     title = {A {Markov} {Chain} {Algorithm} for determining {Crossing} {Times} through nested {Graphs}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science},
     year = {2008},
     doi = {10.46298/dmtcs.3587},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3587/}
}
TY  - JOUR
AU  - Freiberg, Uta
AU  - Thäle, Christoph
TI  - A Markov Chain Algorithm for determining Crossing Times through nested Graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2008
VL  - DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3587/
DO  - 10.46298/dmtcs.3587
LA  - en
ID  - DMTCS_2008_special_254_a33
ER  - 
%0 Journal Article
%A Freiberg, Uta
%A Thäle, Christoph
%T A Markov Chain Algorithm for determining Crossing Times through nested Graphs
%J Discrete mathematics & theoretical computer science
%D 2008
%V DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3587/
%R 10.46298/dmtcs.3587
%G en
%F DMTCS_2008_special_254_a33
Freiberg, Uta; Thäle, Christoph. A Markov Chain Algorithm for determining Crossing Times through nested Graphs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science (2008). doi : 10.46298/dmtcs.3587. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3587/

Cité par Sources :