Metric Construction, Stopping Times and Path Coupling

Simple item page
dc.creatorBordewich, Magnus
dc.creatorDyer, Martin
dc.creatorKarpinski, Marek
dc.date2005-11-08
dc.date2005-11-22
dc.date.accessioned2026-07-07T06:50:58Z
dc.date.available2026-07-07T06:50:58Z
dc.descriptionIn this paper we examine the importance of the choice of metric in path coupling, and the relationship of this to \emph{stopping time analysis}. We give strong evidence that stopping time analysis is no more powerful than standard path coupling. In particular, we prove a stronger theorem for path coupling with stopping times, using a metric which allows us to restrict analysis to standard one-step path coupling. This approach provides insight for the design of non-standard metrics giving improvements in the analysis of specific problems. We give illustrative applications to hypergraph independent sets and SAT instances, hypergraph colourings and colourings of bipartite graphs.
dc.description21 pages, revised version includes statement and proof of general stopping times theorem (section 2.2), and additonal remarks in section 6
dc.identifierhttps://arxiv.org/abs/math/0511202
dc.identifierhttp://arxiv.org/abs/math/0511202
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104836
dc.subjectProbability
dc.subject60J10; 60C05
dc.titleMetric Construction, Stopping Times and Path Coupling
dc.typetext

Files

Collections

arXiv