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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 579-588

  Etessami, Kousha ^a   Stewart, Alistair ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

polynomial time algorithms; probabilistic systems of polynomial equations

Indexed keywords

ADDITIVE ERRORS; FIXED POINTS; MODEL OF COMPUTATION; MULTI-TYPE BRANCHING; MULTIVARIATE SYSTEMS; POLYNOMIAL EQUATION; POLYNOMIAL-TIME ALGORITHMS; STOCHASTIC CONTEXT FREE GRAMMAR; SYSTEM OF EQUATIONS; TIME POLYNOMIALS;

COMPUTATION THEORY; CONTEXT FREE GRAMMARS; RANDOM PROCESSES; TURING MACHINES;

POLYNOMIALS;

EID: 84862627804     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214030     Document Type: Conference Paper

References (24)

1. S. P. Abney, D. A. McAllester, and F. Pereira. Relating probabilistic grammars and automata. In Proc. of 27th Meeting of the Ass. for Computational Linguistics (ACL'99), pages 542-549, 1999.
2. E. Allender, P. Bürgisser, J. Kjeldgaard-Pedersen, and P. B. Miltersen. On the complexity of numerical analysis. SIAM J. Comput., 38(5):1987-2006, 2009.
3. T. Apostol. Mathematical Analysis. Addison-Wesley, 2nd edition, 1974.
4. T. Brázdil, J. Esparza, and A. Kučera. Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion. In Proc. FOCS, pages 521-530, 2005.
5. R. J. Duffin, E. L. Peterson, and C. Zener. Geometric Programming. John Wiley and Sons, 1967.
6. R. Durbin, S. R. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis: Probabilistic models of Proteins and Nucleic Acids. Cambridge U. Press, 1999.
7. J. Esparza, A. Gaiser, and S. Kiefer. Computing least xed points of probabilistic systems of polynomials. In Proc. 27th STACS, pages 359-370, 2010.
8. J. Esparza, S. Kiefer, and M. Luttenberger. Computing the least fixed point of positive polynomial systems. SIAM Journal on Computing, 39(6):2282-2355, 2010.
9. J. Esparza, A. Kučera, and R. Mayr. Model checking probabilistic pushdown automata. Logical Methods in Computer Science, 2(1):1-31, 2006.
10. K. Etessami, A. Stewart, and M. Yannakakis. Polynomial-time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations. ArXiv:1202.4798, 2012.
11. K. Etessami, A. Stewart, and M. Yannakakis. Polynomial-time algorithms for multi-type branching processes and stochastic context-free grammars. In Proc. 44th ACM Symposium on Theory of Computing (STOC), 2012. ArXiv:1201.2374 (full preprint of this paper).
12. K. Etessami, D. Wojtczak, and M. Yannakakis. Quasi-birth-death processes, tree-like QBDs, probabilistic 1-counter automata, and pushdown systems. Perform. Eval., 67(9):837-857, 2010.
13. K. Etessami and M. Yannakakis. Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations. Journal of the ACM, 56(1), 2009.
14. K. Etessami and M. Yannakakis. On the complexity of Nash equilibria and other fixed points. SIAM Journal on Computing, 39(6):2531-2597, 2010.
15. K. Etessami and M. Yannakakis. Model checking of recursive probabilistic systems. ACM Transactions on Computational Logic, 13(2), 2012 (available online).
16. R. Fagin, A. Karlin, J. Kleinberg, P. Raghavan, S. Rajagopalan, R. Rubinfeld, M. Sudan, and A. Tomkins. Random walks with "back buttons". In Proc. ACM Symp. on Theory of Computing (STOC), pages 484-493, 2000.
17. P. Haccou, P. Jagers, and V. A. Vatutin. Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge U. Press, 2005.
18. T. E. Harris. The Theory of Branching Processes. Springer-Verlag, 1963.
19. M. Kimmel and D. E. Axelrod. Branching processes in biology. Springer, 2002.
20. A. N. Kolmogorov and B. A. Sevastyanov. The calculation of nal probabilities for branching random processes. Doklady, 56:783-786, 1947. (Russian).
21. C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
22. M.-J. Nederhof and G. Satta. Computing partition functions of PCFGs. Research on Language and Computation, 6(2):139-162, 2008.
23. M.-J. Nederhof and G. Satta. Probabilistic parsing. New Developments in Formal Languages and Applications, 113:229-258, 2008.
24. D. Wojtczak and K. Etessami. Premo: an analyzer for probabilistic recursive models. In Proc. 13th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 66-71, 2007.