How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph

Author： Propp J.G.   Wilson D.B.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.27, Iss.2, 1998-05, pp. : 170-217

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Large dicliques in a directed inhomogeneous random graph

By Shang Yilun  

International Journal of Computer Mathematics, Vol. 90, Iss. 3, 2013-03 ,pp. : 445-456

Taylor & Francis Ltd

Access to resources Recommend Favorite

Classroom note: Using Platonic bodies to generate a random sample from a population having two characteristics linked with a predetermined coefficient of correlation

By Pierre Gharghouri  

International Journal of Mathematical Education in Science and Technology, Vol. 35, Iss. 2, 2004-03 ,pp. : 281-285

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new bistatic model for electromagnetic scattering from perfectly conducting random surfaces

By Elfouhaily Tanos  

Waves in Random Media, Vol. 9, Iss. 3, 1999-07 ,pp. : 281-294

Taylor & Francis Ltd

Access to resources Recommend Favorite

Factorization Representations in the Boundary Crossing Problems for Random Walks on a Markov Chain

By Lotov V.   Orlova N.  

Siberian Mathematical Journal, Vol. 46, Iss. 4, 2005-07 ,pp. : 661-667

Springer Publishing Company

Access to resources Recommend Favorite

Firefighting on a random geometric graph

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. : 466-477

John Wiley & Sons Inc

Access to resources Recommend Favorite