Cell contamination and branching processes in a random environment with immigration

Advances in Applied Probability

Volumn 41, Issue 4, 2009, Pages 1059-1081

  Bansaye, Vincent ^a,b  

^a SORBONNE UNIVERSITÉ   (France)

^b CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

Author keywords

Branching processes in a random environment with immigration; Empirical measure; Markov chain indexed by a tree; Renewal theorem

Indexed keywords

CELL CULTURE; CELL PROLIFERATION; ENVIRONMENTAL REGULATIONS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS;

ASYMPTOTIC BEHAVIORS; BRANCHING PROCESS; CONVERGENCE IN DISTRIBUTION; EMPIRICAL MEASURE; LAW OF LARGE NUMBERS; RANDOM ENVIRONMENT; RENEWAL THEOREM; STATE-DEPENDENT IMMIGRATION;

CELLS;

EID: 77949294241     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1261669586     Document Type: Article

References (25)

1. Alon, N. and Spencer, J. H. (2000). The Probabilistic Method, 2nd edn. JohnWiley, NewYork.
2. Barrière, L., Fraigniaud, P., Narayanan, L. and Opatrny, J. (2003). Robust position-based routeing in wireless ad hoc networks with irregular transmission range. Wireless Commun. Mobile Comput. 3, 141-153.
3. Bern, M., Eppstein, D. and Yao, F. (1991). The expected extremes in a Delaunay triangulation. Internat. J. Comput. Geometry Appl. 1, 79-91.
4. Bose, P., Morin, P., Stojmenovíc, I. and Urrutia, J. (2001). Routeing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7, 609-616.
5. Chernoff, H. (1952). A measure of the asymptotic efficient of tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23, 493-507.
6. Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C. (2006). Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, Massachussets.
7. Devroye, L. (1988). The expected size of some graphs in computational geometry. Comput. Math. Appl. 15, 53-64.
8. Gabriel, K. R. and Sokal, R. R. (1969).Anewstatistical approach to geographic variation analysis. Systematic Zoology 18, 259-278.
9. Glick, N. (1978). Breaking records and breaking boards. Amer. Math. Monthly 85, 2-26.
10. Grünewald, M., Lukovszki, T., Schindelhauer, C. and Volbert, K. (2002). Distributed maintenance of resource efficient wireless network topologies. In Proc. 8th Internat. Euro-Par Conf. Parallel Processing, Springer, Berlin, pp. 935-946.
11. Karp, B. and Kung, H. T. (2000). GPSR: greedy perimeter stateless routeing for wireless networks. In Proc. 6th Annual Internat. Conf. Mobile Comput. Networking, ACM, NewYork, pp. 243-254.
12. Li, X.-Y., Wan, P.-J. and Wang, Y. (2001). Power efficient and sparse spanner for wireless ad hoc networks. In IEEE Internat. Conf. Computer Commun. Networks (ICCCN01), Scottsdale, Arizona, pp. 564-567.
13. Matula, D.W. and Sokal, R. R. (1980). Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geographical Analysis 12, 205-222.
14. Meester, R. and Roy, R. (1996). Continuum Percolation (Camb. Tracts Math. 119). Cambridge University Press.
15. Narasimhan, G. and Smid, M. (2007). Geometric Spanner Networks. Cambridge University Press.
16. Penrose, M. (2003). Random Geometric Graphs (Oxford Stud. Prob. 5). Oxford University Press.
17. Penrose, M. D. and Yukich, Y. E. (2003). Weak laws of large numbers in geometric probability. Ann. Appl. Prob. 13, 277-303.
18. Schindelhauer, C., Volbert, K. and Ziegler, M. (2007). Geometric spanners with applications in wireless networks. Comput. Geometry 36, 197-214.
19. Ta, X., Mao, G. and Anderson, B. D. O. (2009). On the phase transition width of K-connectivity in wireless multihop networks. IEEE Trans. Mobile Comput. 8, 936-949.
20. Toussaint, G. T. (1980). Pattern recognition and geometrical complexity. In Proc. 5th Internat. Conf. Pattern Recognition, pp. 1324-1347.
21. Toussaint, G. T. (1980). The relative neighborhood graph of a finite planar set. Pattern Recognition 12, 261-268.
22. Toussaint, G. T. (1982). Computational geometric problems in pattern recognition. In Pattern Recognition Theory and Applications (NATOAdv. Study Inst. Ser. C: Math. Phys. Sci. 81), Reidel, Dordrecht, eds J. Kittler, K. S. Fu, and L. F. Pau, pp. 73-91.
23. Wang, Y. and Li, X.-Y. (2006). Localized construction of bounded degree and planar spanner for wireless ad hoc networks. ACM Mobile Network Appl. 11, 161-175.
24. Wattenhofer, R., Li, L., Bahl, P. and Wang, Y. (2001). Distributed topology control for wireless multihop ad hoc networks. In Proc. IEEE INFOCOM, pp. 1388-1397.
25. Yao, A. C.-C. (1982). On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11, 721-736.