Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence.
Corrie Jacobien CarstensPieter KleerPublished in: APPROX-RANDOM (2018)
Keyphrases
- markov chain
- bipartite graph
- monte carlo
- markov chain monte carlo
- steady state
- transition probabilities
- finite state
- maximum matching
- gibbs sampler
- random walk
- stochastic process
- state space
- stationary distribution
- random numbers
- markov model
- markov processes
- minimum weight
- transition matrix
- link prediction
- maximum cardinality
- markov process
- probabilistic automata
- bipartite graph matching
- confidence intervals
- probability distribution
- reinforcement learning