{"paper":{"title":"Accessibility percolation and first-passage site percolation on the unoriented binary hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.PR","authors_text":"Anders Martinsson","submitted_at":"2015-01-09T17:34:59Z","abstract_excerpt":"Inspired by biological evolution, we consider the following so-called accessibility percolation problem: The vertices of the unoriented $n$-dimensional binary hypercube are assigned independent $U(0, 1)$ weights, referred to as fitnesses. A path is considered accessible if fitnesses are strictly increasing along it. We prove that the probability that the global fitness maximum is accessible from the all zeroes vertex converges to $1-\\frac{1}{2}\\ln\\left(2+\\sqrt{5}\\right)$ as $n\\rightarrow\\infty$. Moreover, we prove that if one conditions on the location of the fitness maximum being $v$, then pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02206","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"}