How to Reduce Unnecessary Noise in Targeted Networks

DOI10.1007/978-3-540-68409-1_9zbMATH Open1154.91329OpenAlexW1012336912MaRDI QIDQ3606085FDOQ3606085

Authors: Giacomo Aletti, Diane Saada 

Publication date: 26 February 2009

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68409-1_9

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

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• 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 waiting time problems in a sequence of trinary trials
• Explicit distributional results in pattern formation
• Sooner and later waiting time problems for runs in Markov dependent bivariate trials
• Title not available (Why is that?)
• On some waiting time problems
• Stopping Markov processes and first path on graphs
• Cusum techniques for technical trading in financial markets

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)