scholarly journals Large Deviations Properties of Maximum Entropy Markov Chains from Spike Trains

Entropy ◽  
2018 ◽  
Vol 20 (8) ◽  
pp. 573 ◽  
Author(s):  
Rodrigo Cofré ◽  
Cesar Maldonado ◽  
Fernando Rosas
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Large Deviations ◽  
Maximum Entropy ◽  
Statistical Physics ◽  
Large Deviation ◽  
Thermodynamic Formalism ◽  
Spike Trains ◽  
Statistical Fluctuation ◽  
Inference Problem

We consider the maximum entropy Markov chain inference approach to characterize the collective statistics of neuronal spike trains, focusing on the statistical properties of the inferred model. To find the maximum entropy Markov chain, we use the thermodynamic formalism, which provides insightful connections with statistical physics and thermodynamics from which large deviations properties arise naturally. We provide an accessible introduction to the maximum entropy Markov chain inference problem and large deviations theory to the community of computational neuroscience, avoiding some technicalities while preserving the core ideas and intuitions. We review large deviations techniques useful in spike train statistics to describe properties of accuracy and convergence in terms of sampling size. We use these results to study the statistical fluctuation of correlations, distinguishability, and irreversibility of maximum entropy Markov chains. We illustrate these applications using simple examples where the large deviation rate function is explicitly obtained for maximum entropy models of relevance in this field.

scholarly journals Large Deviations Properties of Maximum Entropy Markov Chains from Spike Trains

2018 ◽  
Author(s):  
Rodrigo Cofré ◽  
Cesar Maldonado ◽  
Fernando Rosas
Keyword(s):  
Markov Chains ◽  
Large Deviations ◽  
Maximum Entropy ◽  
Large Deviation ◽  
Spike Trains ◽  
Rate Function ◽  
Statistical Fluctuation ◽  
Maximum Entropy Models ◽  
Deviation Rate Function ◽  
Neuronal Spike Trains

We consider the maximum entropy Markov chain inference approach to characterize the collective statistics of neuronal spike trains, focusing on the statistical properties of the inferred model. We review large deviations techniques useful in this context to describe properties of accuracy and convergence in terms of sampling size. We use these results to study the statistical fluctuation of correlations, distinguishability and irreversibility of maximum entropy Markov chains. We illustrate these applications using simple examples where the large deviation rate function is explicitly obtained for maximum entropy models of relevance in this field.

Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains

1990 ◽  
Vol 27 (1) ◽  
pp. 44-59 ◽  
Author(s):  
James A Bucklew ◽  
Peter Ney ◽  
John S. Sadowsky
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Markov Chain ◽  
Markov Chains ◽  
Large Deviations ◽  
Large Deviation ◽  
Homogeneous Markov Chain ◽  
Underlying Distribution ◽  
Monte Carlo Simulation Technique ◽  
Large Deviations Theory

Importance sampling is a Monte Carlo simulation technique in which the simulation distribution is different from the true underlying distribution. In order to obtain an unbiased Monte Carlo estimate of the desired parameter, simulated events are weighted to reflect their true relative frequency. In this paper, we consider the estimation via simulation of certain large deviations probabilities for time-homogeneous Markov chains. We first demonstrate that when the simulation distribution is also a homogeneous Markov chain, the estimator variance will vanish exponentially as the sample size n tends to∞. We then prove that the estimator variance is asymptotically minimized by the same exponentially twisted Markov chain which arises in large deviation theory, and furthermore, this optimization is unique among uniformly recurrent homogeneous Markov chain simulation distributions.

scholarly journals Extended Laplace principle for empirical measures of a Markov chain

2019 ◽  
Vol 51 (01) ◽  
pp. 136-167 ◽  
Author(s):  
Stephan Eckstein
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Large Deviations ◽  
Large Deviation ◽  
Dual Pair ◽  
Wasserstein Distance ◽  
Large Deviations Principle ◽  
Empirical Measures ◽  
Leibler Divergence ◽  
Laplace Principle

AbstractWe consider discrete-time Markov chains with Polish state space. The large deviations principle for empirical measures of a Markov chain can equivalently be stated in Laplace principle form, which builds on the convex dual pair of relative entropy (or Kullback– Leibler divergence) and cumulant generating functional f ↦ ln ʃ exp (f). Following the approach by Lacker (2016) in the independent and identically distributed case, we generalize the Laplace principle to a greater class of convex dual pairs. We present in depth one application arising from this extension, which includes large deviation results and a weak law of large numbers for certain robust Markov chains—similar to Markov set chains—where we model robustness via the first Wasserstein distance. The setting and proof of the extended Laplace principle are based on the weak convergence approach to large deviations by Dupuis and Ellis (2011).

Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains

1990 ◽  
Vol 27 (01) ◽  
pp. 44-59 ◽  
Author(s):  
James A Bucklew ◽  
Peter Ney ◽  
John S. Sadowsky
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Markov Chain ◽  
Markov Chains ◽  
Large Deviations ◽  
Large Deviation ◽  
Homogeneous Markov Chain ◽  
Underlying Distribution ◽  
Monte Carlo Simulation Technique ◽  
Large Deviations Theory

Importance sampling is a Monte Carlo simulation technique in which the simulation distribution is different from the true underlying distribution. In order to obtain an unbiased Monte Carlo estimate of the desired parameter, simulated events are weighted to reflect their true relative frequency. In this paper, we consider the estimation via simulation of certain large deviations probabilities for time-homogeneous Markov chains. We first demonstrate that when the simulation distribution is also a homogeneous Markov chain, the estimator variance will vanish exponentially as the sample size n tends to∞. We then prove that the estimator variance is asymptotically minimized by the same exponentially twisted Markov chain which arises in large deviation theory, and furthermore, this optimization is unique among uniformly recurrent homogeneous Markov chain simulation distributions.

Markov Chains in Many Dimensions

1994 ◽  
Vol 26 (3) ◽  
pp. 756-774 ◽  
Author(s):  
Dimitris N. Politis
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Maximum Entropy ◽  
Stationary Distribution ◽  
Random Fields ◽  
Special Class ◽  
Markov Random Fields ◽  
One Dimension ◽  
Stationary Markov Chain ◽  
Markov Random

A generalization of the notion of a stationary Markov chain in more than one dimension is proposed, and is found to be a special class of homogeneous Markov random fields. Stationary Markov chains in many dimensions are shown to possess a maximum entropy property, analogous to the corresponding property for Markov chains in one dimension. In addition, a representation of Markov chains in many dimensions is provided, together with a method for their generation that converges to their stationary distribution.

Stochastic scrabble: large deviations for sequences with scores

1988 ◽  
Vol 25 (1) ◽  
pp. 106-119 ◽  
Author(s):  
Richard Arratia ◽  
Pricilla Morris ◽  
Michael S. Waterman
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Law Of Large Numbers ◽  
Large Deviation ◽  
Additive Functional ◽  
Finite Alphabet ◽  
Real Numbers ◽  
Similar Treatment ◽  
Large Numbers ◽  
Large Deviation Result

A derivation of a law of large numbers for the highest-scoring matching subsequence is given. Let Xk, Yk be i.i.d. q=(q(i))i∊S letters from a finite alphabet S and v=(v(i))i∊S be a sequence of non-negative real numbers assigned to the letters of S. Using a scoring system similar to that of the game Scrabble, the score of a word w=i1 · ·· im is defined to be V(w)=v(i1) + · ·· + v(im). Let Vn denote the value of the highest-scoring matching contiguous subsequence between X1X2 · ·· Xn and Y1Y2· ·· Yn. In this paper, we show that Vn/K log(n) → 1 a.s. where K ≡ K(q,v). The method employed here involves ‘stuttering’ the letters to construct a Markov chain and applying previous results for the length of the longest matching subsequence. An explicit form for β ∊Pr(S), where β (i) denotes the proportion of letter i found in the highest-scoring word, is given. A similar treatment for Markov chains is also included.Implicit in these results is a large-deviation result for the additive functional, H ≡ Σn < τv(Xn), for a Markov chain stopped at the hitting time τ of some state. We give this large deviation result explicitly, for Markov chains in discrete time and in continuous time.

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

1992 ◽  
Vol 1 (4) ◽  
pp. 351-370 ◽  
Author(s):  
Alistair Sinclair
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Statistical Physics ◽  
Flow Problem ◽  
Low Cost ◽  
Multicommodity Flow ◽  
Approximate Counting ◽  
Mixing Rate ◽  
Combinatorial Structures ◽  
Multicommodity Flow Problem

The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The efficiency of the resulting algorithms depends crucially on the mixing rate of the chain, i.e., the time taken for it to reach its stationary or equilibrium distribution.The paper presents a new upper bound on the mixing rate, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph. The bound gives sharper estimates for the mixing rate of several important complex Markov chains. As a result, improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system. Moreover, solutions to the multicommodity flow problem are shown to capture the mixing rate quite closely: thus, under fairly general conditions, a Markov chain is rapidly mixing if and only if it supports a flow of low cost.

Large deviations for longest runs in Markov chains

2020 ◽  
Vol 26 (2) ◽  
pp. 309-314
Author(s):  
Zhenxia Liu ◽  
Yurong Zhu
Keyword(s):  
Distribution Function ◽  
Markov Chain ◽  
Markov Chains ◽  
Present Note ◽  
Large Deviation Principle ◽  
Large Deviation ◽  
Large Deviation Principles ◽  
Success Run ◽  
Longest Success Run ◽  
Math Statist

AbstractWe continue our investigation on general large deviation principles (LDPs) for longest runs. Previously, a general LDP for the longest success run in a sequence of independent Bernoulli trails was derived in [Z. Liu and X. Yang, A general large deviation principle for longest runs, Statist. Probab. Lett. 110 2016, 128–132]. In the present note, we establish a general LDP for the longest success run in a two-state (success or failure) Markov chain which recovers the previous result in the aforementioned paper. The main new ingredient is to implement suitable estimates of the distribution function of the longest success run recently established in [Z. Liu and X. Yang, On the longest runs in Markov chains, Probab. Math. Statist. 38 2018, 2, 407–428].

scholarly journals Event-Chain Monte Carlo: Foundations, Applications, and Prospects

2021 ◽  
Vol 9 ◽  
Author(s):  
Werner Krauth
Keyword(s):  
Aqueous Solution ◽  
Monte Carlo ◽  
Markov Chain ◽  
Markov Chains ◽  
Real World ◽  
Continuous Time ◽  
Statistical Physics ◽  
Reversible Markov Chains ◽  
Sampling Problem ◽  
Review Reports

This review treats the mathematical and algorithmic foundations of non-reversible Markov chains in the context of event-chain Monte Carlo (ECMC), a continuous-time lifted Markov chain that employs the factorized Metropolis algorithm. It analyzes a number of model applications and then reviews the formulation as well as the performance of ECMC in key models in statistical physics. Finally, the review reports on an ongoing initiative to apply ECMC to the sampling problem in molecular simulation, i.e., to real-world models of peptides, proteins, and polymers in aqueous solution.

Markov Chains in Many Dimensions

1994 ◽  
Vol 26 (03) ◽  
pp. 756-774 ◽  
Author(s):  
Dimitris N. Politis
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Maximum Entropy ◽  
Stationary Distribution ◽  
Random Fields ◽  
Special Class ◽  
Markov Random Fields ◽  
One Dimension ◽  
Stationary Markov Chain ◽  
Markov Random

A generalization of the notion of a stationary Markov chain in more than one dimension is proposed, and is found to be a special class of homogeneous Markov random fields. Stationary Markov chains in many dimensions are shown to possess a maximum entropy property, analogous to the corresponding property for Markov chains in one dimension. In addition, a representation of Markov chains in many dimensions is provided, together with a method for their generation that converges to their stationary distribution.

Sign in / Sign up

Export Citation Format

Share Document