A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs

Electronic Journal of Combinatorics - United States
doi 10.37236/721
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Electronic Journal of Combinatorics

Related search

The Switch Markov Chain for Sampling Irregular Graphs (Extended Abstract)

2014English

A Polynomial Bound for Untangling Geometric Planar Graphs

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2008English

On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems

2012English

New Classes of Degree Sequences With Fast Mixing Swap Markov Chain Sampling

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2017English

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Asymptotically Independent Markov Sampling: A New Markov Chain Monte Carlo Scheme for Bayesian Inference

International Journal for Uncertainty Quantification
ControlStatisticsProbabilityCombinatoricsSimulationOptimizationDiscrete MathematicsModeling
2013English

A Polynomial Delay Algorithm for the Enumeration of Bubbles With Length Constraints in Directed Graphs

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2015English

A Simple Introduction to Markov Chain Monte–Carlo Sampling

Psychonomic Bulletin and Review
DevelopmentalArtsEducational PsychologyCognitive PsychologyHumanitiesExperimental
2016English

A Browser for Directed Graphs

1984English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy