Cover Image

Tipsy cop and tipsy robber: collisions of biased random walks on graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Harris, Pamela E., Insko, Erik, Lehner, Florian
Format:	Preprint
Published:	2022
Subjects:	Probability Combinatorics 05C05, 05C81
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal lower bound for the variance of hitting times for simple random walks on graphs
by: Chiclana, Rafael, et al.
Published: (2023)

On the jump of the cover time in random geometric graphs
by: Martinez, Carlos, et al.
Published: (2025)

Patrolling cop vs omniscient robber
by: Chiarelli, Nina, et al.
Published: (2026)

The capture time in the game of cops and many robbers
by: Gyergyek, Miha, et al.
Published: (2025)

The Exact Mixing Time for Trees with Fixed Diameter
by: Beveridge, Andrew, et al.
Published: (2024)

Mixing time of the random walk on the giant component of the random geometric graph
by: Haaland, Magnus H., et al.
Published: (2025)

Catching a robber on a random $k$-uniform hypergraph
by: Erde, Joshua, et al.
Published: (2023)

Traces left by random walks on large random graphs: local limits
by: Dereich, Steffen
Published: (2024)

Spectral properties of the stochastic block model and their application to hitting times of random walks
by: Löwe, Matthias, et al.
Published: (2024)

Star-collision in random hypergraphs
by: Adhikari, Kartick, et al.
Published: (2026)

A cop-robber game on metric graphs
by: Berend, Daniel, et al.
Published: (2025)

Mixing trichotomy for random walks on directed stochastic block models
by: Bianchi, Alessandra, et al.
Published: (2025)

Mixing cutoff for simple random walks on the Chung-Lu digraph
by: Bianchi, Alessandra, et al.
Published: (2024)

Node resistance curvature in Cartesian graph products
by: Dawkins, Aleyah, et al.
Published: (2024)

Nonconcentration of hitting times for random walks on graphs
by: Chiclana, Rafael
Published: (2026)

Full asymptotic expansion for orbit-summable quadrant walks and discrete polyharmonic functions
by: Nessmann, Andreas
Published: (2023)

Random cliques in random graphs revisited
by: Morris, Robert, et al.
Published: (2025)

A Nordhaus--Gaddum problem for the spectral gap of a graph
by: Kim, Sooyeong, et al.
Published: (2024)

The diameter of KPKVB random graphs
by: Müller, Tobias, et al.
Published: (2017)

Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)

State transfer in Grover walks on unitary and quadratic unitary Cayley graphs over finite commutative rings
by: Bhakta, Koushik, et al.
Published: (2025)

Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

First-order asymptotics for the structure of the inhomogeneous random graph
by: Bet, Gianmarco, et al.
Published: (2023)

Bivariate asymptotics via random walks: application to large genus maps
by: Price, Andrew Elvey, et al.
Published: (2025)

Random Walks and the Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

Random Walks and the Best Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

$d$-connectivity of the random graph with restricted budget
by: Lichev, Lyuben
Published: (2022)

The distribution of the length of the longest path in random acyclic orientations of a complete bipartite graph
by: Khera, Jessica, et al.
Published: (2024)

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

Dense and nondense limits for uniform random intersection graphs
by: Bassino, Frédérique, et al.
Published: (2024)

Star decompositions and independent sets in random regular graphs
by: Harangi, Viktor
Published: (2025)

Tripodal structure in undersaturated random graphs
by: DiCarlo, William, et al.
Published: (2025)

Random rotor walks and i.i.d. sandpiles on Sierpinski graphs
by: Kaiser, Robin, et al.
Published: (2022)

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
by: Sylvester, John
Published: (2021)

Sharp thresholds, hitting times and the power of choice for random geometric graphs
by: Ignasiak, Dawid, et al.
Published: (2025)

Perfect state transfer in Grover walks on dihedral Cayley graphs
by: Bhakta, Koushik, et al.
Published: (2026)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

Normal approximation for number of edges in random intersection graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)