The entropy of Markov trajectories
From MaRDI portal
Publication:4307349
DOI10.1109/18.243461zbMath0802.60067MaRDI QIDQ4307349
Laura L. Ekroot, Thomas M. Cover
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.243461
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
94A17: Measures of information, entropy
60J99: Markov processes
Related Items
AN UPPER BOUND OF THE DIRECTIONAL ENTROPY WITH RESPECT TO THE MARKOV MEASURES, Randomized Shortest-Path Problems: Two Related Models, A sum-over-paths extension of edit distances accounting for all sequence alignments, Velocity formulae between entropy and hitting time for Markov chains, Ranking nodes according to their path-complexity, A symbolic dynamics approach to epileptic chronnectomics: employing strings to predict crisis onset, Different closed-form expressions for generalized entropy rates of Markov chains, Design of biased random walks on a graph with application to collaborative recommendation