A Metropolis-type optimization algorithm on the infinite tree

DOI10.1007/PL00009231zbMath0936.68118OpenAlexW1978619590MaRDI QIDQ1277371

David J. Aldous

Publication date: 22 April 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009231

zbMATH Keywords

greedy algorithmrandom walkMetropolis algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

Search cost for a nearly optimal path in a binary tree ⋮ Asymptotics for the survival probability in a killed branching random walk ⋮ Total progeny in killed branching random walk ⋮ A survey of max-type recursive distributional equations ⋮ Performance of the Metropolis algorithm on a disordered tree: the Einstein relation ⋮ Genetic algorithms in random environments: two examples