Hostname: page-component-77c89778f8-9q27g Total loading time: 0 Render date: 2024-07-17T23:34:21.697Z Has data issue: false hasContentIssue false

Filtering of a branching process given its split times

Published online by Cambridge University Press:  14 July 2016

Claudia Ceci*
Affiliation:
Università di Firenze
Anna Gerardi*
Affiliation:
Università de L'Aquila
*
Postal address: Istituto di Matematica, Università di Firenze, Italy.
∗∗Postal address: Dip. Ingegneria Elettrica, Università de L' Aquila, Italy.

Abstract

A filtering problem for a branching process is studied within the tree framework, and the minimal intensity of the splitting process is given.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1997 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Athreya, K. B. and Ney, P. E. (1972) Branching Processes. Springer, Berlin.CrossRefGoogle Scholar
[2] Bremaud, P. (1980) Point Processes and Queues. Springer, Berlin.Google Scholar
[3] Calzolari, A. and Nappo, G. (1997) A filtering problem with counting observation: approximation with error bounds. Stoch. Rep. to appear.Google Scholar
[4] Ceci, C., Gerardi, A. and Mazliak, L. (1996) Some results about stopping times on the marked tree space. Theory Prob. Appl. 41, 578590.Google Scholar
[5] Ceci, C. and Mazliak, L. (1992) Une propriété forte de branchements. C. R. Acad. Sci. Paris 315, 851853.Google Scholar
[6] Ceci, C. and Mazliak, L. (1994) Controlled trees. Rebrape 8, 93105.Google Scholar
[7] Chauvin, B. (1991) Product martingales and stopping lines for branching Brownian motion. Ann. Prob. 19, 11951205.Google Scholar
[8] Neveu, J. (1986) Arbres et processus de Galton-Watson. Ann. Inst. H. Poincaré Prob. Statist. 22, 199207.Google Scholar