Almost sure finiteness for the total occupation time of an -superprocess.
Electronic Communications in Probability [electronic only] (2010)
- Volume: 15, page 22-31
- ISSN: 1083-589X
Access Full Article
topHow to cite
topZhou, Xiaowen. "Almost sure finiteness for the total occupation time of an -superprocess.." Electronic Communications in Probability [electronic only] 15 (2010): 22-31. <http://eudml.org/doc/228657>.
@article{Zhou2010,
author = {Zhou, Xiaowen},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {superprocess; occupation time; branching particle system; almost sure local extinction; -stable process; stable branching process; Feynman-Kac formula; Borel-cantelli Lemma; -stable process},
language = {eng},
pages = {22-31},
publisher = {University of Washington},
title = {Almost sure finiteness for the total occupation time of an -superprocess.},
url = {http://eudml.org/doc/228657},
volume = {15},
year = {2010},
}
TY - JOUR
AU - Zhou, Xiaowen
TI - Almost sure finiteness for the total occupation time of an -superprocess.
JO - Electronic Communications in Probability [electronic only]
PY - 2010
PB - University of Washington
VL - 15
SP - 22
EP - 31
LA - eng
KW - superprocess; occupation time; branching particle system; almost sure local extinction; -stable process; stable branching process; Feynman-Kac formula; Borel-cantelli Lemma; -stable process
UR - http://eudml.org/doc/228657
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.