Accessibility percolation is a new type of percolation problem inspired by evolutionary biology: a random number, called its fitness, is assigned to each vertex of a graph, then a path in the graph is accessible if fitnesses are strictly increasing through it. In the rough Mount Fuji (RMF) model, the fitness function is defined on the graph as ω(v)=η(v)+θ⋅d(v) , where θ is a positive number called the drift, d is the distance to the source of the graph and η(v) are i.i.d. random variables. In this paper, we determine values of θ for having RMF accessibility percolation on the hypercube and the two-dimensional lattices L2 and Lalt2 .
RMF accessibility percolation on oriented graphs
F. Duque,Daniel Ramirez-Gomez,Alejandro Rold'an-Correa,Leon A. Valencia
Published 2022 in Journal of Statistical Mechanics: Theory and Experiment
ABSTRACT
PUBLICATION RECORD
- Publication year
2022
- Venue
Journal of Statistical Mechanics: Theory and Experiment
- Publication date
2022-06-01
- Fields of study
Mathematics, Physics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-23 of 23 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1