Maximally Reliable Markov Chains Under Energy Constraints

DOI10.1162/NECO.2009.08-08-843zbMATH Open1190.60067OpenAlexW2123316505WikidataQ38367949 ScholiaQ38367949MaRDI QIDQ3497607FDOQ3497607

Authors:

Publication date: 27 July 2009

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc3170776

Recommendations

• The optimal sink and the best source in a Markov chain
• Estimating the state of a noisy continuous time Markov chain when dynamic sampling is feasible
• On a Markov chain approach for the study of reliability structures
• Optimization problems in chemical reactions using continuous-time Markov chains
• Reliability approximation for Markov chain imbeddable systems

zbMATH Keywords

signal-to-noise ratiocoefficient of variationenergy drop

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) Neural biology (92C20) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• The time-rescaling theorem and its application to neural spike train data analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the First Passage Time Probability Problem
• Stability of discrete memory states to stochastic fluctuations in neuronal systems

This page was built for publication: Maximally Reliable Markov Chains Under Energy Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497607)