A Markov chain approach to randomly grown graphs.
Knudsen, Michael, Wiuf, Carsten (2008)
Journal of Applied Mathematics
Similarity:
Knudsen, Michael, Wiuf, Carsten (2008)
Journal of Applied Mathematics
Similarity:
Hans C. Andersen, Persi Diaconis (2007)
Journal de la société française de statistique
Similarity:
We present a generalization of hit and run algorithms for Markov chain Monte Carlo problems that is ‘equivalent’ to data augmentation and auxiliary variables. These algorithms contain the Gibbs sampler and Swendsen-Wang block spin dynamics as special cases. The unification allows theorems, examples, and heuristics developed in one domain to illuminate parallel domains.
Bressaud, Xavier, Fernández, Roberto, Galves, Antonio (1999)
Electronic Journal of Probability [electronic only]
Similarity:
Guillotin, N. (1999)
Electronic Communications in Probability [electronic only]
Similarity:
Bernard Ycart (1999)
ESAIM: Probability and Statistics
Similarity:
Bandyopadhyay, Antar, Aldous, David J. (2001)
Electronic Communications in Probability [electronic only]
Similarity:
Mariusz Górajski (2009)
Annales UMCS, Mathematica
Similarity:
In this paper we consider an absorbing Markov chain with finite number of states. We focus especially on random walk on transient states. We present a graph reduction method and prove its validity. Using this method we build algorithms which allow us to determine the distribution of time to absorption, in particular we compute its moments and the probability of absorption. The main idea used in the proofs consists in observing a nondecreasing sequence of stopping times. Random walk on...
Roberts, Gareth O., Rosenthal, Jeffrey S. (1997)
Electronic Communications in Probability [electronic only]
Similarity:
Lovász, László, Winkler, Peter (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Galvin, David J. (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Persi Diaconis (2005)
Annales de l'I.H.P. Probabilités et statistiques
Similarity: