Random walks on edge coloured random graphs

DOI10.1016/J.DAM.2025.09.029MaRDI QIDQ6906699zbMATH OpenFDO

Authors Colin Cooper, Alan Frieze

Publication date 4 November 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.09.029

zbMATH Keywords

coloured edgescover timerandom graphs

Mathematics Subject Classification ID

Graph theory (05Cxx) Probability theory and stochastic processes (60-XX) Stochastic processes (60Gxx)

Cites work

• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Almost all cubic graphs are Hamiltonian
• Collective dynamics of `small-world' networks
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Random walks on weighted graphs and applications to on-line algorithms
• Stationary distribution and cover time of random walks on random digraphs
• The cover time of random geometric graphs
• The Cover Time of Random Regular Graphs
• The cover time of the giant component of a random graph
• The cover times of random walks on random uniform hypergraphs
• The Diameter of a Cycle Plus a Random Matching
• The oscillating random walk

This page was built for publication: Random walks on edge coloured random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906699)