Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars

We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ε), where ε>0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open problems regarding the computational complexity of computing key quantities associated with some classic and heavily studied stochastic processes, including multi-type branching processes and stochastic context-free grammars.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  Javier Esparza,et al.  Computing Least Fixed Points of Probabilistic Systems of Polynomials , 2010, STACS.

[3]  Kousha Etessami,et al.  Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems , 2008, QEST.

[4]  Kristoffer Arnsfelt Hansen,et al.  Exact algorithms for solving stochastic games: extended abstract , 2011, STOC.

[5]  Clarence Zener,et al.  Geometric Programming , 1974 .

[6]  Kousha Etessami,et al.  Model Checking of Recursive Probabilistic Systems , 2012, TOCL.

[7]  R. C. Underwood,et al.  Stochastic context-free grammars for tRNA modeling. , 1994, Nucleic acids research.

[8]  Kousha Etessami,et al.  PReMo : An Analyzer for P robabilistic Re cursive Mo dels , 2007, TACAS.

[9]  P. Cameron.  Combinatorics: Topics, Techniques, Algorithms , 1995 .

[10]  Leeuwaarden van Jsh,et al.  Quasi-birth-death processes with an explicit rate matrix , 2004 .

[11]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[12]  Anna R. Karlin,et al.  Random walks with “back buttons” (extended abstract) , 2000, STOC '00.

[13]  T. Apostol.  Mathematical Analysis , 1957 .

[14]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[15]  Kousha Etessami,et al.  On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..

[16]  Giorgio Satta,et al.  Computing Partition Functions of PCFGs , 2008 .

[17]  Peter Bro Miltersen,et al.  2 The Task of a Numerical Analyst , 2022 .

[18]  Fernando Pereira,et al.  Relating Probabilistic Grammars and Automata , 1999, ACL.

[19]  Michael Luttenberger,et al.  Computing the Least Fixed Point of Positive Polynomial Systems , 2010, SIAM J. Comput..

[20]  P. Jagers,et al.  Branching Processes: Variation, Growth, and Extinction of Populations , 2005 .

[21]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[22]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.

[23]  H. Keller,et al.  Analysis of Numerical Methods , 1969 .

[24]  Giorgio Satta,et al.  Probabilistic Parsing , 2008, New Developments in Formal Languages and Applications.

[25]  J. Esparza,et al.  Model checking probabilistic pushdown automata , 2004, LICS 2004.

[26]  Gemma Bel-Enguix,et al.  New Developments in Formal Languages and Applications , 2008, New Developments in Formal Languages and Applications.

[27]  Marek Kimmel,et al.  Branching processes in biology , 2002 .

[28]  Sean R. Eddy,et al.  Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .

[29]  Anna R. Karlin,et al.  Random walks with `back buttons' , 2001, STOC 2000.

[30]  Steve Young,et al.  Applications of stochastic context-free grammars using the Inside-Outside algorithm , 1990 .

[31]  Kousha Etessami,et al.  Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations , 2012, ICALP.

[32]  Kousha Etessami,et al.  Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars , 2012, ArXiv.

[33]  Imre Pázsit,et al.  Neutron Fluctuations: A Treatise on the Physics of Branching Processes , 2007 .

[34]  Vladimir Solmon,et al.  The estimation of stochastic context-free grammars using the Inside-Outside algorithm , 2003 .

[35]  Javier Esparza,et al.  Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).