{"paper":{"title":"Mixing time of a kinetically constrained spin model on trees: power law scaling at criticality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"math.PR","authors_text":"Cristina Toninelli, Cyril Roberto, Fabio Martinelli, Nicoletta Cancrini","submitted_at":"2012-11-26T14:48:27Z","abstract_excerpt":"On the rooted $k$-ary tree we consider a 0-1 kinetically constrained spin model in which the occupancy variable at each node is re-sampled with rate one from the Bernoulli(p) measure iff all its children are empty. For this process the following picture was conjectured to hold. As long as $p$ is below the percolation threshold $p_c=1/k$ the process is ergodic with a finite relaxation time while, for $p>p_c$, the process on the infinite tree is no longer ergodic and the relaxation time on a finite regular sub-tree becomes exponentially large in the depth of the tree. At the critical point $p=p_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5974","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}