On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search

DOI10.1080/07474946.2018.1427971zbMath1390.82026OpenAlexW2791468725WikidataQ62835993 ScholiaQ62835993MaRDI QIDQ4639217

B. John Oommen, Anis Yazidi

Publication date: 3 May 2018

Published in: Sequential Analysis (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10642/6858

zbMATH Keywords

time reversibilitylearning systemsdichotomous searchcontrolled random walkrandom walk with jumps

Mathematics Subject Classification ID

Computational learning theory (68Q32) Trees (05C05) Learning and adaptive systems in artificial intelligence (68T05) Stochastic learning and adaptive control (93E35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Cites Work

• Unnamed Item
• Ruin theory with compounding assets -- a survey
• On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing
• Absorbing and Ergodic Discretized Two-Action Learning Automata
• Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata
• On the Classical Ruin Problems

This page was built for publication: On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search