Coverage probabilities of edges in a regular graph by a random walk
<p>We investigate the probability that a random walk covers a given edge in a connected regular network. For a complete graph or a circle graph, we obtain an explicit expression of the coverage probability by using the walk generating function. Alternatively, for any fixed connected regular ne...
Main Author: | Choo, Z |
---|---|
Other Authors: | Reinert, G |
Format: | Thesis |
Language: | English |
Published: |
2014
|
Subjects: |
Similar Items
-
Problems in random walks in random environments
by: Buckley, SP
Published: (2011) -
Graph reconstruction and structure
by: Tan, J
Published: (2023) -
Cycles in edge-coloured graphs and subgraphs of random graphs
by: White, M
Published: (2011) -
Attributed Graph Embedding with Random Walk Regularization and Centrality-Based Attention
by: Yuxuan Yang, et al.
Published: (2023-04-01) -
Teaching of probability theory and combinatorics at secondary schools
by: Eugenijus Stankus
Published: (2004-12-01)