Basics of Counting Statistics


IEICE TRANSACTIONS on Communications   Vol.E96-B   No.11   pp.2733-2740
Publication Date: 2013/11/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E96.B.2733
Print ISSN: 0916-8516
Type of Manuscript: INVITED PAPER (Special Section on Progress in Information Network Science)
stochasticity,  numerical method,  generating function approach,  path-integral approach,  

Full Text: FreePDF

In this paper, we briefly review the scheme of counting statistics, in which a probability of the number of monitored or target transitions in a Markov jump process is evaluated. It is generally easy to construct a master equation for the Markov jump process, and the counting statistics enables us to straightforwardly obtain basic equations of the counting statistics from the master equation; the basic equation is used to calculate the cumulant generating function of the probability of the number of target transitions. For stationary cases, the probability is evaluated from the eigenvalue analysis. As for the nonstationary cases, we review a numerical integration scheme to calculate the statistics of the number of transitions.