• Home
  • Search
  • On systematic scan for sampling H‐colorings of the path
  • https://doi.org/10.1002/rsa.20243Copy DOI Icon

On systematic scan for sampling H‐colorings of the path

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Abstract We show that systematic scan for H‐colorings of the n‐vertex path mixes in O(log n) scans for any fixed H using block dynamics. For a restricted family of H we furthermore show that systematic scan mixes in O(log n) scans for any scan order. For completeness we show that a random update Markov chain mixes in O(nlog n) updates for any fixed H. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009

Similar Papers
  • Research Article

Random Walks, Directed Cycles and Markov Chains

  • Dec 07, 2022
  • The American Mathematical Monthly
  • Kate Gingell +1
  • Research Article
  • Citations71

Spectrum of large random reversible Markov chains: Heavy-tailed weights on the complete graph

  • Jun 10, 2010
  • The Annals of Probability
  • Charles Bordenave +2
  • Research Article
  • Citations36

On Barycentric Subdivision

  • Nov 24, 2010
  • Combinatorics, Probability and Computing
  • Persi Diaconis +1
  • Conference Article

The Mobility Models Affection on 5G MAC-protocol Simulation for Downlink Scheduler Efficiency

  • May 01, 2020
  • 2020 Ural Symposium on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT)
  • Ruslan Akhpashev +1
  • PDF
  • Research Article

On Geometric-type Approximations with Applications

  • Dec 07, 2024
  • Methodology and Computing in Applied Probability
  • Fraser Daly +1
  • Research Article
  • Citations14

Time-Dependent Energy and Resource Management in Mobility-Aware D2D-Empowered 5G Systems

  • Aug 01, 2017
  • IEEE Wireless Communications
  • Antonino Orsino +6
  • Preprint Article

Use of topographic LiDAR point clouds for building reconstruction

  • Jun 08, 2021
  • Yipeng Yuan
  • Preprint Article

Use of topographic LiDAR point clouds for building reconstruction

  • Jun 08, 2021
  • Yipeng Yuan
  • Research Article
  • Citations1

A down‐up chain with persistent labels on multifurcating trees

  • Oct 12, 2023
  • Random Structures & Algorithms
  • Frederik Sørensen
  • Research Article
  • Citations10

On the Hamiltonicity Gap and doubly stochastic matrices

  • Sep 10, 2008
  • Random Structures & Algorithms
  • Vivek S Borkar +2
  • Research Article
  • Citations19

Random sampling of 3‐colorings in ℤ2

  • Mar 01, 2004
  • Random Structures & Algorithms
  • Leslie Ann Goldberg +2
  • Research Article
  • Citations26

Random doubly stochastic tridiagonal matrices

  • Aug 03, 2012
  • Random Structures & Algorithms
  • Persi Diaconis +1
  • Research Article
  • Citations14

Very rapidly mixing Markov chains for 2?-colorings and for independent sets in a graph with maximum degree 4

  • Jan 01, 2001
  • Random Structures and Algorithms
  • Michael Molloy
  • Research Article
  • Citations174

Simple Markov-chain algorithms for generating bipartite graphs and tournaments

  • Jul 01, 1999
  • Random Structures and Algorithms
  • Ravi Kannan +2
  • Research Article
  • Citations466

The Elements of Stochastic Processes with Applications to the Natural Sciences.

  • Dec 01, 1965
  • Biometrika
  • D E Barton +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.