Almost-sure path properties of (2, d, β)-superprocesses

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Sure Recurrence of the Simple Random Walk Path

It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.

متن کامل

ALMOST SURE FINITENESS FOR THE TOTAL OCCUPATION TIME OF AN (d,α,β)-superprocess

For 0 < α ≤ 2 and 0 < β ≤ 1 the (d,α,β)-superprocess is the superprocess with symmetric α-stable spatial movement in Rd and spectrally positive (1+β)-stable branching. It is a measurevalued process arising as the high density limit of empirical measure for the following critical branching symmetric α-stable particle system. Independent of the others, each particle is assigned a mass n−1 and it ...

متن کامل

Almost Sure Convergence of Products of 2× 2 Nonnegative Matrices

Abstract. We study the almost sure convergence of the normalized columns in an infinite product of nonnegative matrices, and the almost sure rank one property of its limit points. Given a probability on the set of 2 × 2 nonnegative matrices, with finite support A = {A(0), . . . , A(s − 1)}, and assuming that at least one of the A(k) is not diagonal, the normalized columns of the product matrix ...

متن کامل

'Almost Sure' Chaotic Properties of Machine Learning Methods

It has been demonstrated earlier that universal computation is ‘almost surely’ chaotic. Machine learning is a form of computational fixed point iteration, iterating over the computable function space. We showcase some properties of this iteration, and establish in general that the iteration is ‘almost surely’ of chaotic nature. This theory explains the observation in the counter intuitive prope...

متن کامل

Deductive Proofs of Almost Sure Persistence and Recurrence Properties

Martingale theory yields a powerful set of tools that have recently been used to prove quantitative properties of stochastic systems such as stochastic safety and qualitative properties such as almost sure termination. In this paper, we examine proof techniques for establishing almost sure persistence and recurrence properties of infinite-state discrete time stochastic systems. A persistence pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1994

ISSN: 0304-4149

DOI: 10.1016/0304-4149(94)90043-4