Accessibility percolation on n-trees
From MaRDI portal
Publication:6239414
DOI10.1209/0295-5075/101/66004arXiv1302.1423MaRDI QIDQ6239414FDOQ6239414
Publication date: 6 February 2013
Abstract: 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 -tree. This probability tends to 1 (0) if the branching number is increased with the height of the tree faster (slower) than linearly. When the random variables are biased such that the mean value increases linearly with the distance from the root, a percolation threshold emerges at a finite value of the bias.
This page was built for publication: Accessibility percolation on n-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239414)
