On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing

DOI10.1080/07474946.2011.619104zbMath1239.60073OpenAlexW2059457486WikidataQ60327833 ScholiaQ60327833MaRDI QIDQ3106540

B. John Oommen, Anis Yazidi, Ole-Christoffer Granmo

Publication date: 28 December 2011

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

Full work available at URL: https://doi.org/10.1080/07474946.2011.619104

zbMATH Keywords

random walk, Markov processsteady state, sequential change-point detection

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Ruin theory with compounding assets -- a survey
• Absorbing and Ergodic Discretized Two-Action Learning Automata
• On the Classical Ruin Problems

This page was built for publication: On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing