Pages that link to "Item:Q3820630"

The following pages link to Hitting times for random walks on vertex-transitive graphs (Q3820630):

Displaying 23 items.

• Random Lights Out processes on graphs (Q394801) (← links)
• Laplace eigenvalues of graphs---a survey (Q686298) (← links)
• Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance (Q820883) (← links)
• Random walks on highly symmetric graphs (Q923511) (← links)
• Intermediate range migration in the two-dimensional stepping stone model (Q988754) (← links)
• Random walks on edge transitive graphs (Q1382191) (← links)
• The expected hitting times for graphs with cutpoints. (Q1423039) (← links)
• Random walks on a finite graph with congestion points (Q1827003) (← links)
• Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
• The hitting times of random walks on bicyclic graphs (Q2053698) (← links)
• Some inequalities for reversible Markov chains and branching random walks via spectral optimization (Q2157453) (← links)
• A spectral characterization for concentration of the cover time (Q2209316) (← links)
• Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← links)
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications (Q2335795) (← links)
• Threshold limits for cover times (Q2638665) (← links)
• Stochastic forms of non-negative matrices and Perron-regularity (Q3186708) (← links)
• Continuous Time Markov Processes on Graphs (Q3423721) (← links)
• Hitting times for random walks on subdivision and triangulation graphs (Q4640054) (← links)
• Expected hitting times for random walks on quadrilateral graphs and their applications (Q4689926) (← links)
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters (Q4959293) (← links)
• The hitting time of random walk on unicyclic graphs (Q5858679) (← links)
• The varentropy criterion is sharp on expanders (Q6584608) (← links)
• A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees (Q6646407) (← links)