Phase transition in random adaptive walks on correlated fitness landscapes
We study biological evolution on a random fitness landscape where correlations are introduced through a linear fitness gradient of strength $c$. When selection is strong and mutations rare the dynamics is a directed uphill walk that terminates at a local fitness maximum. We analytically calculate the dependence of the walk length on the genome size $L$. When the distribution of the random fitness component has an exponential tail we find a phase transition of the walk length $D$ between a phase at small $c$ where walks are short $(D \sim \ln L)$ and a phase at large $c$ where walks are long $(D \sim L)$. For all other distributions only a single phase exists for any $c > 0$. The considered process is equivalent to a zero temperature Metropolis dynamics for the random energy model in an external magnetic field, thus also providing insight into the aging dynamics of spin glasses.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies
Message-passing architectures struggle to sufficiently model long-range dependencies in node and graph prediction tasks. We propose a novel approach exploiting hierarchical graph structures and adaptive random walks to a…
Dual-Phase Playtime-guided Recommendation: Interest Intensity Exploration and Multimodal Random Walks
The explosive growth of the video game industry has created an urgent need for recommendation systems that can scale with expanding catalogs and maintain user engagement. While prior work has explored accuracy and divers…
Recommendation SystemsSemantic SimilarityEvolutionary Image Transition and Painting Using Random Walks
We present a study demonstrating how random walk algorithms can be used for evolutionary image transition. We design different mutation operators based on uniform and biased random walks and study how their combination w…
TPM: Transition Probability Matrix -- Graph Structural Feature based Embedding
In this work, Transition Probability Matrix (TPM) is proposed as a new method for extracting the features of nodes in the graph. The proposed method uses random walks to capture the connectivity structure of a node's clo…
Link PredictionNode ClassificationTowards Exploiting Implicit Human Feedback for Improving RDF2vec Embeddings
RDF2vec is a technique for creating vector space embeddings from an RDF knowledge graph, i.e., representing each entity in the graph as a vector. It first creates sequences of nodes by performing random walks on the grap…