Pages that link to "Item:Q3136609"

The following pages link to Collisions Among Random Walks on a Graph (Q3136609):

Displaying 43 items.

• Exact mixing times for random walks on trees (Q354448) (← links)
• Lipschitz embeddings of random sequences (Q398782) (← links)
• Capturing the drunk robber on a graph (Q406701) (← links)
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents (Q633812) (← links)
• Random walks and flights over connected graphs and complex networks (Q718283) (← links)
• Exact computation for meeting times and infection times of random walks on graphs (Q740125) (← links)
• Efficient distributed computation of distance sketches in networks (Q748116) (← links)
• On the expected time for Herman's probabilistic self-stabilizing algorithm (Q817822) (← links)
• The infection time of graphs (Q858307) (← links)
• Collisions of random walks in reversible random graphs (Q894489) (← links)
• How to meet in anonymous network (Q930910) (← links)
• The hitting and cover times of random walks on finite graphs using local degree information (Q1001905) (← links)
• Collecting coupons on trees, and the cover time of random walks (Q1386177) (← links)
• Lipschitz embeddings of random fields (Q1626626) (← links)
• Some bounds for the Kirchhoff index of graphs (Q1724990) (← links)
• The maximum relaxation time of a random walk (Q1795486) (← links)
• Some remarks on cops and drunk robbers (Q1929226) (← links)
• Collisions of several walkers in recurrent random environments (Q1990223) (← links)
• Hitting time quasi-metric and its forest representation (Q2174870) (← links)
• The end time of SIS epidemics driven by random walks on edge-transitive graphs (Q2183153) (← links)
• Improved approximation of the minimum cover time (Q2566000) (← links)
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences (Q2799477) (← links)
• Hitting Times, Cover Cost, and the Wiener Index of a Tree (Q2978178) (← links)
• (Q3000065) (← links)
• Percolation of Words on <b>Z</b>^<i>d</i> with Long-Range Connections (Q3108481) (← links)
• Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time (Q3176187) (← links)
• Scheduling of Non-Colliding Random Walks (Q3297346) (← links)
• On a Form of Coordinate Percolation (Q3608341) (← links)
• An Algorithmic Theory of Mobile Agents (Q3608454) (← links)
• An Extension of Foster's Network Theorem (Q4314158) (← links)
• A tight upper bound on the cover time for random walks on graphs (Q4322474) (← links)
• Random walks on a complete graph: a model for infection (Q4660526) (← links)
• A tight lower bound on the cover time for random walks on graphs (Q4845080) (← links)
• Exit Frequency Matrices for Finite Markov Chains (Q4933599) (← links)
• Dependent percolation and colliding random walks (Q4943354) (← links)
• TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS (Q5076122) (← links)
• An Upper Bound on the Size of Avoidance Couplings (Q5222540) (← links)
• A Hitting Time Formula for the Discrete Green's Function (Q5366895) (← links)
• Monotonicity of Avoidance Coupling on <i>K_N</i> (Q5366931) (← links)
• Faster Treasure Hunt and Better Strongly Universal Exploration Sequences (Q5387786) (← links)
• Clairvoyant scheduling of random walks (Q5388970) (← links)
• Avoidance couplings on non‐complete graphs (Q6074647) (← links)
• Sampling random graph homomorphisms and applications to network data analysis (Q6586569) (← links)