{
"id": "1703.06121",
"version": "v1",
"published": "2017-03-17T17:28:58.000Z",
"updated": "2017-03-17T17:28:58.000Z",
"title": "Mixing time of Markov chains for the uniform 1-2 model",
"authors": [
"Zhongyang Li"
],
"categories": [
"math.PR",
"math-ph",
"math.MP"
],
"abstract": "A 1-2 model configuration is a subgraph of the hexagonal lattice satisfying the constraint that each vertex is incident to 1 or 2 edges in the subgraph. We introduce Markov chains to sample the 1-2 model configurations on finite hexagonal graphs under the uniform probability measure, and prove that the mixing time of these chains is polynomial in the size of the graphs.",
"revisions": [
{
"version": "v1",
"updated": "2017-03-17T17:28:58.000Z"
}
],
"analyses": {
"keywords": [
"markov chains",
"mixing time",
"model configuration",
"finite hexagonal graphs",
"uniform probability measure"
],
"note": {
"typesetting": "TeX",
"pages": 0,
"language": "en",
"license": "arXiv",
"status": "editable"
}
}
}