|
|||||
|
|
Expected cover times of random walks on symmetric graphs |
|
| Authors: | José Luis Palacios |
| Affiliation: | (1) Department of Mathematics, New Jersey Institute of Technology, 07102 Newark, New Jersey |
| Abstract: | We give very simple proofs for an (N–1)HN–1 lower bound and anN2 upper bound for the expected cover time of symmetric graphs. |
| Keywords: | Cover time symmetric graph |
| 本文献已被 SpringerLink 等数据库收录！ | |