The following pages link to Andrew Beveridge (Q409395):
Displaying 25 items.
- On the mixing time of geographical threshold graphs (Q409397) (← links)
- The best mixing time for random walks on trees (Q503614) (← links)
- Game chromatic index of graphs with given restrictions on degrees (Q954995) (← links)
- Random minimum length spanning trees in regular graphs (Q1288911) (← links)
- De Finetti lattices and magog triangles (Q2227838) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- The voter basis and the admissibility of tree characters (Q2665833) (← links)
- Visibility Number of Directed Graphs (Q2870514) (← links)
- Connectivity of Random Cubic Sum Graphs (Q3008015) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment (Q3449119) (← links)
- The Sorting Hat Goes to College (Q3454165) (← links)
- (Q3517158) (← links)
- Memoryless Rules for Achlioptas Processes (Q3563955) (← links)
- (Q4242911) (← links)
- Pursuit-evasion in a two-dimensional domain (Q4597492) (← links)
- Exit Frequency Matrices for Finite Markov Chains (Q4933599) (← links)
- Network of Thrones (Q4961366) (← links)
- Line-of-Sight Pursuit in Monotone and Scallop Polygons (Q5149564) (← links)
- Centers for Random Walks on Trees (Q5189518) (← links)
- Maker‐breaker games on random geometric graphs (Q5256385) (← links)
- Product rule wins a competitive game (Q5295085) (← links)
- A Hitting Time Formula for the Discrete Green's Function (Q5366895) (← links)
- On the minimum order of k-cop-win graphs (Q5499961) (← links)
- The Exact Mixing Time for Trees of Fixed Order and Diameter (Q6752748) (← links)
