Markov chains on graphs and Brownian motion (Q5939312): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1011119932045 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2229216477 / rank | |||
Normal rank |
Latest revision as of 11:17, 30 July 2024
scientific article; zbMATH DE number 1625596
Language | Label | Description | Also known as |
---|---|---|---|
English | Markov chains on graphs and Brownian motion |
scientific article; zbMATH DE number 1625596 |
Statements
Markov chains on graphs and Brownian motion (English)
0 references
15 September 2002
0 references
The authors formulate the model of a symmetric random walk with fixed step length along the edges of a graph, combined with a natural probabilistic rule for jumping over a vertex and choosing there a new edge (which can be the old one) for continuation of the walk. Then they show that by rescaling time and space (as in the classical random walk) and letting the step length tend to zero there is weak convergence to Brownian motion on the edges of the graph, the particle (loosely speaking) on arrival at a vertex choosing with equal probabilities each of the edges meeting there for continuation.
0 references
random walk on graphs
0 references
Brownian motion
0 references
invariance principle
0 references