Cover times for sequences of random walks on random graphs

PIMS-MPrime Summer School in Probability

授课人:Yoshihiro Abe

机构:Pacific Institute for the Mathematical Sciences(PIMS)

关键词: Scientific;    Mathematics;    Probability;    Random Walk;    Random Graph;   

加拿大|英语

【 摘 要 】

We can classify cover times for sequences of random walks on random graphs into two types: One type is the class of cover times approximated by the maximal hitting times scaled by the logarithm of the size of vertex sets. The other type is the class of cover times approximated by the maximal hitting times. These types are characterized by the volume, effective resistances, and geometric properties of random graphs. We classify some examples, such as the supercritical Galton-Watson family trees and the incipient infinite cluster for the critical Galton-Watson family tree.

【 授权许可】

CC BY-NC-ND   
Except where explicitly noted elsewhere, the works on this site are licensed under a Creative Commons License: CC BY-NC-ND