Add to ORKGA cladogram is a tree with labelled leaves and unlabelled degree-3 branchpoints. A certain Markov chain on the set of n-leaf cladograms consists of removing a random leaf (and its incident edge) and re-attaching it to a random edge. We show that the mixing time (time to approach the uniform stationary distribution) for this chain is at least O(n2) and at most O(n3)
Convergence of the marginal distribution of a Markov chain to its stationary distribution is an esse...
This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n ve...
The mixing time of a random walk, with or without backtracking, on a random graph generated accordin...
A graph G consists of a set of vertices connected in pairs by edges. Two vertices connected by an e...
AbstractMixing time quantifies the convergence speed of a Markov chain to the stationary distributio...
Markov Chain Monte Carlo algorithms are often used to sample combinatorial structures such as matchi...
Abstract. We develop Markov chain mixing time estimates for a class of Markov chains with restricted...
Suppose that G is a finite, connected graph and X is a lazy random walk on G . The lamplighter chain...
The focus of the thesis is the convergence of irreducible aperiodic homoge- neous Markov chains with...
We determine the mixing time (up to a constant factor) of the Markov chain whose state space consist...
Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is ...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
We characterize the extremal structures for mixing walks on trees that start from the most advantage...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
Convergence of the marginal distribution of a Markov chain to its stationary distribution is an esse...
This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n ve...
The mixing time of a random walk, with or without backtracking, on a random graph generated accordin...
A graph G consists of a set of vertices connected in pairs by edges. Two vertices connected by an e...
AbstractMixing time quantifies the convergence speed of a Markov chain to the stationary distributio...
Markov Chain Monte Carlo algorithms are often used to sample combinatorial structures such as matchi...
Abstract. We develop Markov chain mixing time estimates for a class of Markov chains with restricted...
Suppose that G is a finite, connected graph and X is a lazy random walk on G . The lamplighter chain...
The focus of the thesis is the convergence of irreducible aperiodic homoge- neous Markov chains with...
We determine the mixing time (up to a constant factor) of the Markov chain whose state space consist...
Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is ...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
We characterize the extremal structures for mixing walks on trees that start from the most advantage...
We define a new Markov chain on (proper) k-colourings of graphs, and relate its convergence properti...
Convergence of the marginal distribution of a Markov chain to its stationary distribution is an esse...
This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n ve...
The mixing time of a random walk, with or without backtracking, on a random graph generated accordin...