Cutpoint Decoupling and First Passage Times for Random Walks on Graphs (Q4702233)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1368527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutpoint Decoupling and First Passage Times for Random Walks on Graphs |
scientific article; zbMATH DE number 1368527 |
Statements
Cutpoint Decoupling and First Passage Times for Random Walks on Graphs (English)
0 references
24 November 1999
0 references
Markov chains
0 references
first passage times
0 references
random walks
0 references
cutpoint graphs
0 references
connected, undirected graph
0 references
nearest-neighbour random walk
0 references
mean first passage matrix
0 references
divide-and-conquer approach
0 references
0.7445268630981445
0 references
0.742854654788971
0 references
0.7293470501899719
0 references
