Add to ORKGThe edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham in [CG12]. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study its spectral properties to show a lower bound for the rate of convergence in the case of regular graphs. Moreover, we show that a cutoff occurs at \frac{1}{4} n \log n for the edge flipping on the complete graph by a coupling argument.Comment: 17 pages. A correction in the proof of Lemma 3.3 and minor revision
We establish and generalise several bounds for various random walk quantities including the mixing t...
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on ...
Abstract. The cutoff phenomenon describes a sharp transition in the convergence of a family of ergod...
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called -Flipper, and showed that...
We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbias...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
The mixing time of a random walk, with or without backtracking, on a random graph generated accordin...
We investigate the mixing rate of a Markov chain where a combination of long distance edges and non-...
Abstract. We develop Markov chain mixing time estimates for a class of Markov chains with restricted...
AbstractIn this paper we investigate certain random processes on graphs which are related to the so-...
We consider random walks on graph colourings of an n-vertex graph. It has been shown by Jerrum and b...
This paper considers non-backtracking random walks on random graphs generated according to the confi...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
Many of the early results in studying mixing times were derived by geometric methods. These include ...
How many times do you have to shuffle a deck of n cards before it is close to random? log n? n? n^3?...
We establish and generalise several bounds for various random walk quantities including the mixing t...
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on ...
Abstract. The cutoff phenomenon describes a sharp transition in the convergence of a family of ergod...
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called -Flipper, and showed that...
We give the first polynomial upper bound on the mixing time of the edge-flip Markov chain for unbias...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
The mixing time of a random walk, with or without backtracking, on a random graph generated accordin...
We investigate the mixing rate of a Markov chain where a combination of long distance edges and non-...
Abstract. We develop Markov chain mixing time estimates for a class of Markov chains with restricted...
AbstractIn this paper we investigate certain random processes on graphs which are related to the so-...
We consider random walks on graph colourings of an n-vertex graph. It has been shown by Jerrum and b...
This paper considers non-backtracking random walks on random graphs generated according to the confi...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
Many of the early results in studying mixing times were derived by geometric methods. These include ...
How many times do you have to shuffle a deck of n cards before it is close to random? log n? n? n^3?...
We establish and generalise several bounds for various random walk quantities including the mixing t...
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on ...
Abstract. The cutoff phenomenon describes a sharp transition in the convergence of a family of ergod...