A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/090758982
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Hitting Times for Random Walks on Vertex-Transitive Graphs

Mathematical Proceedings of the Cambridge Philosophical Society
Mathematics
1989English

Random Walks on Dynamical Percolation: Mixing Times, Mean Squared Displacement and Hitting Times

Probability Theory and Related Fields
UncertaintyStatisticsProbabilityAnalysis
2014English

Generalized Continuous-Time Random Walks, Subordination by Hitting Times, and Fractional Dynamics

Theory of Probability and its Applications
UncertaintyStatisticsProbability
2009English

Short Random Walks on Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1996English

Short Random Walks on Graphs

1993English

Random Walks on Diestel-Leader Graphs

Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
Mathematics
2001English

Random Walks on Infinite Graphs and Groups

2000English

Efficient Steiner Tree Construction Based on Spanning Graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2004English

Almost-Spanning Universality in Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy