Markov chain algorithms for generating sets uniformly at random

DOI10.26493/1855-3974.286.93AzbMath1341.68138OpenAlexW1956966334WikidataQ129355337 ScholiaQ129355337MaRDI QIDQ2925425

Alexandru I. Tomescu, Alberto Policriti

Publication date: 22 October 2014

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.286.93a

zbMATH Keywords

Markov chainrandom generationtransitive setextensional digraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Directed graphs (digraphs), tournaments (05C20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Random walks on graphs (05C81)

Related Items (1)

Is hyper-extensionality preservable under deletions of graph elements?

This page was built for publication: Markov chain algorithms for generating sets uniformly at random