How to Reduce Unnecessary Noise in Targeted Networks
From MaRDI portal
Publication:3606085
Recommendations
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- scientific article; zbMATH DE number 1263183
- Exact mixing in an unknown Markov chain
- The behavior of a Markov network with respect to an absorbing class: the target algorithm
- Stopping Markov processes and first path on graphs
Cites work
- scientific article; zbMATH DE number 1212031 (Why is no real title available?)
- scientific article; zbMATH DE number 862533 (Why is no real title available?)
- Cusum techniques for technical trading in financial markets
- Explicit distributional results in pattern formation
- On some waiting time problems
- Probability distribution functions of succession quotas in the case of Markov dependent trials
- Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
- Sooner and later waiting time problems for runs in Markov dependent bivariate trials
- Sooner waiting time problems in a sequence of trinary trials
- Stopping Markov processes and first path on graphs
This page was built for publication: How to Reduce Unnecessary Noise in Targeted Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606085)