<?xml version="1.0"?>
<!-- name="generator" content="blosxom/2.0" -->
<!DOCTYPE rss PUBLIC "-//Netscape Communications//DTD RSS 0.91//EN" "http://my.netscape.com/publish/formats/rss-0.91.dtd">

<rss version="0.91">
  <channel>
    <title>Notebooks   </title>
    <link>http://bactra.org/notebooks</link>
    <description>Cosma's Notebooks</description>
    <language>en</language>

  <item>
    <title>Markov Models</title>
    <link>http://bactra.org/notebooks/2012/03/26#markov</link>
    <description>

&lt;P&gt;Markov processes are my life.  Which means I don't have time to explain
them.  Even as a pile of pointers, this is more inadequate than usual.

&lt;P&gt;Topics of particular interest: statistical inference for Markov models;
statistical inference for hidden Markov
models; &lt;a href=&quot;model-selection.html&quot;&gt;model selection&lt;/a&gt; for Markov models
and HMMs; Markovian representation results, i.e., ways of representing
non-Markovian processes as functions of Markov processes.
&lt;a href=&quot;ergodic-theory.html&quot;&gt;Ergodic&lt;/a&gt; and
&lt;a href=&quot;large-deviations.html&quot;&gt;large-deviations&lt;/a&gt; results.  (Ergodic theory
for Markov processes gets &lt;a href=&quot;ergodic-markov.html&quot;&gt;notebook&lt;/a&gt;.)  Markov
random fields.  Abstractions of the usual Markov property,
i.e., &lt;a href=&quot;graphical-models.html&quot;&gt;graphical models&lt;/a&gt;.  Relationship
between Markov properties and &lt;a href=&quot;sufficient-statistics.html&quot;&gt;statistical
sufficiency&lt;/a&gt;, i.e., if I construct a minimal predictive sufficient statistic
for some process, is that statistic always Markovian?  (I believe the answer is
&quot;yes&quot;; but as Wolfgang Loehr pointed out to me, it is false without the
restriction to &lt;em&gt;minimal&lt;/em&gt; sufficient statistics.)  Differential-equation
approximations of Markov processes and vice versa are covered
under &lt;a href=&quot;convergence-of-stochastic-processes.html&quot;&gt;convergence of
stochastic processes&lt;/a&gt;.



&lt;P&gt;See also:
	&lt;a href=&quot;convergence-of-stochastic-processes.html&quot;&gt;convergence of stochastic processes&lt;/a&gt;;
	&lt;a href=&quot;ergodic-markov.html&quot;&gt;ergodic theory of Markov and related
processes&lt;/a&gt;;
	&lt;a href=&quot;filtering.html&quot;&gt;filtering and state estimation&lt;/a&gt;;
	&lt;a href=&quot;interacting-particle-systems.html&quot;&gt;interacting particle
systems&lt;/a&gt;;
	&lt;a href=&quot;inference-markov.html&quot;&gt;inference for Markov and hidden
Markov models&lt;/a&gt;;
	&lt;a href=&quot;monte-carlo.html&quot;&gt;Monte Carlo&lt;/a&gt;;
	&lt;a href=&quot;stoch-diff-eqs.html&quot;&gt;stochastic differential equations&lt;/a&gt;

&lt;ul&gt;Recommended (more general):
	&lt;li&gt;Pierre Br&amp;eacute;maud, &lt;cite&gt;Markov Chains: Gibbs Fields, Monte
Carlo Simulation, and Queues&lt;/cite&gt;
	&lt;li&gt;J. Doob, &lt;cite&gt;Stochastic Processes&lt;/cite&gt; [&lt;a href=&quot;../weblog/algae-2006-02.html#doob&quot;&gt;comments&lt;/a&gt;]
	&lt;li&gt;Andrew M. Fraser, &lt;cite&gt;Hidden Markov Models and Dynamical
Systems&lt;/cite&gt; [Review: &lt;a href=&quot;../reviews/fraser-on-HMMs/&quot;&gt;Statistics of
Moving Shadows&lt;/a&gt;]
	&lt;li&gt;Grimmett and Stirzaker, &lt;cite&gt;Probability and Random
Processes&lt;/cite&gt;
	&lt;li&gt;Andrzej Lasota and Michael C. Mackey, &lt;cite&gt;Chaos, Fractals, and
Noise: Stochastic Aspects of Dynamics&lt;/cite&gt; [Really, an excellent textbook on
Markov operators, particularly those arising
from &lt;a href=&quot;chaos.html&quot;&gt;deterministic dynamical systems&lt;/a&gt;.]
	&lt;li&gt;Lawrence R. Rabiner, &quot;A Tutorial on Hidden Markov Models and
Selected Applications in Speech
Recognition&quot;, &lt;a href=&quot;http://dx.doi.org/10.1109/5.18626&quot;&gt;&lt;cite&gt;Proceedings of
the IEEE&lt;/cite&gt; &lt;strong&gt;77&lt;/strong&gt; (1989): 257--286&lt;/a&gt;
	&lt;/ul&gt;

&lt;ul&gt;Recommended (more specialized):
	&lt;li&gt;M. Abel, K. H. Andersen and G. Lacorata, &quot;Hierarchical Markovian
modeling of multi-time scale systems&quot;, &lt;a
href=&quot;http://arxiv.org/abs/nlin.CD/0201027&quot;&gt;nlin.CD/0201027&lt;/a&gt;
	&lt;li&gt;Hirotugu Akaike, &quot;Markovian representation of stochastic processes and its application to the analysis of autoregressive moving average processes&quot;,
&lt;cite&gt;Annals of the Institute of Statistical
Mathematics&lt;/cite&gt; &lt;strong&gt;26&lt;/strong&gt; (1974): 363--387 [Reprinted on
pp. 223--247 of Akaike's &lt;cite&gt;Selected Papers&lt;/cite&gt;; thanks to Victor Solo
for alerting me to this paper]
	&lt;li&gt;Gely P. Basharin, &lt;a
href=&quot;http://www4.ncsu.edu:8030/~anlangvi/&quot;&gt;Amy N. Langville&lt;/a&gt; and Valeriy A.
Naumov, &quot;The Life and Work of A. A. Markov&quot;, &lt;cite&gt;Linear Algebra and its
Applications&lt;/cite&gt; &lt;strong&gt;386&lt;/strong&gt; (2004): 3--26 [&lt;a
href=&quot;http://decision.csl.uiuc.edu/~meyn/pages/Markov-Work-and-life.pdf&quot;&gt;Online
PDF&lt;/a&gt;.  Includes a very nice discussion of Markov's original, elegant proof
of the weak law of large numbers for his chains.]
	&lt;li&gt;M. J. Beal, Z. Ghahramani and C. E. Rasmussen, &quot;The Infinite Hidden
Markov Model&quot;, in &lt;cite&gt;NIPS 14&lt;/cite&gt; [&lt;a
href=&quot;http://www.gatsby.ucl.ac.uk/~edward/pub/iHMM.abs.html&quot;&gt;link&lt;/a&gt;]
	&lt;li&gt;Patrick Billingsley, &lt;cite&gt;Statistical Inference for Markov Chains&lt;/cite&gt;
	&lt;li&gt;David Blackwell and Lambert Koopmans, &quot;On the Identifiability Problem
for Functions of Finite Markov Chains&quot;, &lt;a href=&quot;http://projecteuclid.org/euclid.aoms/1177706802&quot;&gt;&lt;cite&gt;Annals of Mathematical
Statistics&lt;/cite&gt; &lt;strong&gt;28&lt;/strong&gt; (1957): 1011--1015&lt;/a&gt;
	&lt;li&gt;Robert J. Elliott, Lakhdar Aggoun and John B. Moore, &lt;cite&gt;Hidden
Markov Models: Estimation and Control&lt;/cite&gt;
	&lt;li&gt;Stewart N. Ethier and Thomas G. Kurtz, &lt;cite&gt;Markov Processes:
Characterization and Convergence&lt;/cite&gt; [&lt;a href=&quot;../weblog/algae-2006-02.html#ethier-and-kurtz&quot;&gt;comments&lt;/a&gt;]
	&lt;li&gt;Roberto Fern&amp;aacute;ndez and Gr&amp;eacute;gory Maillard, &quot;Chains with Complete Connections: General Theory, Uniqueness, Loss of Memory and Mixing Properties&quot;, &lt;a href=&quot;http://dx.doi.org/10.1007/s10955-004-8821-5&quot;&gt;&lt;cite&gt;Journal of Statistical Physics&lt;/cite&gt; &lt;strong&gt;118&lt;/strong&gt; (2005): 555--588&lt;/a&gt;,
&lt;a href=&quot;http://arxiv.org/abs/math/0305026&quot;&gt;arxiv:math/0305026&lt;/a&gt;
	&lt;li&gt;Zoubin Ghahramani and Michael I. Jordan, &quot;Factorial Hidden Markov
Models,&quot; &lt;citE&gt;Machine Learning&lt;/cite&gt; &lt;strong&gt;29&lt;/strong&gt; (1997): 245--273
	&lt;li&gt;Olof G&amp;ouml;rnerup and Martin Nilsson Jacobi, &quot;A method for
inferring hierarchical dynamics in stochastic processes&quot;,
&lt;cite&gt;Advances in Complex Systems&lt;/cite&gt; &lt;strong&gt;11&lt;/strong&gt; (2008):
1--16, &lt;a href=&quot;http://arxiv.org/abs/nlin.AO/0703034&quot;&gt;nlin.AO/0703034&lt;/a&gt; [A
method for finding coarse-grainings of stochastic processes which are
Markovian, whether or not the original process is Markovian.]
	&lt;li&gt;David Griffeath, &quot;Introduction to Markov Random Fields&quot;, ch. 12 in
Kemeny, Knapp and Snell, &lt;cite&gt;Denumerable Markov Chains&lt;/cite&gt; [One of the
proofs of the equivalence between the Markov property and having a Gibbs
distribution, conventionally but misleadingly called the Hammersley-Clifford
Theorem.  Pollard, below, provides an on-line summary.]
	&lt;li&gt;Marius Iosifescu and Serban Grigorescu, &lt;cite&gt;Dependence with Complete Connections and Its Applications&lt;/cite&gt; [Review: &lt;a href=&quot;../reviews/complete-connections/&quot;&gt;Memories Fading to Infinity&lt;/a&gt;]
	&lt;li&gt;Martin Nilsson Jacobi, Olof Goernerup, &quot;A dual eigenvector condition for strong lumpability of Markov chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/0710.1986&quot;&gt;arxiv:0710.1986&lt;/a&gt;
	&lt;li&gt;Seyoung Kim and Padhraic Smyth, &quot;Segmental Hidden Markov Models
with Random Effects for Waveform Modeling&quot;, &lt;a
href=&quot;http://jmlr.csail.mit.edu/papers/v7/kim06a.html&quot;&gt;&lt;cite&gt;Journal of Machine
Learning Research&lt;/cite&gt; &lt;strong&gt;7&lt;/strong&gt; (2006): 945--969&lt;/a&gt;
	&lt;li&gt;Ross Kindermann and J. Laurie Snell, &lt;cite&gt;Markov Random Fields and
their Applications&lt;/cite&gt; [1980 classic; dreadful typography; &lt;a
href=&quot;http://www.ams.org/online_bks/conm1/&quot;&gt;full text free online&lt;/a&gt;]
	&lt;li&gt;Sergey Kirshner, Padhraic Smyth and Andrew Robertson, &quot;Conditional
Chow-Liu Tree Structures for Modeling Discrete-Valued Vector Time Series&quot;, in
Chickering and Halpern (eds.), &lt;cite&gt;Uncertainty in Artificial Intelligence:
Proceedings of the Twentieth Conference&lt;/cite&gt; (UAI 2004), pp. 317--324
[&lt;a href=&quot;http://www.datalab.uci.edu/papers/tr0404.pdf&quot;&gt;longer technical report
version in PDF&lt;/a&gt;]
	&lt;li&gt;Frank Knight [The most powerful and general Markovian
representation results known to me, which in fact include chunks of my thesis
as a special case.  Specifically, for essentially any stochastic process one
might care to consider, Knight shows how to construct a homogeneous Markov
process, which he calls the &quot;measure-theoretic prediction process&quot;, which
generates the original, observed process.  The states of the prediction process
correspond to conditional distributions over future observations: hence its
name.  The prediction process is, though he doesn't put it this way, the
minimal sufficient predictive statistic for the future of the observable
process.  I recommend starting with &quot;A Predictive View&quot; before tackling
&lt;cite&gt;Foundations&lt;/cite&gt;; I tried it the other way around and found it very
painful.]
		&lt;ul&gt;
		&lt;li&gt;&quot;A Predictive View of Continuous Time Processes&quot;, &lt;a href=&quot;http://projecteuclid.org/euclid.aop/1176996302&quot;&gt;&lt;cite&gt;The Annals of Probability&lt;/cite&gt; &lt;strong&gt;3&lt;/strong&gt; (1975): 573--596&lt;/a&gt;
		&lt;li&gt;&lt;citE&gt;Foundations of the Prediction Process&lt;/cite&gt;
		&lt;/ul&gt;
	&lt;li&gt;Thomas G. Kurtz
		&lt;ul&gt;
		&lt;li&gt;&quot;Solutions of Ordinary Differential Equations as Limits of
Pure Jump Markov Processes&quot;, &lt;cite&gt;Journal of Applied Probability&lt;/cite&gt;
&lt;strong&gt;7&lt;/strong&gt; (1970): 49--58
		&lt;li&gt;&quot;Limit Theorems for Sequences of Jump Markov Processes
Approximating Ordinary Differential Processes&quot;, &lt;cite&gt;Journal of Applied
Probability&lt;/cite&gt; &lt;strong&gt;8&lt;/strong&gt; (1971): 344--356
		&lt;li&gt;&lt;citE&gt;Approximation of Population Processes&lt;/cite&gt; [&lt;a href=&quot;../weblog/algae-2009-05.html#kurtz&quot;&gt;comments&lt;/a&gt;]
		&lt;/ul&gt;
	&lt;li&gt;Vivien Lecomte, Cecile Appert-Rolland and Frederic van Wijland,
&quot;Chaotic properties of systems with Markov dynamics&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0505483&quot;&gt;cond-mat/0505483&lt;/a&gt; = &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevLett.95.010601&quot;&gt;&lt;cite&gt;Physical Review
Letters&lt;/cite&gt; &lt;strong&gt;95&lt;/strong&gt; (2005): 010601&lt;/a&gt; [Showing that the
thermodynamic formalism can work for continuous-time Markov processes, which is
very nice]
	&lt;li&gt;Jie Li, Jiaxin Wang, Yannan Zhao and Zehong Yang, &quot;Self-adaptive
design of hidden Markov models,&quot;, &lt;cite&gt;Pattern Recognition
Letters&lt;/cite&gt; &lt;strong&gt;25&lt;/strong&gt; (2004): 197--210 [A penalized
maximum-likelihood approach to selecting the right number of states and,
potentially, architecture for HMMs.  The penalization scheme is based on
various entropies associated with the HMM; it's hard to give these as
straight-forward an information-theoretic interpretation as one would like ---
it definitely does not seem to be a description length.]
	&lt;li&gt;David Pollard, &quot;Markov random fields and Gibbs distributions&quot;
[&lt;a
href=&quot;http://www.stat.yale.edu/~pollard/Courses/251.spring04/Handouts/Hammersley-Clifford.pdf&quot;&gt;Online
PDF&lt;/a&gt;.  A proof of the theorem linking Markov random fields to Gibbs
distributions, following the approach of David Griffeath.]
	&lt;li&gt;L. C. G. Rogers and D. Williams, &lt;cite&gt;Diffusions, Markov Processes and Martingales&lt;/cite&gt; [&lt;a href=&quot;../weblog/algae-2006-02.html#rogers-and-williams&quot;&gt;comments&lt;/a&gt;]
	&lt;li&gt;Laurence K. Saul and Michael I. Jordan, &quot;Mixed Memory Markov
Models: Decomposing Complex Stochastic Processes as Mixtures of Simpler
Ones&quot;, &lt;cite&gt;Machine Learning&lt;/cite&gt; &lt;strong&gt;37&lt;/strong&gt; (1999): 75--87
	&lt;li&gt;A. I. Shushin, &quot;Non-Markovian stochastic Liouville equation and its
Markovian representation&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;67&lt;/strong&gt;
(2003): 061107 [This is very much a physicist's paper.  It &lt;em&gt;starts&lt;/em&gt; with
non-Markovian fluctuations driving a relaxation process, and
then &lt;em&gt;postulates&lt;/em&gt; that those fluctuations are in turn driven by a Markov
process.  That is, there is no systematic construction of Markovian
representations, just the hope that they exist, and the demonstration that the
author is clever enough to find them for some important special cases.  (Which
is certainly more than I could do.)  Whether systematic representation results
could improve on this at all is an interesting question.]
	&lt;li&gt;Enrique Vidal, Franck Thollard, Colin de la Higuera, Francisco Casacuberta and Rafael C. Carrasco, &quot;Probabilistic Finite-State Machines&quot;, Parts I,
&lt;a
href=&quot;http://dx.doi.org/10.1109/TPAMI.2005.147&quot;&gt;&lt;cite&gt;IEEE Transactions on Pattern Analysis and Machine Intelligence&lt;/cite&gt;
&lt;strong&gt;27&lt;/strong&gt; (2005): 1013--1025&lt;/a&gt; and
II, &lt;a href=&quot;http://dx.doi.org/10.1109/TPAMI.2005.148&quot;&gt;&lt;cite&gt;IEEE Transactions
on Pattern Analysis and Machine Intelligence&lt;/citE&gt; &lt;strong&gt;27&lt;/strong&gt; (2005):
1026--1039&lt;/a&gt;

	&lt;/ul&gt;

&lt;ul&gt;To read, teaching:
	&lt;li&gt;S. R. Adke and and S. M. Manjunath, &lt;cite&gt;An Introduction to
Finite Markov Processes&lt;/cite&gt; [Continuous-time finite-state processes,
and their likelihood-based inference]
	&lt;li&gt;J. R. Norris, &lt;cite&gt;Markov Chains&lt;/cite&gt;
	&lt;/ul&gt;

&lt;ul&gt;To read, learning:
	&lt;li&gt;Radoslaw Adamczak, &quot;A tail inequality for suprema of unbounded
empirical processes with applications to Markov
chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/0709.3110&quot;&gt;arxiv:0709.3110&lt;/a&gt;
	&lt;li&gt;Armen E. Allahverdyan, &quot;Entropy of Hidden Markov Processes via
Cycle Expansion&quot;, &lt;a href=&quot;http://arxiv.org/abs/0810.4341&quot;&gt;arxiv:0810.4341&lt;/a&gt;
	&lt;li&gt;David Andrieux, &quot;Bounding the coarse graining error in hidden Markov dynamics&quot;, &lt;a href=&quot;http://arxiv.org/abs/1104.1025&quot;&gt;arxiv:1104.1025&lt;/a&gt;
	&lt;li&gt;Frank Aurzada, Hanna Doering, Marcel Ortgiese, Michael Scheutzow, &quot;Moments of recurrence times for Markov chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/1104.1884&quot;&gt;arxiv:1104.1884&lt;/a&gt;
	&lt;li&gt;Olivier Aycard, Jean-Francois Mari and Richard Washington,
&quot;Learning to automatically detect features for mobile robots using second-order
Hidden Markov Models&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cs.AI/0501068&quot;&gt;cs.AI/0501068&lt;/a&gt;
	&lt;li&gt;Dominique Bakry, Patrick Cattiaux, Arnaud Guillin, &quot;Rate of
Convergence for ergodic continuous Markov processes: Lyapunov versus
Poincare&quot;,
&lt;a href=&quot;http://arxiv.org/abs/math.PR/0703355&quot;&gt;math.PR/0703355&lt;/a&gt;
	&lt;li&gt;Raluca Balan, &quot;Q-Markov random probability measures and their
posterior distributions&quot;, &lt;cite&gt;Stochastic Processes and Their
Applications&lt;/citE&gt; &lt;strong&gt;109&lt;/strong&gt; (2004): 295--316 = &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0412349&quot;&gt;math.PR/0412349&lt;/a&gt;
	&lt;li&gt;Raluca Balan and Gail Ivanoff, &quot;A Markov property for set-indexed
processes&quot;, &lt;cite&gt;Journal of Theoretical Probability&lt;/cite&gt; &lt;strong&gt;15&lt;/strong&gt;
(2002): 553--588 = &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0412350&quot;&gt;math.PR/0412350&lt;/a&gt;
	&lt;li&gt;Vlad Stefan Barbu and Nikolaos Limnios, &lt;cite&gt;Semi-Markov
Chains and Hidden Semi-Markov Models Toward Applications&lt;/cite&gt;
	&lt;li&gt;A. Baule and R. Friedrich, &quot;Joint probability distributions
for a class of non-Markovian processes&quot;, &lt;a
href=&quot;http://link.aps.org/abstract/PRE/v71/e026101&quot;&gt;&lt;cite&gt;Physical Review E&lt;/citE&gt;
&lt;strong&gt;71&lt;/strong&gt; (2005): 026101&lt;/a&gt; [From the abstract: &quot;We consider joint
probability distributions for the class of coupled Langevin equations
introduced by Fogedby.... We generalize well-known results for the single-time
probability distributions to the case of N-time joint probability
distributions. ... [T]hese probability distribution functions can be obtained
by an integral transform from distributions of a Markovian process. The
integral kernel obeys a partial differential equation with fractional time
derivatives reflecting the non-Markovian character of the process.&quot;]
	&lt;li&gt;Albert Benveniste, Eric Fabre and Stefan Haar, &quot;Markov
Nets: Probabilistic Models for Distributed and Concurrent Systems&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1109/TAC.2003.819076&quot;&gt;&lt;cite&gt;IEEE Transactions on
Automatic Control&lt;/cite&gt; &lt;strong&gt;48&lt;/strong&gt; (2003): 1936--1950&lt;/a&gt;
	&lt;li&gt;Patrice Bertail, Paul Doukhan and Philippe Soulier
(eds.), &lt;cite&gt;Dependence in Probability and Statistics&lt;/cite&gt; [&quot;recent
developments in the field of probability and statistics for dependent
data... from Markov chain theory and weak dependence with an emphasis on some
recent developments on dynamical systems, to strong dependence in times series
and random fields. ... section on statistical estimation problems and specific
applications&quot;. &lt;a href=&quot;http://www.springer.com/0-387-31741-4&quot;&gt;Full blurb,
contents&lt;/a&gt;]
	&lt;li&gt;Abhay G. Bhatt, Rajeeva L. Karandikar, B. V. Rao, &quot;On
characterisation of Markov processes via martingale
problems&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.PR/0607613&quot;&gt;math.PR/0607613&lt;/a&gt;
[Extending the martingale problem &lt;-&gt; Markov process connection from cadlag
processes to ones which are just continuous in probability.]
	&lt;li&gt;Giovanni Bussi, Alessandro Laio and Michele Parrinello,
&quot;Equilibrium Free Energies from Nonequilibrium Metadynamics&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevLett.96.090601&quot;&gt;&lt;cite&gt;Physical Review
Letters&lt;/cite&gt; &lt;strong&gt;96&lt;/strong&gt; (2006): 090601&lt;/a&gt; [&quot;In this Letter we
propose a new formalism to map history-dependent metadynamics in a Markovian
process.&quot;]
	&lt;li&gt;Krzysztof Burdzy, Soumik Pal, &quot;Markov processes on time-like graphs&quot;, &lt;a href=&quot;http://projecteuclid.org/euclid.aop/1312555800&quot;&gt;&lt;cite&gt;Annals of Probability&lt;/cite&gt; &lt;strong&gt;39&lt;/strong&gt; (2011): 1332--1364&lt;/a&gt;, &lt;a href=&quot;http://arxiv.org/abs/0912.0328&quot;&gt;arxiv:0912.0328&lt;/a&gt;
	&lt;li&gt;Krzysztof Burdzy, David White, &quot;Markov processes with product-form stationary distribution&quot;, &lt;a href=&quot;http://arxiv.org/abs/0711.0493&quot;&gt;arxiv:0711.0493&lt;/a&gt;
	&lt;li&gt;Massimo Campanino and Dimitri Petritis, &quot;On the physical relevance
of random walks: an example of random walks on a randomly oriented lattice,&quot;
&lt;a href=&quot;http://arxiv.org/abs/math.PR/0201130&quot;&gt;math.PR/0201130&lt;/a&gt;
	&lt;li&gt;Patrick Cattiaux and Arnaud Guillin, &quot;Deviation bounds for additive
functionals of Markov
process&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.PR/0603021&quot;&gt;math.PR/0603021&lt;/a&gt;
[Non-asymptotic bounds for the probability that time averages deviate from
expectations with respect to the invariant measure, when the process is
stationary and ergodic and the invariant measure is reasonably regular.]
	&lt;li&gt;Onn Chan and T. K. Lam, &quot;Lifting Markov Chains to Random Walks on
Groups&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1017/S0963548304006352&quot;&gt;&lt;cite&gt;Combinatorics,
Probability and Computing&lt;/cite&gt; &lt;strong&gt;14&lt;/strong&gt; (2005): 269--273&lt;/a&gt;
	&lt;li&gt;Jean-Rene Chazottes, Edgardo Ugalde
		&lt;ul&gt;
		&lt;li&gt;&quot;Projection of Markov Measures May be Gibbsian&quot;,
&lt;cite&gt;Journal of Statistical Physics&lt;/cite&gt; &lt;Strong&gt;111&lt;/strong&gt; (2003): 1245--1272
		&lt;li&gt;&quot;On the preservation of Gibbsianness under symbol amalgamation&quot;, &lt;a href=&quot;http://arxiv.org/abs/0907.0528&quot;&gt;arxiv:0907.0528&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;Ruslan K. Chornei, Hans Daduna, and Pavel S. Knopov, &quot;Controlled
Markov Fields with Finite State Space on
Graphs&quot;, &lt;a href=&quot;http://dx.doi.org/10.1080/15326340500294520&quot;&gt;&lt;cite&gt;Stochastic
Models&lt;/cite&gt; &lt;strong&gt;21&lt;/strong&gt; (2005): 847--874&lt;/a&gt;
[&lt;a
href=&quot;ftp://ftp.math.uni-hamburg.de/pub/unihh/math/papers/prst/prst200008.ps.gz&quot;&gt;PS.gz
preprint&lt;/a&gt;]
	&lt;li&gt;Richard G. Clegg and Maurice Dodson, &quot;Markov chain-based method for
generating long-range dependence&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevE.72.026118&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;72&lt;/strong&gt; (2005): 026118&lt;/a&gt; [Sounds like a sofic system to
me...]
	&lt;li&gt;R. W. R. Darling and J. R. Norris, &quot;Structure of large random
hypergraphs&quot;, &lt;a
href=&quot;http://dx.doi.org/10%2E1214/105051604000000567&quot;&gt;&lt;cite&gt;Annals of Applied
Probability&lt;/cite&gt; &lt;strong&gt;15&lt;/strong&gt; (2005): 125--152&lt;/a&gt; = &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0503460&quot;&gt;math.PR/0503460&lt;/a&gt; [&quot;The theme of
this paper is the derivation of analytical formulae for certain large
combinatorial structures.  The formulae are obtained via fluid limits of pure
jump-type Markov processes...&quot;]
	&lt;li&gt;L. de Francesco Albasini, N. Sabadini, R.F.C. Walters, &quot;The compositional construction of Markov processes&quot;, &lt;a href=&quot;http://arxiv.org/abs/0901.2434&quot;&gt;arxiv:0901.2434&lt;/a&gt;
	&lt;li&gt;Amir Dembo, Jean-Dominique Deuschel, &quot;Markovian perturbation, response and fluctuation dissipation theorem&quot;, &lt;a href=&quot;http://arxiv.org/abs/0710.4394&quot;&gt;arxiv:0710.4394&lt;/a&gt;
	&lt;li&gt;Gregor Diezemann, &quot;Fluctuation-dissipation relations for Markov
processes&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevE.72.011104&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;72&lt;/strong&gt; (2005): 0111104&lt;/a&gt;
	&lt;li&gt;R. Douc, E. Moulines, and Jeffrey S. Rosenthal, &quot;Quantitative
bounds on convergence of time-inhomogeneous Markov chains&quot;, &lt;a
href=&quot;http://dx.doi.org/10%2E1214/105051604000000620&quot;&gt;&lt;cite&gt;Annals of Applied
Probability&lt;/cite&gt; &lt;strong&gt;14&lt;/strong&gt; (2004): 1643--1665&lt;/a&gt; = &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0403532&quot;&gt;math.PR/0403532&lt;/a&gt;
	&lt;li&gt;Peter G. Doyle, Jean Steiner, &quot;Commuting time geometry of ergodic Markov chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/1107.2612&quot;&gt;arxiv:1107.2612&lt;/a&gt;
	&lt;li&gt;P. Dupont, F. Denis and Y. Esposito, &quot;Links between probabilistic
automata and hidden Markov models: probability distributions, learning models
and induction algorithms&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1016/j.patcog.2004.03.020&quot;&gt;&lt;cite&gt;Pattern
Recognition&lt;/citE&gt; &lt;strong&gt;38&lt;/strong&gt; (2005): 1349--1371&lt;/a&gt;
	&lt;li&gt;Paul Dupuis and Hui Wang, &quot;Dynamic importance sampling for
uniformly recurrent markov chains&quot;, &lt;a
href=&quot;http://dx.doi.org/10%2E1214/105051604000001016&quot;&gt;&lt;cite&gt;Annals of Applied
Probability&lt;/cite&gt; &lt;strong&gt;15&lt;/strong&gt; (2005): 1--38&lt;/a&gt; = &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0503454&quot;&gt;math.PR/0503454&lt;/a&gt; [Promises
interesting large deviations techniques in the abstract]
	&lt;li&gt;E. B. Dynkin
		&lt;ul&gt;
		&lt;li&gt;&lt;cite&gt;Markov Processes&lt;/cite&gt;
		&lt;li&gt;&lt;cite&gt;Markov Processes and Related Problems of Analysis:
Selected Papers&lt;/cite&gt; [&lt;a href=&quot;http://cambridge.org/9780521285124&quot;&gt;Blurb&lt;/a&gt;.
Memo to self, see how many of the papers are already in open-access
archives; &lt;a href=&quot;http://projecteuclid.org/euclid.aop/1176995424&quot;&gt;&quot;Sufficient Statistics and Extreme Points&quot;&lt;/a&gt;, for instance, certainly is.]
		&lt;/ul&gt;
	&lt;li&gt;R. V. Erickson, &quot;Functions of Markov Chains&quot;,
&lt;a href=&quot;http://projecteuclid.org/euclid.aoms/1177696962&quot;&gt;&lt;cite&gt;Annals of
Mathematical Statistics&lt;/cite&gt; &lt;strong&gt;41&lt;/strong&gt; (1970): 843--850&lt;/a&gt;
[Necessary and sufficient conditions for a discrete-valued stochastic process
to be a function of a Markov chain]
	&lt;li&gt;Sean Escola, Michael Eisele,  Kenneth Miller and Liam
Paninski, &quot;Maximally Reliable Markov Chains Under Energy Constraints&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1162/neco.2009.08-08-843&quot;&gt;&lt;cite&gt;Neural Computation&lt;/cite&gt;
&lt;strong&gt;21&lt;/strong&gt; (2009): 1863--1912&lt;/a&gt;
	&lt;li&gt;M. Fabrizio, C. Giorgi and V. Pata, &quot;A New Approach to Equatios
with Memory&quot;, &lt;a href=&quot;http://arxiv.org/abs/0901.4063&quot;&gt;arxiv:0901.4063&lt;/a&gt;
[&quot;novel approach to the mathematical analysis of equations with memory based on
the notion of a state, namely, the initial configuration of the system which
can be unambiguously determined by the knowledge of the future dynamics&quot;
&amp;mdash; which sounds like a Markovian representation result]
	&lt;li&gt;Gersende Fort, Sean Meyn, Eric Moulines, and Pierre Priouret,
&quot;ODE methods for skip-free Markov chain stability with applications to MCMC&quot;,
&lt;a href=&quot;http://arxiv.org/abs/math.PR/0607800&quot;&gt;math.PR/0607800&lt;/a&gt;
	&lt;li&gt;Sandro Gallo and Nancy L. Garcia
		&lt;ul&gt;
		&lt;li&gt;&quot;Perfect simulation for stochastic chains of infinite memory: relaxing the continuity assumption&quot;, &lt;a href=&quot;http://arxiv.org/abs/1005.5459&quot;&gt;arxiv:1005.5459&lt;/a&gt;
		&lt;li&gt;&quot;A general context-tree-based approach to perfect simulation for chains of infinite order&quot;, &lt;a href=&quot;http://arxiv.org/abs/1103.2058&quot;&gt;arxiv:1103.2058&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;Sandro Gallo, Matthieu Lerasle, Daniel Yasumasa Takahashi, &quot;Upper Bounds for Markov Approximations of Ergodic Processes&quot;, &lt;a href=&quot;http://arxiv.org/abs/1107.4353&quot;&gt;arxiv:1107.4353&lt;/a&gt;
	&lt;li&gt;A. Galves, E. L&amp;ouml;cherbach and E. Orlandi, &quot;Perfect Simulation of Infinite Range Gibbs Measures and Coupling with Their Finite Range Approximations&quot;, &lt;a href=&quot;http://dx.doi.org/10.1007/s10955-009-9881-3&quot;&gt;&lt;cite&gt;Journal of Statistical Physics&lt;/cite&gt;
&lt;strong&gt;138&lt;/strong&gt; (2010): 476--495&lt;/a&gt;
	&lt;li&gt;Eugen A. Ghenciu, R. Daniel Mauldin, &quot;Conformal Graph Directed Markov Systems&quot;, &lt;a href=&quot;http://arxiv.org/abs/0711.1182&quot;&gt;arxiv:0711.1182&lt;/a&gt;
	&lt;li&gt;Beniamin Goldys and Bohdan Maslowski, &quot;The Ornstein Uhlenbeck
Bridge and Applications to Markov
Semigroups&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.PR/0610386&quot;&gt;math.PR/0610386&lt;/a&gt;
[&quot;For an arbitrary Hilbert space-valued Ornstein-Uhlenbeck process we construct
the Ornstein-Uhlenbeck Bridge connecting a starting point $x$ and an endpoint
$y$ that belongs to a certain linear subspace of full measure. We derive also a
stochastic evolution equation satisfied by the OU Bridge and study its basic
properties. The OU Bridge is then used to investigate the Markov transition
semigroup associated to a nonlinear stochastic evolution equation with additive
noise.&quot;]
	&lt;li&gt;Robert L. Grossman and Richard G. Larson, &quot;State Space Realization Theorems For Data Mining&quot;, &lt;a href=&quot;http://arxiv.org/abs/0901.2745&quot;&gt;arxiv:0901.2745&lt;/a&gt;
	&lt;li&gt;B. M. Gurevich and A. A. Tempelman, &quot;Markov approximation of
homogeneous lattice random fields&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1007/s00440-004-0383-6&quot;&gt;&lt;cite&gt;Probability Theory and
Related Fields&lt;/cite&gt; &lt;strong&gt;131&lt;/strong&gt; (2005): 519--527&lt;/a&gt;
	&lt;li&gt;Guangyue Han and Brian Marcus, &quot;Analyticity of Entropy Rate in
Families of Hidden Markov Chains&quot;, &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0507235&quot;&gt;math.PR/0507235&lt;/a&gt;
	&lt;li&gt;M. B. Hastings, &quot;Locality in Quantum and Markov Dynamics on
Lattices and Networks&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevLett.93.140402&quot;&gt;&lt;cite&gt;Physical Review
Letters&lt;/cite&gt; &lt;strong&gt;93&lt;/strong&gt; (2004): 140402&lt;/a&gt;
	&lt;li&gt;Alex Heller, &quot;On Stochastic processes Derived from Markov
Chains&quot;, &lt;a href=&quot;http://projecteuclid.org/euclid.aoms/1177700000&quot;&gt;&lt;cite&gt;Annals
of Mathematical Statistics&lt;/cite&gt;
&lt;strong&gt;36&lt;/strong&gt; (1965): 1286--1291&lt;/a&gt;
	&lt;li&gt;Holger Hermanns, &lt;Cite&gt;Interactive Markov Chains&lt;/citE&gt; [Markov
models for distributed system analysis and design]
	&lt;li&gt;D. Hernando, V. Crespi and G. Cybenko, &quot;Efficient Computation of
the Hidden Markov Model Entropy for a Given Observation Sequence&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1109/TIT.2005.850223&quot;&gt;&lt;cite&gt;IEEE Transactions on
Information Theory&lt;/cite&gt; &lt;strong&gt;51&lt;/strong&gt; (2005): 2681--2685&lt;/a&gt; [By
&quot;hidden Markov model entropy&quot; they mean the Shannon entropy of the set of
hidden-state trajectories compatible with the observation sequence.  This has
certain connections to the &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/9808147&quot;&gt;Lloyd-Pagels &quot;thermodynamic depth&quot;
complexity measure&lt;/a&gt;...]
	&lt;li&gt;Jane Hillston, &lt;cite&gt;A Compositional Approach to Performance
Modelling&lt;/cite&gt; [&lt;a href=&quot;http://cambridge.org/9780521571890&quot;&gt;blurb&lt;/a&gt;]
	&lt;li&gt;Hajo Holzmann, &quot;Martingale approximations for continuous-time and
discrete-time stationary Markov processes&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1016/j.spa.2005.04.001&quot;&gt;&lt;cite&gt;Stochastic Processes
and their Applications&lt;/cite&gt; &lt;strong&gt;115&lt;/strong&gt; (2005): 1518--1529&lt;/a&gt; [More
exactly, martingale approximations to additive functionals of stationary
ergodic Markov processes]
	&lt;li&gt;Katarzyna Horbacz, Jozef Myjak and Tomasz Szarek, &quot;On Stability of
Some General Random Dynamical System&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1007/s10955-004-2045-6&quot;&gt;&lt;cite&gt;Journal of Statistical
Physics&lt;/cite&gt; &lt;strong&gt;119&lt;/strong&gt; (2005): 35--60&lt;/a&gt; [&quot;We consider a new
random dynamical system which generalizes Markov processes corresponding to
iterated function systems and Poisson driven stochastic differential
equations. It can be used as a description of many physical and biological
phenomena. Under the suitable assumption will be proved its stability.&quot;]
	&lt;li&gt;Martin Horvat, &quot;The ensemble of random Markov matrices&quot;, &lt;a href=&quot;http://arxiv.org/abs/0812.0567&quot;&gt;arxiv:0812.0567&lt;/a&gt;
	&lt;li&gt;Marius Iosifescu and Radu Theodorescu, &lt;cite&gt;Random Processes and Learning&lt;/cite&gt;
	&lt;li&gt;Jacques Janssen and Raimondo Manca, &lt;cite&gt;Applied Semi-Markov
Processes&lt;/cite&gt;
[&lt;a
href=&quot;http://www.springer.com/sgw/cda/frontpage/0,11855,4-10049-22-86706147-detailsPage%253Dppmmedia%257CaboutThisBook%257CaboutThisBook,00.html&quot;&gt;Blurb&lt;/a&gt;]
	&lt;li&gt;Mark Jerrum, &quot;On the approximation of one Markov chain by
another&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1007/s00440-005-0453-4&quot;&gt;&lt;cite&gt;Probability Theory and
Related Fields&lt;/cite&gt; &lt;strong&gt;135&lt;/strong&gt; (2006): 1--14&lt;/a&gt;
	&lt;li&gt;Sophia L. Kalpazidou, &lt;cite&gt;Cycle Representations of Markov
Processes&lt;/cite&gt;
	&lt;li&gt;Vladislav Kargin, &quot;A Large Deviation Inequality for Vector
Functions on Finite Reversible Markov
Chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.PR/0508538&quot;&gt;math.PR/0508538&lt;/a&gt;
	&lt;li&gt;John G. Kemeny, J. Laurie Snell and Anthony W. Knapp, with
David Griffeath, &lt;cite&gt;Denumerable Markov Chains&lt;/cite&gt;
	&lt;li&gt;Andrew Kempe, &quot;Look-Back and Look-Ahead in the Conversion of Hidden
Markov Models into Finite State Transducers&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cmp-lg/9802001&quot;&gt;cmp-lg/9802001&lt;/a&gt;
	&lt;li&gt;Frank B. Knight, &lt;cite&gt;Essays on the Prediction Process&lt;/cite&gt;
[&lt;a href=&quot;http://projecteuclid.org/euclid.lnms/1215464503&quot;&gt;Full text&lt;/a&gt; now
free online]
	&lt;li&gt;Vassili N. Kolokoltsov, &quot;Nonlinear Markov Semigroups and
Interacting L&amp;eacute;vy Type
Processes&quot;, &lt;a href=&quot;http://dx.doi.org/10.1007/s10955-006-9211-y&quot;&gt;&lt;cite&gt;Journal
of Statistical Physics&lt;/cite&gt; &lt;strong&gt;126&lt;/strong&gt; (2007): 585-642&lt;/a&gt;
	&lt;li&gt;Vadim Kostrykin, J&amp;uuml;rgen Potthoff, Robert Schrader, &quot;A Note on Feller Semigroups and Resolvents&quot;, &lt;a href=&quot;http://arxiv.org/abs/1102.3979&quot;&gt;arxiv:1102.3979&lt;/a&gt;
	&lt;li&gt;Hans R. K&amp;uuml;nsch, &quot;State Space and Hidden Markov Models&quot;,
pp. 109--173 in Ole E. Barndorff-Nielsen, David R. Cox and Claudia
Kl&amp;uuml;ppelberg (eds.), &lt;cite&gt;Complex Stochastic Systems&lt;/cite&gt;
	&lt;li&gt;Mernan Larralde and Frencois Leyvraz, &quot;Metastability for Markov
Processes with Detailed Balance&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1103/PhysRevLett.94.160201&quot;&gt;&lt;cite&gt;PRL&lt;/cite&gt; &lt;strong&gt;94&lt;/strong&gt;
(2005): 160201&lt;/a&gt;
	&lt;li&gt;Stephan Lawi, &quot;A characterization of Markov processes enjoying the
time-inversion property&quot;, &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0506013&quot;&gt;math.PR/0506013&lt;/a&gt;
	&lt;li&gt;Vivien Lecomte, C&amp;eacute;cile Appert-Rolland, and
Fr&amp;eacute;d&amp;eacute;ric van Wijland
		&lt;ul&gt;
		&lt;li&gt;&quot;Thermodynamic formalism for systems with Markov
dynamics&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0606211&quot;&gt;cond-mat/0606211&lt;/a&gt;
		&lt;li&gt;&quot;Thermodynamic formalism and large deviation functions in
continuous time Markov
dynamics&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0703435&quot;&gt;cond-mat/0703435&lt;/a&gt;
		&lt;/ul&gt;
	&lt;li&gt;Carlos A. Leon and Francois Perron, &quot;Optimal Hoeffding bounds for
discrete reversible Markov
chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.PR/0405296&quot;&gt;math.PR/0405296&lt;/a&gt;
	&lt;li&gt;Christian Leonard, &quot;Stochastic derivatives and generalized h-transforms of Markov processes&quot;, &lt;a href=&quot;http://arxiv.org/abs/1102.3172&quot;&gt;arxiv:1102.3172&lt;/a&gt;
	&lt;li&gt;David A. Levin, Yuval Peres and Elizabeth L. Wilmer,
&lt;cite&gt;Markov Chains and Mixing Times&lt;/cite&gt;
[&lt;a href=&quot;http://www.ams.org/bookstore-getitem/item=mbk-58&quot;&gt;blurb&lt;/a&gt;]
	&lt;li&gt;Pascal Lezaud, &quot;Chernoff-Type Bound for Finite Markov Chains&quot;,
&lt;a href=&quot;http://projecteuclid.org/euclid.aoap/1028903453&quot;&gt;&lt;cite&gt;The Annals of Applied Probability&lt;/cite&gt; &lt;strong&gt;8&lt;/strong&gt; (1998):
849--867&lt;/a&gt;
	&lt;li&gt;J.T. Lewis, C.-E. Pfister and W.G. Sullivan, &quot;Entropy, Concentration of Probability and Conditional Limit Theorems&quot;, &lt;cite&gt;Markov Processes
and Related Fields&lt;/cite&gt; &lt;strong&gt;1&lt;/strong&gt; (1995): 319--386 [Abstract
&lt;a href=&quot;http://www.math.msu.su/~malyshev/abs95.htm&quot;&gt;here&lt;/a&gt;.  How can our
library NOT subscribe to &lt;cite&gt;Markov Processes and Related Fields&lt;/cite&gt;?!?]
	&lt;li&gt;Francois Leyvraz, Hernan Larralde, and David P. Sanders, &quot;A
Definition of Metastability for Markov Processes with Detailed
Balance&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0509754&quot;&gt;cond-mat/0509754&lt;/a&gt;
	&lt;li&gt;Yujian Li, &quot;Hidden Markov models with states depending on
observations&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1016/j.patrec.2004.09.050&quot;&gt;&lt;citE&gt;Pattern Recognition
Letters&lt;/cite&gt; &lt;strong&gt;26&lt;/strong&gt; (2005): 977--984&lt;/a&gt; [From the abstract,
this sounds like a rediscovery of stochastic finite automata.]
	&lt;li&gt;Thomas M. Liggett, &lt;cite&gt;Continuous Time Markov Processes: An
Introduction&lt;/cite&gt; [Including a chapter
on &lt;a href=&quot;interacting-particle-systems.html&quot;&gt;interacting particle
systems&lt;/a&gt;, Liggett's particular specialty.]
	&lt;li&gt;Fabrizio Lillo, Salvatore Miccich&amp;egrave; and Rosario N. Mantegna,
&quot;Long-range correlated stationary Markovian processes,&quot; &lt;a
href=&quot;http://arxiv.org/abs/cond-mat/0203442&quot;&gt;cond-mat/0203442&lt;/a&gt; [From the
abstract, this sounds like they've rediscovered sofic processes.]
	&lt;li&gt;David Link, &quot;Chains to the West: Markov's Theory of Connected
Events and Its Transmission to Western
Europe&quot;, &lt;a href=&quot;http://dx.doi.org/10.1017/S0269889706001062&quot;&gt;&lt;cite&gt;Science in
Context&lt;/cite&gt; &lt;strong&gt;19&lt;/strong&gt; (2007): 561--589&lt;/a&gt; [Apparently accompanied
by translations of two papers by Markov]
	&lt;li&gt;Andrew J. Majda, Christian L. Franzke, Alexander Fischer and Daniel
T. Crommelin, &quot;Distinct metastable atmospheric regimes despite nearly Gaussian
statistics: A paradigm
model&quot;, &lt;a href=&quot;http://dx.doi.org/10.1073/pnas.0602641103&quot;&gt;&lt;cite&gt;Proceedings
of the National Academy of Sciences&lt;/cite&gt; (USA) &lt;strong&gt;103&lt;/strong&gt; (2006):
8309--8314&lt;/a&gt; [An HMM for low-frequency modes in the atmosphere]
	&lt;li&gt;Brian Marcus, Karl Petersen and Tsachy Weissman (eds.), &lt;cite&gt;Entropy of Hidden Markov Processes and Connections to Dynamical Systems&lt;/cite&gt;
[&lt;a href=&quot;http://cambridge.org/9780521111133&quot;&gt;blurb&lt;/a&gt;]
	&lt;li&gt;Michael B. Marcus and Jay Rosen, &lt;cite&gt;Markov Processes,
Gaussian Processes, and Local Times&lt;/cite&gt;
	&lt;li&gt;Donald E. K. Martin, &quot;A recursive algorithm for computing the
distribution of the number of successes in higher-order Markovian
trials&quot;, &lt;a
href=&quot;http://dx.doi.org/http://dx.doi.org/10.1016/j.csda.2004.09.005&quot;&gt;&lt;cite&gt;Computational
Statistics and Data Analysis &lt;cite&gt; &lt;strong&gt;50&lt;/strong&gt; (2005): 604--610&lt;/a&gt;
	&lt;li&gt;Daniel Mauldin and Mariusz Urbanski, &lt;cite&gt;Graph Directed
Markov Systems: Geometry and Dynamics of Limit Sets&lt;/cite&gt;
	&lt;li&gt;Sean P. Meyn and Richard L. Tweedie, &lt;cite&gt;Markov Chains and
Stochastic Stability&lt;/cite&gt; [&lt;a
href=&quot;http://decision.csl.uiuc.edu/~meyn/pages/book.html&quot;&gt;Full text free
online&lt;/a&gt;, courtesy of Prof.  Meyn.]
	&lt;li&gt;Salvatore Miccich&amp;egrave;, &quot;Modeling long-range
memory with stationary Markovian processes&quot;, &lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;79&lt;/strong&gt; (2009): 031116, &lt;a href=&quot;http://arxiv.org/abs/0806.0722&quot;&gt;arxiv:0806.0722&lt;/a&gt;
	&lt;li&gt;Jan Nauddts and Erik Van der Straeten, &quot;Transition records of
stationary Markov
chains&quot;, &lt;a href=&quot;http://arxiv.org/abs/cond-mat/0607485&quot;&gt;cond-mat/0607485&lt;/a&gt;
= &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.74.040103&quot;&gt;&lt;cite&gt;Physical Review
E&lt;/cite&gt; &lt;strong&gt;74&lt;/strong&gt; (2006): 040103&lt;/a&gt;
	&lt;li&gt;P. Ney and Esa Nummelin, &quot;Regeneration for infinite memory chains&quot;,
&lt;cite&gt;Probability Theory and Related Fields&lt;/cite&gt; &lt;strong&gt;96&lt;/strong&gt; (1994):
503--520 [Predates the on-line archive for the journal, so I need to actually
go to the library]
	&lt;li&gt;Fabien Panloup and Gilles Pages, &quot;Approximation of the distribution of a stationary Markov process with application to option pricing&quot;,
&lt;a href=&quot;http://arxiv.org/abs/0704.0335&quot;&gt;arxiv:0704.0335&lt;/a&gt; [The goal here is
to approximate the &lt;em&gt;process&lt;/em&gt; distribution from an increasingly fine
sequence of discrete-time simulations.]
	&lt;li&gt;Andrea Puglisi, Lamberto Rondoni and Angelo Vulpiani, &quot;Relevance of
initial and final conditions for the Fluctuation Relation in Markov
processes&quot;,&lt;a href=&quot;http://arxiv.org/abs/cond-mat/0606526&quot;&gt;cond-mat/0606526&lt;/a&gt;
	&lt;li&gt;Ziad Rached, Fady Alajaji and L. Lorne Campbell, &quot;R&amp;eacute;nyi's
Divergence and Entropy Rates for Finite Alphabet Markov Sources&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1109/18.923736&quot;&gt;&lt;cite&gt;IEEE Transactions on
Information Theory&lt;/cite&gt; &lt;strong&gt;47&lt;/strong&gt; (2001): 1553--1561&lt;/a&gt;
	&lt;li&gt;Yaron Rachlin, Rohit Negi and Pradeep Khosla, &quot;Sensing Capacity for
Markov Random Fields&quot;, &lt;a
href=&quot;http://arxiv.org/abs/cs.IT/0508054&quot;&gt;cs.IT/0508054&lt;/a&gt;
	&lt;li&gt;Mohammad Rezaeian, &quot;Hidden Markov Process: A New Representation,
Entropy Rate and Estimation
Entropy&quot;, &lt;a href=&quot;http://arxiv.org/abs/cs.IT/0606114&quot;&gt;cs.IT/0606114&lt;/a&gt;
	&lt;li&gt;Murray Rosenblatt, &lt;cite&gt;Markov Processes: Structure and Asymptotic
Behavior&lt;/cite&gt; (&quot;Die Grundlehren der mathematischen Wissenschaften in
Einzeldarstellungen, Band 184&quot;)
	&lt;li&gt;&lt;a
href=&quot;http://www.ri.cmu.edu/people/siddiqi_sajid.html&quot;&gt;Sajid Siddiqi&lt;/a&gt; and
&lt;a href=&quot;http://www.ri.cmu.edu/people/moore_andrew.html&quot;&gt;Andrew Moore&lt;/a&gt;,
&quot;Fast Inference and Learning in Large-State-Space HMMs&quot;, &lt;cite&gt;ICML 2005&lt;/cite&gt;
[&lt;a
href=&quot;http://www.ri.cmu.edu/pubs/pub_5098.html#abstract&quot;&gt;Abstract&lt;/a&gt;, &lt;a
href=&quot;http://www.ri.cmu.edu/pub_files/pub4/siddiqi_sajid_2005_1/siddiqi_sajid_2005_1.pdf&quot;&gt;PDF&lt;/a&gt;]
	&lt;li&gt;Sajid Siddiqi, Byron Boots, Geoffrey Gordon, &quot;Reduced-Rank
Hidden Markov Models&quot;, &lt;a href=&quot;http://jmlr.csail.mit.edu/proceedings/papers/v9/siddiqi10a.html&quot;&gt;&lt;cite&gt;Journal of Machine Learning Research&lt;/cite&gt; Proceedings &lt;strong&gt;9&lt;/strong&gt; (2010): 741--748&lt;/a&gt;
	&lt;li&gt;Padhraic Smyth, &quot;Belief networks, hidden Markov models, and Markov random fields: a unifying view&quot;, &lt;citE&gt;Pattern Recognition Letters&lt;/cite&gt;
&lt;strong&gt;18&lt;/strong&gt; (1997): 1261--1268
[&lt;a href=&quot;http://www.datalab.uci.edu/papers/prl.pdf&quot;&gt;PDF preprint&lt;/a&gt;]
	&lt;li&gt;Padhraic Smyth, David Heckerman and Michael I. Jordan,
&quot;Probabilistic Independence Networks for Hidden Markov Probability
Models&quot;, &lt;cite&gt;Neural Computation&lt;/cite&gt; &lt;strong&gt;9&lt;/strong&gt; (1997): 227--269
[&lt;a href=&quot;http://www.datalab.uci.edu/papers/hmmpin.pdf&quot;&gt;PDF preprint&lt;/a&gt;.
Reprinted in Jordan and Sejnowski (eds.), &lt;cite&gt;Graphical Models&lt;/cite&gt;,
pp. 1--44]
	&lt;li&gt;Wolfgang Stadje, &quot;The evolution of aggregated Markov chains&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1016/j.spl.2005.04.052&quot;&gt;&lt;cite&gt;Statistics and
Probability Letters&lt;/cite&gt; &lt;strong&gt;74&lt;/strong&gt; (2005): 303--311&lt;/a&gt; [&quot;Given a
stationary two-sided Markov chain ... with finite state space ... and a
partition ... we consider the aggregated sequence defined by [applying the
partition], which is also stationary but in general not Markovian.  We present
a tractable way to determine the transition probabilities of [the aggregated
process], either given a finite part of its past or given its infinite past.
These probabilities are linked to the Radon-Nikodym derivative of [the density
of an exponentially-decaying sum of aggregated values, conditional on the
unaggregated process] with respect to [the unconditional distribution of the
exponentially-decaying sum]&quot;.]
	&lt;li&gt;William J. Stewart, &lt;cite&gt;Introduction to the Numerical Solution of
Markov Chains&lt;/cite&gt;
	&lt;li&gt;R. L. Stratonovich, &lt;cite&gt;Conditional Markov Processes and Their
Application to the Theory of Optimal Control&lt;/cite&gt;
	&lt;li&gt;Stroock
		&lt;ul&gt;
		&lt;li&gt;&lt;cite&gt;An Introduction to Markov Processes&lt;/cite&gt;
		&lt;li&gt;&lt;cite&gt;Markov Processes from K. Ito's Perspective&lt;/cite&gt;
		&lt;/ul&gt;
	&lt;li&gt;Vladislav B. Tadic and Arnaud Doucet, &quot;Exponential forgetting and
geometric ergodicity for optimal filtering in general state-space models&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1016/j.spa.2005.03.005&quot;&gt;&lt;cite&gt;Stochastic Processes
and their Applications&lt;/cite&gt; &lt;strong&gt;115&lt;/strong&gt; (2005): 1408--1436&lt;/a&gt;
	&lt;li&gt;Amanda G. Turner, &quot;Convergence of Markov processes near saddle
fixed points&quot;, &lt;a
href=&quot;http://arxiv.org/abs/math.PR/0412051&quot;&gt;math.PR/0412051&lt;/a&gt;
	&lt;li&gt;Ryan Turner, Marc Deisenroth, Carl Rasmussen, &quot;State-Space
Inference and Learning with Gaussian Processes&quot;, &lt;a href=&quot;http://jmlr.csail.mit.edu/proceedings/papers/v9/turner10a.html&quot;&gt;&lt;cite&gt;Journal
of Machine Learning Research&lt;/cite&gt; Proceedings &lt;strong&gt;9&lt;/strong&gt; (2010):
868--875&lt;/a&gt;
	&lt;li&gt;Ramon van Handel, &quot;Observability and nonlinear filtering&quot;,
&lt;cite&gt;Probability Theory and Related Fields&lt;/cite&gt; &lt;strong&gt;145&lt;/strong&gt;
(2009): 35--74, &lt;a href=&quot;http://arxiv.org/abs/0708.3412&quot;&gt;arxiv:0708.3412&lt;/a&gt;
	&lt;li&gt;A. Vershik, &quot;What does a generic Markov operator look like&quot;,
&lt;a href=&quot;http://arxiv.org/abs/math.FA/0510320&quot;&gt;math.FA/0510320&lt;/a&gt; [&quot;We
consider generic i.e., forming an everywhere dense massive subset classes of
Markov operators in the space $L^2(X,\mu)$ with a finite continuous
measure. Since there is a canonical correspondence that associates with each
Markov operator a multivalued measure-preserving transformation (i.e., a
polymorphism), as well as a stationary Markov chain, we can also speak about
generic polymorphisms and generic Markov chains. The most important and
inexpected generic properties of Markov operators (or Markov chains or
polymorphisms) is nonmixing and totally nondeterministicity.&quot;]
	&lt;li&gt;Ingmar Visser and Maarten Speekenbrink, &quot;depmixS4: An R Package for Hidden Markov Models&quot;, &lt;a href=&quot;http://www.jstatsoft.org/v36/i07/&quot;&gt;&lt;cite&gt;Journal of Statistical Software&lt;/cite&gt; &lt;strong&gt;36&lt;/strong&gt; (2010): 7&lt;/a&gt;
	&lt;li&gt;Thomas Wennekers and Nihat Ay, &quot;Finite State Automata Resulting
from Temporal Information Maximization and a Temporal Learning Rule&quot;,
&lt;a href=&quot;http://neco.mitpress.org/cgi/content/abstract/17/10/2258&quot;&gt;&lt;cite&gt;Neural
Computation&lt;/cite&gt; &lt;strong&gt;17&lt;/strong&gt; (2005): 2258--2290&lt;/a&gt;
	&lt;li&gt;L. Xie, V. A. Ugrinovskii and I. R. Petersen, &quot;Probabilistic
Distances Between Finite-State Finite-Alphabet Hidden Markov Models&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1109/TAC.2005.844896&quot;&gt;IEEE Transactions on
Automatic Control&lt;/cite&gt; &lt;strong&gt;50&lt;/strong&gt; (2005): 505--511&lt;/a&gt;
	&lt;li&gt;Kouji Yano, Kenji Yasutomi, &quot;Realization of a finite-state stationary Markov chain as a random walk subject to a synchronizing road coloring&quot;, &lt;a href=&quot;http://arxiv.org/abs/1006.0534&quot;&gt;arxiv:1006.0534&lt;/a&gt;
	&lt;li&gt;G. G. Yin and V. Kirshnamurthy, &quot;LMS Algorithms for Tracking Slow
Markov Chains With Applications to Hidden Markov Estimation and Adaptive
Multiuser Detection&quot;, &lt;a
href=&quot;http://dx.doi.org/10.1109/TIT.2005.850075&quot;&gt;&lt;cite&gt;IEEE Transactions on
Information Theory&lt;/cite&gt; &lt;strong&gt;51&lt;/strong&gt; (2005): 2475--2490&lt;/a&gt;
	&lt;li&gt;Xiaoxi Zhang, Timothy D. Johnson, Roderick J. A. Little, Yue Cao,
&quot;Quantitative magnetic resonance image analysis via the EM algorithm with stochastic variation&quot;, &lt;cite&gt;Annals of Applied Statistics&lt;/cite&gt; &lt;strong&gt;2&lt;/strong&gt;
(2008): 736--755 = &lt;a href=&quot;http://arxiv.org/abs/0807.4672&quot;&gt;arxiv:0807.4672&lt;/a&gt;
	&lt;li&gt;Or Zuk, Eytan Domany, Ido Kanter, Michael Aizenman
		&lt;ul&gt;
		&lt;li&gt;&quot;Taylor series
expansions for the entropy rate of Hidden Markov
Processes&quot;, &lt;a href=&quot;http://arxiv.org/abs/cs.IT/0510005&quot;&gt;cs.IT/0510005&lt;/a&gt;
		&lt;li&gt;&quot;From finite-system entropy to entropy rate for a Hidden
Markov Process&quot;, &lt;a href=&quot;http://arxiv.org/abs/cs.IT/0510016&quot;&gt;cs.IT/0510016&lt;/a&gt;
		&lt;/ul&gt;
	&lt;/ul&gt;
</description>
  </item>
  </channel>
</rss>
