Immigration Structures Associated with Dawson-Watanabe Superprocesses

Total Page:16

File Type:pdf, Size:1020Kb

Immigration Structures Associated with Dawson-Watanabe Superprocesses View metadata, citation and similar papers at core.ac.uk brought to you COREby provided by Elsevier - Publisher Connector stochastic processes and their applications ELSEVIER StochasticProcesses and their Applications 62 (1996) 73 86 Immigration structures associated with Dawson-Watanabe superprocesses Zeng-Hu Li Department of Mathematics, Beijing Normal University, Be!ring 100875, Peoples Republic of China Received March 1995: revised November 1995 Abstract The immigration structure associated with a measure-valued branching process may be described by a skew convolution semigroup. For the special type of measure-valued branching process, the Dawson Watanabe superprocess, we show that a skew convolution semigroup corresponds uniquely to an infinitely divisible probability measure on the space of entrance laws for the underlying process. An immigration process associated with a Borel right superpro- cess does not always have a right continuous realization, but it can always be obtained by transformation from a Borel right one in an enlarged state space. Keywords: Dawson-Watanabe superprocess; Skew convolution semigroup; Entrance law; Immigration process; Borel right process AMS classifications: Primary 60J80; Secondary 60G57, 60J50, 60J40 I. Introduction Let E be a Lusin topological space, i.e., a homeomorphism of a Borel subset of a compact metric space, with the Borel a-algebra .N(E). Let B(E) denote the set of all bounded ~(E)-measurable functions on E and B(E) + the subspace of B(E) compris- ing non-negative elements. Denote by M(E) the space of finite measures on (E, ~(E)) equipped with the topology of weak convergence. Forf e B(E) and # e M(E), write ~l(f) for ~Efd/~. Suppose that ~ = (~?,,N, St, ~,,Px) is a Borel right process in E with semigroup (Pt)t ~ o and 4> is a branching mechanism given by 4)(x,z)=b(x)z +c(x)z 2+ (e .... 1 + zu)m(x, du), xeE, z >~O, (1.1) Research supported by the National Education Committee of China. 0304-4149/96/$15.00 ~" 1996 Elsevier Science B.V. All rights reserved SSDI 0304-4149(95)00087-9 74 Z-H. Li / Stochastic Processes and their Applications 62 (1996) 73-86 where b • B(E), c • B(E) + and [u A u 2 ] m(x, du) is a bounded kernel from E to (0, oo). From a general construction in Fitzsimmons (1988, 1992) we have that for each f• B(E) + the evolution equation v,f(x)+ fldsf 4)(y,VJ(y))P, ~(x, dy)=Ptf(x), t>~O, xeE, (1.2) has a unique solution Vtf• B(E) +, and there is a Markov semigroup (Qt)t~>o on M(E) such that f~t e-"lS)Qt(/t, dv ) = exp{ -/t(V,f)}, t >~ O, ll M(E). (1.3) (E) Furthermore, (Q,),~o is the transition semigroup of a Borel right process X = (W, ~, ~, Xt, Q,). The process X is called a Dawson-Watanabe superprocess with parameters (~, qS), or simply a (~, c~)-superprocess. The (~, ~b)-superprocess is a special form of the measure-valued branching process (MB-process), which is a kind of measure-valued Markov process with transition semi- group satisfying the branching property (1.3) with Vt fdefined by Vtf(x)= -log[ e-~J)@(bx, dv), t>~O,x•E, (1.4) JM ~E) where 6x denotes the unit mass at x • E. See e.g. Dawson (1993) and Watanabe (1968). An MB-process X is the mathematical model for the evolution of a population in some region whose growth and decay is subject to the law of chance. If we consider a situation where there are some additional sources of population from which immigration into the region occurs during the evolution, we need to introduce a measure-valued immigration process. Several authors have constructed measure- valued immigration processes under different hypotheses; see e.g. Dynkin (1991), Gorostiza et al. (1990), Li (1992) and Shiga (1990). As observed in Li (1995), a special type of immigration associated with the MB-process may be described by a flow of probability measures that solves an equation with a kind of skew product: Let (Nt)t >1o be probability measures on M(E). We call (Nt)t >~o a skew convolution semigroup associated with X or (Qt)t >1o if Nr+,=(NcQ,),N,, r,t >~O, (1.5) where "," denotes the convolution operation. The relation (1.5) holds if and only if QN(#,'):=Q,(I~,')*N,, t >~O,t~eM(E), (1.6) defines a Markov semigroup (Q~)~/> o on M(E). In view of (1.6), if Y is a Markov process in M(E) having transition semigroup (Q,)tN >~o, we call it an immigration process associated with X. It was proved in Li (1995) that the family of probability measures (Nt),/> o is a skew convolution semigroup associated with (Q,), >~o if and only if there is an infinitely divisible probability entrance law (Kt)t > o for (Qt), ~> o such that logf~,,e)e-"~Z'Nt(dv) = f] [logfM~)e-"~z)K~(dv)]ds (1.7) Z-H. Li / Stochastic Processes and their Applications 62 (/996) 73 86 75 for all t>~ 0 and feB(E) +. Therefore, the immigration structures associated with an M B-process may be characterized by its infinitely divisible probability entrance laws. The purpose of this paper is to describe the set of infinitely divisible probability entrance laws for the (~, ~b)-superprocess and to discuss the regularities of the corres- ponding immigration processes. By characterizing all those entrance laws we find some immigration processes which have not been studied in the literature. An example given at the end of the paper shows that an immigration process associated with the Borel right (~, 4))-superprocess may have no right continuous realization. The general theory of Markov processes developed in Sharpe (1988) provides important tools for the study. In Section 2 we prove a 1-1 correspondence between minimal probability entrance laws for the (~, ~b)-superprocess and entrance laws for the underlying process ~, using an argument of lifting and projecting adapted from Dynkin (1989). In Section 3 we show that each infinitely divisible probability entrance law for the superprocess is determined uniquely by an infinitely divisible probability measure on the space of entrance laws for the underlying process. In Section 4 we study the basic regularities of the immigration processes. If the infinitely divisible probability entrance law for the superprocess can be closed by a probability measure on M(E), it yields a Borel right immigration process. In Section 5 it is shown that a "good" version of the general immigration process may be obtained by transformation from a Borel right one in an enlarged state space. The problems considered in this paper are similar to those in Li et al. (1993) and Li and Shiga (1995), although the basic hypotheses and formulations are different. In Li et al. (1993) we discussed Feller processes and in Li and Shiga (1995) we were only interested in diffusions. 2. Minimal probability entrance laws Let us consider a change of form of (1.2). Define the semigroup of bounded kernels (P~),~ob on E by P~.f(x) = Pxf(~t) exp{- fl b(~.~)ds}. (2.1) Then (1.2) is equivalent to Vt.f(x) + fl ds fw q~o(Y, Vs f(y))P~ ,~(x,dy)= P~.f(x), (2.2) where ~bo(X,Z) = c(x)z 2 + (e -z" - 1 + zu)m(x, du). (2.3) 76 Z-H. Li / Stochastic Processes and their Applications 62 (1996) 73-86 Note that the first moments of the (~, q~)-superprocess are given by MIE) V(f) Q,(p, dv) =/~(P~ f). (2.4) See e.g. Fitzsimmons (1988). Given a semigroup of bounded kernels (Tt)t ~> o on E, we denote by .;¢'(T) the set of entrance laws x = (x,),>o for (Tt)t ~ o that satisfy flKs(E)ds ,< oc for all t > 0. (2.5) Let Y{ ~(Q) denote the set of probability entrance laws K = (K,)t > o for the semigroup (Qt)t ~ o such that itds(v(E)K~(dv) < Go for all t > 0, (2.6) 3o dM (E) and let Yd~(Q) denote the subset of .~ ~(Q) comprising minimal elements. See e.g. Sharpe (1988) for the definition of an entrance law. Theorem 2.1. There is a one-to-one correspondence between K~ff~(Q) and ~ )ff(pb), which is given by 7,(f) = ( v(f)Kt(dv), (2.7) dM (E) and f~t e-"(f)Kt(dv) = exp{ - Stb(7, f)}, (2.8) (E) where SP(7, f) = 7t(f) -- fo;ds ~bo(y, Vs f(y))Tt-s(dy). (2.9) We omit the proof of the above theorem, which follows from (1.3) and (2.4) by the same argument as Dynkin (1989). To describe the class yg~(Q) we need to clarify a connection between scg(P) and yg(pb). Lemma 2.1. There is a one-to-one correspondence between Ic ~ ~U (P) and 7 ~ •(pb), which is given by 7t = lim tcrP~_, and ~:t = lim 7,P,-,. (2.10) r~O r~O Moreover, if the two entrance laws t¢ and 7 are related by (2.10), then we have e-IJbHtKt(f) <~ 7,(f) ~< ellblltKt(f), t > O, f6 B(E) +. (2.11) Z-H. Li / Stochastic" Processes and their Applications 62 (l 996) 73-86 77 Proof. The assertions follow from the inequalities e-IlhlltPtf ~ P~f <~ ellblltPtf, t >10, feB(E) +. We omit the details. [] For K e .~'(P) we note St(K, f) = Kt(f) -- ds (p(y, V; f(y))Kt s(dy), t > 0, .fie B(E) +.
Recommended publications
  • Poisson Representations of Branching Markov and Measure-Valued
    The Annals of Probability 2011, Vol. 39, No. 3, 939–984 DOI: 10.1214/10-AOP574 c Institute of Mathematical Statistics, 2011 POISSON REPRESENTATIONS OF BRANCHING MARKOV AND MEASURE-VALUED BRANCHING PROCESSES By Thomas G. Kurtz1 and Eliane R. Rodrigues2 University of Wisconsin, Madison and UNAM Representations of branching Markov processes and their measure- valued limits in terms of countable systems of particles are con- structed for models with spatially varying birth and death rates. Each particle has a location and a “level,” but unlike earlier con- structions, the levels change with time. In fact, death of a particle occurs only when the level of the particle crosses a specified level r, or for the limiting models, hits infinity. For branching Markov pro- cesses, at each time t, conditioned on the state of the process, the levels are independent and uniformly distributed on [0,r]. For the limiting measure-valued process, at each time t, the joint distribu- tion of locations and levels is conditionally Poisson distributed with mean measure K(t) × Λ, where Λ denotes Lebesgue measure, and K is the desired measure-valued process. The representation simplifies or gives alternative proofs for a vari- ety of calculations and results including conditioning on extinction or nonextinction, Harris’s convergence theorem for supercritical branch- ing processes, and diffusion approximations for processes in random environments. 1. Introduction. Measure-valued processes arise naturally as infinite sys- tem limits of empirical measures of finite particle systems. A number of ap- proaches have been developed which preserve distinct particles in the limit and which give a representation of the measure-valued process as a transfor- mation of the limiting infinite particle system.
    [Show full text]
  • Superprocesses and Mckean-Vlasov Equations with Creation of Mass
    Sup erpro cesses and McKean-Vlasov equations with creation of mass L. Overb eck Department of Statistics, University of California, Berkeley, 367, Evans Hall Berkeley, CA 94720, y U.S.A. Abstract Weak solutions of McKean-Vlasov equations with creation of mass are given in terms of sup erpro cesses. The solutions can b e approxi- mated by a sequence of non-interacting sup erpro cesses or by the mean- eld of multityp e sup erpro cesses with mean- eld interaction. The lat- ter approximation is asso ciated with a propagation of chaos statement for weakly interacting multityp e sup erpro cesses. Running title: Sup erpro cesses and McKean-Vlasov equations . 1 Intro duction Sup erpro cesses are useful in solving nonlinear partial di erential equation of 1+ the typ e f = f , 2 0; 1], cf. [Dy]. Wenowchange the p oint of view and showhowtheyprovide sto chastic solutions of nonlinear partial di erential Supp orted byanFellowship of the Deutsche Forschungsgemeinschaft. y On leave from the Universitat Bonn, Institut fur Angewandte Mathematik, Wegelerstr. 6, 53115 Bonn, Germany. 1 equation of McKean-Vlasovtyp e, i.e. wewant to nd weak solutions of d d 2 X X @ @ @ + d x; + bx; : 1.1 = a x; t i t t t t t ij t @t @x @x @x i j i i=1 i;j =1 d Aweak solution = 2 C [0;T];MIR satis es s Z 2 t X X @ @ a f = f + f + d f + b f ds: s ij s t 0 i s s @x @x @x 0 i j i Equation 1.1 generalizes McKean-Vlasov equations of twodi erenttyp es.
    [Show full text]
  • Poisson Processes Stochastic Processes
    Poisson Processes Stochastic Processes UC3M Feb. 2012 Exponential random variables A random variable T has exponential distribution with rate λ > 0 if its probability density function can been written as −λt f (t) = λe 1(0;+1)(t) We summarize the above by T ∼ exp(λ): The cumulative distribution function of a exponential random variable is −λt F (t) = P(T ≤ t) = 1 − e 1(0;+1)(t) And the tail, expectation and variance are P(T > t) = e−λt ; E[T ] = λ−1; and Var(T ) = E[T ] = λ−2 The exponential random variable has the lack of memory property P(T > t + sjT > t) = P(T > s) Exponencial races In what follows, T1;:::; Tn are independent r.v., with Ti ∼ exp(λi ). P1: min(T1;:::; Tn) ∼ exp(λ1 + ··· + λn) . P2 λ1 P(T1 < T2) = λ1 + λ2 P3: λi P(Ti = min(T1;:::; Tn)) = λ1 + ··· + λn P4: If λi = λ and Sn = T1 + ··· + Tn ∼ Γ(n; λ). That is, Sn has probability density function (λs)n−1 f (s) = λe−λs 1 (s) Sn (n − 1)! (0;+1) The Poisson Process as a renewal process Let T1; T2;::: be a sequence of i.i.d. nonnegative r.v. (interarrival times). Define the arrival times Sn = T1 + ··· + Tn if n ≥ 1 and S0 = 0: The process N(t) = maxfn : Sn ≤ tg; is called Renewal Process. If the common distribution of the times is the exponential distribution with rate λ then process is called Poisson Process of with rate λ. Lemma. N(t) ∼ Poisson(λt) and N(t + s) − N(s); t ≥ 0; is a Poisson process independent of N(s); t ≥ 0 The Poisson Process as a L´evy Process A stochastic process fX (t); t ≥ 0g is a L´evyProcess if it verifies the following properties: 1.
    [Show full text]
  • A Stochastic Processes and Martingales
    A Stochastic Processes and Martingales A.1 Stochastic Processes Let I be either IINorIR+.Astochastic process on I with state space E is a family of E-valued random variables X = {Xt : t ∈ I}. We only consider examples where E is a Polish space. Suppose for the moment that I =IR+. A stochastic process is called cadlag if its paths t → Xt are right-continuous (a.s.) and its left limits exist at all points. In this book we assume that every stochastic process is cadlag. We say a process is continuous if its paths are continuous. The above conditions are meant to hold with probability 1 and not to hold pathwise. A.2 Filtration and Stopping Times The information available at time t is expressed by a σ-subalgebra Ft ⊂F.An {F ∈ } increasing family of σ-algebras t : t I is called a filtration.IfI =IR+, F F F we call a filtration right-continuous if t+ := s>t s = t. If not stated otherwise, we assume that all filtrations in this book are right-continuous. In many books it is also assumed that the filtration is complete, i.e., F0 contains all IIP-null sets. We do not assume this here because we want to be able to change the measure in Chapter 4. Because the changed measure and IIP will be singular, it would not be possible to extend the new measure to the whole σ-algebra F. A stochastic process X is called Ft-adapted if Xt is Ft-measurable for all t. If it is clear which filtration is used, we just call the process adapted.The {F X } natural filtration t is the smallest right-continuous filtration such that X is adapted.
    [Show full text]
  • Local Conditioning in Dawson–Watanabe Superprocesses
    The Annals of Probability 2013, Vol. 41, No. 1, 385–443 DOI: 10.1214/11-AOP702 c Institute of Mathematical Statistics, 2013 LOCAL CONDITIONING IN DAWSON–WATANABE SUPERPROCESSES By Olav Kallenberg Auburn University Consider a locally finite Dawson–Watanabe superprocess ξ =(ξt) in Rd with d ≥ 2. Our main results include some recursive formulas for the moment measures of ξ, with connections to the uniform Brown- ian tree, a Brownian snake representation of Palm measures, continu- ity properties of conditional moment densities, leading by duality to strongly continuous versions of the multivariate Palm distributions, and a local approximation of ξt by a stationary clusterη ˜ with nice continuity and scaling properties. This all leads up to an asymptotic description of the conditional distribution of ξt for a fixed t> 0, given d that ξt charges the ε-neighborhoods of some points x1,...,xn ∈ R . In the limit as ε → 0, the restrictions to those sets are conditionally in- dependent and given by the pseudo-random measures ξ˜ orη ˜, whereas the contribution to the exterior is given by the Palm distribution of ξt at x1,...,xn. Our proofs are based on the Cox cluster representa- tions of the historical process and involve some delicate estimates of moment densities. 1. Introduction. This paper may be regarded as a continuation of [19], where we considered some local properties of a Dawson–Watanabe super- process (henceforth referred to as a DW-process) at a fixed time t> 0. Recall that a DW-process ξ = (ξt) is a vaguely continuous, measure-valued diffu- d ξtf µvt sion process in R with Laplace functionals Eµe− = e− for suitable functions f 0, where v = (vt) is the unique solution to the evolution equa- 1 ≥ 2 tion v˙ = 2 ∆v v with initial condition v0 = f.
    [Show full text]
  • Introduction to Stochastic Processes - Lecture Notes (With 33 Illustrations)
    Introduction to Stochastic Processes - Lecture Notes (with 33 illustrations) Gordan Žitković Department of Mathematics The University of Texas at Austin Contents 1 Probability review 4 1.1 Random variables . 4 1.2 Countable sets . 5 1.3 Discrete random variables . 5 1.4 Expectation . 7 1.5 Events and probability . 8 1.6 Dependence and independence . 9 1.7 Conditional probability . 10 1.8 Examples . 12 2 Mathematica in 15 min 15 2.1 Basic Syntax . 15 2.2 Numerical Approximation . 16 2.3 Expression Manipulation . 16 2.4 Lists and Functions . 17 2.5 Linear Algebra . 19 2.6 Predefined Constants . 20 2.7 Calculus . 20 2.8 Solving Equations . 22 2.9 Graphics . 22 2.10 Probability Distributions and Simulation . 23 2.11 Help Commands . 24 2.12 Common Mistakes . 25 3 Stochastic Processes 26 3.1 The canonical probability space . 27 3.2 Constructing the Random Walk . 28 3.3 Simulation . 29 3.3.1 Random number generation . 29 3.3.2 Simulation of Random Variables . 30 3.4 Monte Carlo Integration . 33 4 The Simple Random Walk 35 4.1 Construction . 35 4.2 The maximum . 36 1 CONTENTS 5 Generating functions 40 5.1 Definition and first properties . 40 5.2 Convolution and moments . 42 5.3 Random sums and Wald’s identity . 44 6 Random walks - advanced methods 48 6.1 Stopping times . 48 6.2 Wald’s identity II . 50 6.3 The distribution of the first hitting time T1 .......................... 52 6.3.1 A recursive formula . 52 6.3.2 Generating-function approach .
    [Show full text]
  • Non-Local Branching Superprocesses and Some Related Models
    Published in: Acta Applicandae Mathematicae 74 (2002), 93–112. Non-local Branching Superprocesses and Some Related Models Donald A. Dawson1 School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6 E-mail: [email protected] Luis G. Gorostiza2 Departamento de Matem´aticas, Centro de Investigaci´ony de Estudios Avanzados, A.P. 14-740, 07000 M´exicoD. F., M´exico E-mail: [email protected] Zenghu Li3 Department of Mathematics, Beijing Normal University, Beijing 100875, P.R. China E-mail: [email protected] Abstract A new formulation of non-local branching superprocesses is given from which we derive as special cases the rebirth, the multitype, the mass- structured, the multilevel and the age-reproduction-structured superpro- cesses and the superprocess-controlled immigration process. This unified treatment simplifies considerably the proof of existence of the old classes of superprocesses and also gives rise to some new ones. AMS Subject Classifications: 60G57, 60J80 Key words and phrases: superprocess, non-local branching, rebirth, mul- titype, mass-structured, multilevel, age-reproduction-structured, superprocess- controlled immigration. 1Supported by an NSERC Research Grant and a Max Planck Award. 2Supported by the CONACYT (Mexico, Grant No. 37130-E). 3Supported by the NNSF (China, Grant No. 10131040). 1 1 Introduction Measure-valued branching processes or superprocesses constitute a rich class of infinite dimensional processes currently under rapid development. Such processes arose in appli- cations as high density limits of branching particle systems; see e.g. Dawson (1992, 1993), Dynkin (1993, 1994), Watanabe (1968). The development of this subject has been stimu- lated from different subjects including branching processes, interacting particle systems, stochastic partial differential equations and non-linear partial differential equations.
    [Show full text]
  • Simulation of Markov Chains
    Copyright c 2007 by Karl Sigman 1 Simulating Markov chains Many stochastic processes used for the modeling of financial assets and other systems in engi- neering are Markovian, and this makes it relatively easy to simulate from them. Here we present a brief introduction to the simulation of Markov chains. Our emphasis is on discrete-state chains both in discrete and continuous time, but some examples with a general state space will be discussed too. 1.1 Definition of a Markov chain We shall assume that the state space S of our Markov chain is S = ZZ= f:::; −2; −1; 0; 1; 2;:::g, the integers, or a proper subset of the integers. Typical examples are S = IN = f0; 1; 2 :::g, the non-negative integers, or S = f0; 1; 2 : : : ; ag, or S = {−b; : : : ; 0; 1; 2 : : : ; ag for some integers a; b > 0, in which case the state space is finite. Definition 1.1 A stochastic process fXn : n ≥ 0g is called a Markov chain if for all times n ≥ 0 and all states i0; : : : ; i; j 2 S, P (Xn+1 = jjXn = i; Xn−1 = in−1;:::;X0 = i0) = P (Xn+1 = jjXn = i) (1) = Pij: Pij denotes the probability that the chain, whenever in state i, moves next (one unit of time later) into state j, and is referred to as a one-step transition probability. The square matrix P = (Pij); i; j 2 S; is called the one-step transition matrix, and since when leaving state i the chain must move to one of the states j 2 S, each row sums to one (e.g., forms a probability distribution): For each i X Pij = 1: j2S We are assuming that the transition probabilities do not depend on the time n, and so, in particular, using n = 0 in (1) yields Pij = P (X1 = jjX0 = i): (Formally we are considering only time homogenous MC's meaning that their transition prob- abilities are time-homogenous (time stationary).) The defining property (1) can be described in words as the future is independent of the past given the present state.
    [Show full text]
  • A Representation for Functionals of Superprocesses Via Particle Picture Raisa E
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector stochastic processes and their applications ELSEVIER Stochastic Processes and their Applications 64 (1996) 173-186 A representation for functionals of superprocesses via particle picture Raisa E. Feldman *,‘, Srikanth K. Iyer ‘,* Department of Statistics and Applied Probability, University oj’ Cull~ornia at Santa Barbara, CA 93/06-31/O, USA, and Department of Industrial Enyineeriny and Management. Technion - Israel Institute of’ Technology, Israel Received October 1995; revised May 1996 Abstract A superprocess is a measure valued process arising as the limiting density of an infinite col- lection of particles undergoing branching and diffusion. It can also be defined as a measure valued Markov process with a specified semigroup. Using the latter definition and explicit mo- ment calculations, Dynkin (1988) built multiple integrals for the superprocess. We show that the multiple integrals of the superprocess defined by Dynkin arise as weak limits of linear additive functionals built on the particle system. Keywords: Superprocesses; Additive functionals; Particle system; Multiple integrals; Intersection local time AMS c.lassijication: primary 60555; 60H05; 60580; secondary 60F05; 6OG57; 60Fl7 1. Introduction We study a class of functionals of a superprocess that can be identified as the multiple Wiener-It6 integrals of this measure valued process. More precisely, our objective is to study these via the underlying branching particle system, thus providing means of thinking about the functionals in terms of more simple, intuitive and visualizable objects. This way of looking at multiple integrals of a stochastic process has its roots in the previous work of Adler and Epstein (=Feldman) (1987), Epstein (1989), Adler ( 1989) Feldman and Rachev (1993), Feldman and Krishnakumar ( 1994).
    [Show full text]
  • LECTURES 3 and 4: MARTINGALES 1. Introduction in an Arbitrage–Free
    LECTURES 3 AND 4: MARTINGALES 1. Introduction In an arbitrage–free market, the share price of any traded asset at time t = 0 is the expected value, under an equilibrium measure, of its discounted price at market termination t = T . We shall see that the discounted share price at any time t ≤ T may also be computed by an expectation; however, this expectation is a conditional expectation, given the information about the market scenario that is revealed up to time t. Thus, the discounted share price process, as a (random) function of time, has the property that its value at any time t is the conditional expectation of the value at a future time given information available at t.A stochastic process with this property is called a martingale. The theory of martingales (initiated by Joseph Doob, following earlier work of Paul Levy´ ) is one of the central themes of modern probability. In discrete-time finance, the importance of martingales stems largely from the Optional Stopping Formula, which (a) places fundamental constraints on (discounted) share price processes, and (b) provides a computational tool of considerable utility. 2. Filtrations of Probability Spaces Filtrations. In a multiperiod market, information about the market scenario is revealed in stages. Some events may be completely determined by the end of the first trading period, others by the end of the second, and others not until the termination of all trading. This suggests the following classification of events: for each t ≤ T , (1) Ft = {all events determined in the first t trading periods}. The finite sequence (Ft)0≤t≤T is a filtration of the space Ω of market scenarios.
    [Show full text]
  • Martingales by D
    Martingales by D. Cox December 2, 2009 1 Stochastic Processes. Definition 1.1 Let T be an arbitrary index set. A stochastic process indexed by T is a family of random variables (Xt : t ∈ T) defined on a common probability space (Ω, F,P ). If T is clear from context, we will write (Xt). If T is one of ZZ, IN, or IN \{0}, we usually call (Xt) a discrete time process. If T is an interval in IR (usually IR or [0, ∞)), then we usually call (Xt) a continuous time process. In a sense, all of probability is about stochastic processes. For instance, if T = {1}, then we are just talking about a single random variable. If T = {1,...,n}, then we have a random vector (X1,...,Xn). We have talked about many results for i.i.d. random variables X1, X2, . Assuming an inifinite sequence of such r.v.s, T = IN \{0} for this example. Given any sequence of r.v.s X1, X2, . , we can define a partial sum process n Sn = Xi, n =1, 2,.... Xi=1 One important question that arises about stochastic processes is whether they exist or not. For example, in the above, can we really claim there exists an infinite sequence of i.i.d. random variables? The product measure theorem tells us that for any valid marginal distribution PX , we can construct any finite sequence of r.v.s with this marginal distribution. If such an infinite sequence of i.i.d. r.v.sr does not exist, we have stated a lot of meaniningless theorems.
    [Show full text]
  • Resource Theories of Multi-Time Processes: a Window Into Quantum Non-Markovianity
    Resource theories of multi-time processes: A window into quantum non-Markovianity Graeme D. Berk1, Andrew J. P. Garner2,3, Benjamin Yadin4, Kavan Modi1, and Felix A. Pollock1 1School of Physics and Astronomy, Monash University, Clayton, Victoria 3800, Australia 2Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna, Austria 3School of Physical and Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, 637371, Singapore 4School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7 2RD, United Kingdom. April 8, 2021 We investigate the conditions under which an uncontrolled background process may be harnessed by an agent to perform a task that would otherwise be impossible within their operational framework. This situation can be understood from the perspective of resource theory: rather than harnessing ‘useful’ quantum states to perform tasks, we propose a resource theory of quantum processes across multiple points in time. Uncontrolled background processes fulfil the role of resources, and a new set of objects called superprocesses, corresponding to operationally implementable control of the system undergoing the process, constitute the transformations between them. After formally introducing a framework for deriving resource theories of multi-time processes, we present a hierarchy of examples induced by restricting quantum or classical communication within the superprocess – corresponding to a client-server scenario. The resulting nine resource theories have different notions of quantum or classical memory as the determinant of their utility. Furthermore, one of these theories has a strict correspondence between non- useful processes and those that are Markovian and, therefore, could be said to be a true ‘quantum resource theory of non-Markovianity’.
    [Show full text]