Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling

DOI10.1109/TIT.2012.2204032zbMath1364.90170arXiv1008.0227OpenAlexW2052547976MaRDI QIDQ2989744

No author found.

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.0227

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (11)

Stability and delay of distributed scheduling algorithms for networks of conflicting queues ⋮ Mixing time for the repeated balls into bins dynamics ⋮ Delay performance in random-access networks ⋮ Lingering issues in distributed scheduling ⋮ A new distributed approximation algorithm for the maximum weight independent set problem ⋮ Independent-set reconfiguration thresholds of hereditary graph classes ⋮ Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues ⋮ Queues with random back-offs ⋮ Temporal starvation in multi-channel CSMA networks: an analytical framework ⋮ Effective Wireless Scheduling via Hypergraph Sketches ⋮ Crossover times in bipartite networks with activity constraints and time-varying switching rates

This page was built for publication: Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling