The number of accessible paths in the hypercube

DOI10.3150/14-BEJ641zbMath1341.60103arXiv1304.0246MaRDI QIDQ265261

Zhan Shi, Julien Berestycki, Éric Brunet

Publication date: 1 April 2016

Published in: Bernoulli (Search for Journal in Brave)

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

zbMATH Keywords

branching processespercolationtreesevolutionary biology

Mathematics Subject Classification ID

Problems related to evolution (92D15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (14)

Measuring epistasis in fitness landscapes: the correlation of fitness effects of mutations ⋮ On the existence of accessibility in a tree-indexed percolation model ⋮ Undirected polymers in random environment: path properties in the mean field limit ⋮ Universality classes of interaction structures for NK fitness landscapes ⋮ Accessibility percolation with crossing valleys on \(n\)-ary trees ⋮ Oriented first passage percolation in the mean field limit. II: The extremal process ⋮ Accessibility percolation on Cartesian power graphs ⋮ Stochastic individual-based models with power law mutation rate on a general finite trait space ⋮ Phase transition for accessibility percolation on hypercubes ⋮ Accessibility percolation on random rooted labeled trees ⋮ Galton-Watson processes in varying environment and accessibility percolation ⋮ From adaptive dynamics to adaptive walks ⋮ Accessibility percolation with backsteps ⋮ RMF accessibility percolation on oriented graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Increasing paths in regular trees
• A conditional limit theorem for the frontier of a branching Brownian motion
• A simple stochastic gene substitution model
• On the existence of accessible paths in various models of fitness landscapes
• Point-distinguishing chromatic index of the union of paths
• Accessibility percolation with backsteps
• A simple model for the balance between selection and mutation

This page was built for publication: The number of accessible paths in the hypercube