# Accessibility percolation on n-trees

@article{Nowak2013AccessibilityPO,
title={Accessibility percolation on n-trees},
author={Stefan Nowak and Joachim H A Krug},
journal={arXiv: Statistical Mechanics},
year={2013}
}
• Published 6 February 2013
• Mathematics
• arXiv: Statistical Mechanics
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in ascending order. For the case when the random variables are independent and identically distributed, we derive an asymptotically exact expression for the probability that there is at least one accessible path from the root to the leaves in an $n$-tree. This…

## Figures from this paper

RMF accessibility percolation on oriented graphs
• Mathematics, Computer Science
• 2022
Values of c are determined for having RMF accessibility percolation on four families of graphs: the hypercube, the n-ary trees, the regular trees, and the two-dimensional lattices L and Lalt.
Accessibility percolation on random rooted labeled trees
• Mathematics, Computer Science
Journal of Applied Probability
• 2019
It is proved that (Zn, Cn) converges in distribution to a random vector whose probability generating function is given in an explicit form and it is obtained that the asymptotic distributions of Zn + 1 and Cn are geometric distributions with parameters e/(1 + e) and 1/e, respectively.
Accessibility Percolation with Crossing Valleys on n-ary Trees
• Mathematics
Journal of Statistical Physics
• 2019
In this paper, we study a variation of the accessibility percolation model. This work is also motivated by evolutionary biology and evolutionary computation. Consider a tree whose vertices are
Accessibility percolation with backsteps
• Mathematics
• 2014
It is shown that, in the large $L$ limit, the probability that an accessible path exists from an arbitrary starting point to the (random) fittest site is no more than 1-\frac12\sinh^{-1}(2) =0.27818\ldots and conjecture that this probability does converge to $x^*_{1/2}$.
Accessibility percolation and first-passage site percolation on the unoriented binary hypercube
It is proved 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$ and that, for any graph, accessibility percolation can equivalently be formulated in terms of first-passage site percolations.
Increasing paths in regular trees
• Mathematics, Computer Science
• 2013
If $\alpha = n/h$ is fixed and $\alpha > 1/e$, the probability there exists such a path converges to 1 as $h \to \infty$, which complements a previously known result that the probability converged to 0 if $\alpha \leq 1/ e$.
Accessibility Percolation on Cartesian Power Graphs
• Mathematics
• 2019
This work derives a lower bound on $\beta^\ast$ for general $A$ and conjecture that this bound is tight for a large class of allele graphs, and compares favorably to published numerical results for multiallelic Hamming graphs.
Phase Transition for Accessibility Percolation on Hypercubes
In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0, 1] random variables on vertices of a hypercube, and study whether there is a path connecting two
Increasing paths on N-ary trees
Consider a rooted $N$-ary tree. To every vertex of this tree, we attach an i.i.d. continuous random variable. A vertex is called accessible if along its ancestral line, the attached random variables

## References

SHOWING 1-10 OF 24 REFERENCES
On the existence of accessible paths in various models of fitness landscapes
• Mathematics
• 2014
The main results resolve open questions about three well-known mathematical models for genetic mutations, which in the biophysics literature are known as house of cards (HoC), constrained house of card (CHoC) and rough Mount Fuji (RMF).
Introduction to percolation theory
• Physics
• 1985
Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in
The Probabilistic Method
• Computer Science
SODA
• 1992
A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Applications of percolation theory
• Materials Science
• 1994
Connectivity as the Essential Physics of Disordered Systems Elements of Percolation Theory Characterization of Porous Media Earthquakes, and Fracture and Fault in Patterns in Heterogeneous Rock
Bachelor Thesis