Relative growth of the partial sums of certain random Fibonacci-like sequences
|
|
- Emma Gardner
- 5 years ago
- Views:
Transcription
1 Relative growth of the partial sums of certain random Fibonacci-like sequences Alexander Roitershtein Zirou Zhou January 9, 207; Revised August 8, 207 Abstract We consider certain Fibonacci-like sequences X n n 0 perturbed with a random noise. Our main result is that n X n X k converges in distribution, as n goes to infinity, to a random variable W with Pareto-like distribution tails. We show that log P W >x s = lim x log x is a monotonically decreasing characteristic of the input noise, and hence can serve as a measure of its strength in the model. Heuristically, the heavytailed limiting distribution, versus a light-tailed one with s = +, can be interpreted as an evidence supporting the idea that the noise is singular in the sense that it is big even in a slightly perturbed sequence. MSC200: Primary 60H25, 60J0, secondary 60K20. Keywords: random linear recursions, tail asymptotic, Lyapunov constant, Markov chains, regeneration structure. Introduction and statement of the main result Let η n n 0 be a sequence of independent Bernoulli random variables with P η n = = ε, P η n = 0 = ε for some ε 0,. We consider a sequence X n n 0 of real-valued random variables generated by the recursion with the initial conditions X 0 =, X = a, where X n+ = ax n + bη n X n, n N, a 0, and b > a 2 are given deterministic constants. The above construction is inspired by the models considered in [. The sequence X n can be thought as a perturbation with noise of its deterministic counterpart, which is defined through the recursion equation Z n+ = az n + bz n Dept. of Mathematics, Iowa State University, Ames, IA 500, USA; roiterst@iastate.edu Dept. of Mathematics, Iowa State University, Ames, IA 500, USA; zzhou@iastate.edu
2 and the initial conditions Z 0 =, Z = a. Throughout the paper we are interested in the dependence of model s characteristics on the parameter ε that varies while the recursion coefficients a, b are maintained fixed. It is not hard to check that lim n n Z n Z k = λ, where λ is a constant defined below in 8. In this paper we are primarily concerned with the asymptotic behavior of the following sequence W n := n X k, n N, 3 X n which describes the rate of growth of the partial sums relatively to the original sequence X n. Our main result is stated in the following theorem. Intuitively, it can be interpreted as a saying that while adding more noise to the input by increasing the value of ε yields more noise in the output sequence W n, the noise remains large for all, even arbitrarily small, values of the parameter ε > 0 in some rigorous sense. Theorem. Let W n be defined in 3. Then the following holds true: a There exists ε 0, such that i If ε 0, ε, then W n converges in distribution, as n goes to infinity, to a nondegenerate random variable W ε. ii If ε [ε,, then lim n P W n > x = for any x > 0, that is W ε = +. iii For any ε 0, ε, there exist reals s ε 0, and K ε 0, such that lim P W ε > xx sε = K ε. x b Furthermore, s ε is a continuous strictly decreasing function of ε on 0, ε, and lim s ε = while lim s ε = 0. 4 ε 0 ε ε The specific choice of the initial values X 0 = and X = a is technically convenient, but is not essential. In particular, while asserting it ultimately yields part a of Lemma 3, changing it wouldn t affect part b of the lemma. Theorem remains valid for an arbitrary pair X 0, X of positive numbers. See Remark 9 in Section 3 for details. To extend Theorem to a linear recursion under a more general than 2 assumption a 0, b > 0, one can consider X n = θ n X n with an arbitrary θ R such that aθ > 0 and 2 a < 2 θ < a + a 2 + 4b. The new sequence X n satisfies the recursion X n+ = ã X n + bη n Xn with ã = a/θ < and b = b/θ 2 > ã. Some other readily available extensions of Theorem are discussed in Section 5 below. The proof of Theorem is given in Section 3 below. Note that the theorem implies that the limiting distribution W ε has power tails as long as it is finite and non-degenerate. We remark that additional properties of the constants ε and s ε can be inferred from the auxiliary results discusses in Section 3 below. In particular, see Proposition 6 which provides 2
3 some information on the relation of s ε to the Lyapunov exponent and the moments of the reciprocal sequence Xn. For an integer n 0, let R n = X n X n+. 5 The sequence R n forms a Markov chain since is equivalent to R n = a + bη n R n. Notice that, since X 0 =, for n N we have Xn = n R n and W n+ = R n W n + R n or, equivalently, W n+ + = R n W n The proof of the assertion a-iii of Theorem is carried out by an adaption of the technique used in [ to obtain an extension of Kesten s theorem [6, 8 for linear recursions with i. i. d. coefficients to a setup with Markov-dependent coefficients. More specifically, to prove that the distribution of W ε is asymptotically power-tailed, we verify in Section 3 that Markov chain R n satisfies Assumption.5 in [. This allows us to borrow key auxiliary results from [, 3 and also use a variation of the underlying regeneration structure argument in [. See Lemma 7 in Section 3 below for details. The proof of Theorem relies in particular on the asymptotic analysis of the negative moments of X n more specifically, the function Λ ε t defined below in 8. First positive integer moments of X n can be in principle computed explicitly. We conclude this introduction with the statement of a result which is not directly connected to Theorem, but might be useful, for instance, for the statistical analysis of the sequence X n. Here and throughout this paper we use the notation E P to denote the expectation operator under the probability law P in order to distinguish it from the expectation E Q, where Q is introduced in Section 2 below. For ε [0,, let λ ε, = a + a 2 + 4b ε 2 > 0 and λ ε,2 = a a 2 + 4b ε 2 denote the roots of the characteristic equation λ 2 = aλ + b ε. We have: Proposition 2. For any integer n 0, a We have E P X n = λn+ ε, λ n+ ε,2. In particular, lim λ ε, λ n log E ε,2 n P X n = λ ε,. b We have lim n n log E P X n = aλ ε, + b ε. More precisely, E P X 2 n = c [aλ ε, + b ε n + c 2 [aλ ε,2 + b ε n 2 bn+ ε n 4b ε + a 2, < 0 7 where are the constants c and c 2 are chosen in a manner consistent with the initial conditions X 0 = and X = a. c Letting U n,k := E P X n X n+k for an integer k 0, U n,k = d n, λ k ε, + d n,2 λ k ε,2, 3
4 where are the constants d n, and d n,2 are chosen in a manner consistent with the initial conditions U n,0 = E P X 2 n and U n, = E P X n X n+ = a[ EP X 2 n+ b εe P X 2 n b n+ ε n. In particular, for any k N we have lim n n log E P X n X n+k = aλ ε, + b ε. The rest of the paper is organized as follows. Section 2 contains a preliminary discussion and an auxiliary monotonicity result with respect to the parameter ε about the Lyapunov constant of the sequence X n. The proof of Theorem is included in Section 3. The proof of Proposition 2 is deferred to Section 4. Finally, section 5 contains some concluding remarks regarding possible extensions of the results in Theorem. 2 Preliminaries: Lyapunov constant of X n This section includes a preliminary discussion which is focused on the random variable R n defined in 5 and the Lyapunov constant γε introduced below. The main purpose here is to obtain a monotonicity result in Proposition 4. The coupling construction employed to prove Proposition 4 is also used in Section 3, to carry out the proof of Propositions 6 and. Recall λ ε, and λ ε,2 from 7. In order to simplify the notation, denote λ := λ 0, = a + a 2 + 4b 2 and λ 2 := λ 0,2 = a a 2 + 4b. 8 2 Notice that the condition a + b > ensures λ >. Using the initial conditions Z 0 = and Z = a, one can verify that Z n = λn+ λ n+ 2, n 0. 9 λ λ 2 Using 9 one can obtain a Cassini-type identity Z n Z n+ Zn 2 = b n n+ see, for instance, Theorem 5.3 in [9 for the original Fibonacci sequence result and the identity Z n+ λ Z n = λ n+ 2. The alternating sign of the right-hand side in these two identities yields for k N, a Z 2k Z 2k 2 < Z 2k+ Z 2k < λ < Z 2k+2 Z 2k+ < Z 2k a2 + b Z 2k a. 0 Recall R n from 5. The unique stationary distribution for the countable, irreducible and aperiodic Markov chain R n can be obtained as follows. For n N, let Fix any k N. Then for a positive integer n > k we have P R n = Z k /Z k = P Tn = n k T n = sup{i n : η i = 0}. = P η n k = 0, η n k = η n k+ =... = η n 3 = η n 2 = = ε ε k. 4
5 Thus, lim n P R n = Z k /Z k = ε ε k. The stationary sequence R n n N can be extended into a double-infinite stationary sequence R n n Z [4. Let Q denote the law of the time-reversed stationary Markov chain R n n Z. We have established the following result: Lemma 3. Let S k = Z k Z k, k. Then: a For all n Z, we have P R n {S k : k N} =. b Furthermore, QR n = S k = ε ε k for any n Z, k N. Let γ = γε denote the Lyapunov exponent of the sequence X n, that is γ := lim n n log X n = lim n n E P log X n = E Q log, P a. s. and Q a. s. 2 R The existence of the limit along with the identities follow from results in [5. account that Z 0 =, 0 implies that Taking in γ = E Q log R = ε ε n log S n = n= The last formula can be compactly written as γ = ε E P log Z T, where ε 2 ε n log Z n. 3 T = + inf{k 0 : η k = 0} = inf{j : R j = /a}. 4 It follows from 3 and the fact that log S n is a bounded sequence, that γε is an analytic function of ε on [0,. In particular, lim γε = lim log S n = log λ and lim γε = log a. 5 ε 0 n ε We remark that the analyticity of γε on [0, follows directly from a general result in [2. For recent advances in numerical study of the Lyapunov exponent for random Fibonacci sequences see [0, 5 and references therein. We next prove formally the following intuitive result. Together with 5 it implies the existence of ε 0, such that γε > 0 if and only if ε < ε. Our interest to this phase transition steams from the result in Lemma 5 stated below in Section 3. Proposition 4. The function γε : [0, R is strictly decreasing. Proof. The proof is by a coupling argument. Fix any ε [0, and ε ε,. Let X n n 0 be the sequence introduced in, and define X n n 0 as follows: X 0 =, X = a, and where η n n= X n+ = ax n + bη n X n, n N, = min{η n, ξ n } and ξ n are i. i. d. random variables with the distribution { 0 with probability ε ε ξ n = ε with probability ε, ε 5
6 such that ξ n is independent of the σ-algebra σx 0, η 0, X, η,..., X n, η n, X n, X n+ for all n 0. Then P η n = 0 = ε, P η n = = ε, and hence the sequence X n n 0 is distributed according to the same law as X n n 0 with ε replacing ε in the definition of η n. To deduce that γε is a non-increasing function of ε, observe that by the coupling construction, η n η n for all n 0, and hence, by induction, X n X n for all n 0. To conclude the proof of the proposition it remains to show that γε is strictly decreasing. Toward this end, first observe that for any integer n 2 we have ζ n := η n η n = η n = 0, η n = = η n =, ξ n = 0, where A denotes the indicator function of the event A and the first equality serves as a definition of ζ n. Then, the following is an implication of Lemma 3 and 0 along with the fact which we have established that X n X n for all n 0 : [ log X n log X n = log X n 2 n axn + bx ζk n 2 log log X n [ n 2 axn + bx n 2 n 2 ζ k log ax n + b ax n ζk log [ n 2 + b ζk. 6 It follows then from 2 and the law of large numbers that with probability one, γε γε = lim n = E P ζ n log n The proof of the proposition is complete. log Xn log X n lim n n + b 3 Proof of the main result n 2 = ε ε log ζ n log + b + b > 0. The purpose of this section is to prove Theorem. The proof is divided into a sequence of lemmas. The critical exponent ε is identified and part a-i and a-ii of the theorem are proved in Proposition 6. The assertion in part a-iii of the theorem is verified in Lemma 7. Finally, the claim in part b is established in Proposition. Observe that under the stationary law Q the random variable W n = n n j=k R j has the same distribution as n k j=0 R j. Therefore one can write W ε = k j=0 R j. The following lemma is well-known, see for instance Theorem 2..2 especially display 2..6 and the subsequent Remark in [4. Lemma 5. For any ε 0, we have P W ε < = QW ε < {0, }. Moreover, P W ε < = if and only if γε = E Q log R > 0. 6
7 Let ε = sup{ε > 0 : γε > 0}. It follows from Proposition 4, the limits in 5, and the continuity of γε that ε 0, and γε = 0. 7 By virtue of Lemma 5, ε satisfies a-i and a-ii in the statement of Theorem. We proceed with the proof that a-iii of the theorem also holds true. Following [, 3, we are going to identify the critical exponent s ε in the statement of Theorem as the unique solution to the equation Λ ε s ε = 0, where for t 0 we define Λ ε t := lim n n log E Q R t... Rn. t It follows from Lemmas 2.6 and 2.8a in [ see especially display 2. in [ applied to the forward Markov chain R n n 0 that the above limit exists and in fact is not affected by the initial distribution of the Markov chain. In particular we have: Λ ε t = lim n n log E P X t 0 X t n = lim n n log E P Xn t The following proposition is a key ingredient in the proof of Theorem. Note that for any ε [0,, Λ ε 0 = 0 and, by virtue of the Cauchy-Schwarz inequality, Λ ε t is convex on [0,. In particular, the one-sided derivative Λ ε0 := lim t 0 Λ ε t/t is well-defined. Proposition 6. Let ε 0, be defined in 7. Then the following four statements are equivalent for ε 0, : i γε > 0, that is ε 0, ε. ii Λ ε0 < 0. iii There exists a unique s ε > 0 such that Λ ε s ε = 0. iv W ε is a P -a. s. finite and non-degenerate random variable. Proof. i ii If γε > 0, the ergodic theorem implies that for T defined in 4, Q-a. s., E Q T log R k = E Q T lim n n n log R k = E Q T E Q log R = ε γε < 0. k= Hence [6, 8 there exists a unique s > 0 such that E P X s T =. It can be shown see, for instance, display 2.43 in [ that this implies Λ ε s = 0 and hence Λ ε0 < 0. ii i Jensen s inequality implies that γ ε tλ ε t, and hence γε > 0 if Λ 0 < 0. ii iii For any t > 0, we have n E P Xn t E P X t η k ε n a tn, n k=2 and hence lim t Λ ε t = +. Since Λ ε t is a convex function with Λ ε 0 = 0, this proves the implication ii iii for an illustration, see Fig. below. i iv This is the content of Lemma 5. The proof of the proposition is complete. 7 8
8 Λ ε t ε ε 3 ε 2 Λ ε 0 = 0 ε Λ 0 t = t log λ s ε3 s ε2 s ε t Figure : Sketch of the graph of the convex function Λ ε t for 3 increasing parameter values ε < ε 2 < ε 3 within the range 0, ε and the extremal parameter values ε = 0, ε = ε. Using the notation introduced in the statement of Lemma 3, transition kernel of the timereversed Markov chain R n on the state space {S i : i N} can be written as follows: Hi, j := QR n = S j R n+ = S i = QR n+ = S i R n = S j QR n = S j QR n = S i ε ε j if i = = if i = j + 0 otherwise. Unfortunately, the infinite matrix Hi, j doesn t satisfy the conditions imposed in [, 3 or [3. More precisely, the kernel H doesn t satisfy the following strong Doeblin condition: H m i, j cµj for some m N, c > 0, a probability measure µ on N, and all i, j N. However, one can exploit the fact that transition kernel of the Markov chain R n does satisfy Doeblin s condition with m =, c = ε, and µ = δ, the degenerate distribution concentrated on j =. The proof of the following lemma is a mixture of arguments borrowed from [ and [3. The key technical ingredient of the proof is the observation that transition kernel of the forward Markov chain R n satisfies Assumption.2 in [3. Lemma 7. The claim in part a-iii of Theorem holds with ε introduced in 7. Proof. Let N 0 = 0 and then for i N, N i = sup{k < N i : R k = /a}. Note that the blocks R Ni+ +,..., R N i are independent and identically distributed for i 0. For i 0, let A i = R Ni + R Ni R R Ni N i R... R R Ni N i+ +2 N i+ + B i = R Ni R... R. Ni N i+ + 8
9 The pairs A i, B i, i 0, are independent and identically distributed under the law P. Moreover, it follows from 6 that W ε = A 0 + n= B i. A n n To prove Lemma 7 we will verify the conditions of the following Kesten s theorem for A i, B i i 0 under the law P. To enable a further reference see Section 5 below we quote this theorem in a more general setting with not necessarily strictly positive coefficients A n, B n than we actually need for the purpose of proving Lemma 7. Theorem 8. [6, 8 Let A i, B i i 0 be i.i.d. pairs of real-valued random variables such that i For some s > 0, E A 0 s = and E B 0 s log + B 0 <, where log + x := max{log x, 0}. ii P log B 0 = δ k for some k Z B 0 0 < for all δ > 0. Let W = A 0 + n= A n n i= B i. Then a lim t t s P W > t = K +, lim t t s P W < t = K for some K +, K 0. b If P B < 0 > 0, then K + = K. c K + + K > 0 if and only if P A 0 = B 0 c < for all c R. Recall T from 4. Observe that log B 0 = 0 k=n + log R k is distributed the same as T k= log R k = log Z log Z T +. Therefore the non-lattice condition ii of the above theorem holds in virtue of 9. Furthermore, since clearly P B 0 > > 0 and P B 0 < > 0, we have P A 0 = B 0 c < for all c R. It remains to verify condition i of the theorem. Recall S k introduced in the statement of Lemma 3. Let i=0 Hi, j := QR n+ = S j R n = S i = ε if j = ε if j = i + 0 otherwise be transition kernel of the stationary Markov chain R n. Between two successive regeneration times N i the forward chain R n evolves according to a sub-markov kernel Θ given by the equation That is, for i, j N, Hi, j = Θi, j + εj =. 9 Θi, j = QR = j, N > R 0 = i = { ε if j = i + 0 otherwise. Further, for any real s 0 define the kernels countable matrices H s i, j and Θ s i, j, i, j N, by setting H s i, j = Hi, jr t j and Θ s i, j = Θi, jr t j. For an infinite matrix A on N and a function f : N R let Af denote the real-valued function on N with Afi := j N Ai, jfj. Since the forward transition kernel H satisfies Assumption.2 in [3, it follows that from Proposition 2.4 in [3 that for all s 0 : 9
10 . There exist a real number α s > 0 and a bounded function f s : N R such that inf i N f s i > 0 and H s f = α s f s. 2. There exist a real number β s > 0 and a bounded function g s : N R such that inf i N g s i > 0 and Θ s f = β s f s. 3. β s 0, α s. Without loss of generality we can use the following normalization for the eigenfunctions: f s =. 20 Furthermore, it follows from Lemma 2.3 in [3 that α s and β s are spectral norms of infinite matrices H s and Θ s, respectively, and hence are uniquely defined. It follows from Proposition 6 see Lemma 2.3 in [3 that α sε =. In particular, since Λ ε is a continuous function of s, the spectral radius of Θ s regarded as an operator acting on the space of bounded function on N equipped with the sup-norm is strictly less than one on an interval 0, s ε for some s ε > s ε. Let I be the infinite unit matrix in N and h : N R be a function defined by hi = for all i N. For any s 0, s ε, and in particular for s = sε, we have: T E P B0 s = E P R k = n= k= T = E P R k = E P [ HT s, a s εrθ n s h = a s εi Θ s h. On the other hand, it follows from 9 that for any i N we have f sε i = H sε f sε i = Θ sε f sε i + εa sε f sε, and hence E P B sε 0 = f sε =, where for the second identity we used 20. Finally, adapting 2.45 in [ to our framework we obtain for any s s ε, s ε, [ n i s E P A s 0 = E P R j N = n = = = n= i= j=0 i s R j N = n [ n E P n= i= j=0 [ n i n s E P R j s N = n n= n= n= n s n s i= i= j=0 [ i n QR 0 = /a E Q R j s N = n, R 0 = /a j=0 n n n E P Rj s T = n = εa s n s Θ n i Θs i h <, i= j=n i 0 n= i=
11 where the last inequality is an implication of the fact that the spectral radius of the infinite positive matrix Θ s is strictly less than one. The proof of the lemma is complete. Remark 9. The initial conditions X 0 = and X = a guarantee that the measure P is Q conditioned on the event R 0 = /a. If R 0 has a different value, then A 0 and B 0 defined above are still independent of the i. i. d. sequence of pairs A n, B n n N, but the distributions of the pairs A 0, B 0 and A, B differ in general. Using a slightly more elaborated version of the arguments used in the proof of Lemma 7 cf. proof of Proposition 2.38 under assumption.6 in [ it can be shown that all the conclusions of Theorem remain valid for different strictly positive initial values X 0, X and that the only effect of changing initial conditions is on the value of the constant K ε. To conclude the proof of Theorem it remains to prove the claim in part b of the theorem. Using the representation of Λ ε t given in 8 and a variation of the coupling argument which we employed in order to prove Proposition 4, we first derive the following auxiliary result: Lemma 0. For any fixed t > 0, Λ ε t is a strictly increasing function of ε on [0,. Proof. Recall the notation introduced in the course of the proof of Proposition 4. It follows from the inequality in 6 that { n 2 + b ζk n 2 = exp ζ X n a 2 k log + b }. + b X n X n It follows then from Hölder s inequality that for any constants t > 0, p > and q > 0 such that + =, we have p q [ [E P E P X t n X n /p pt { n 2 E P exp qt Therefore, since ζ k are i. i. d. Bernoulli random variables, Λ ε t p Λ ε pt + lim sup n nq log E P { exp { exp n 2 qt ζ k log + b } /q. ζ k log + b = p Λ ε pt + q log E P qtζ log + b } = p Λ ε pt + { [ε q log ε exp qt log + b } = p Λ ε pt + q log [ε ε + b p Λ ε pt [ q ε ε + b qt + ε + ε qt, } + ε + ε where in the last step we used the inequality log x < x. Since Λ ε t is a continuous function of t, by letting p to approach one and thus q to approach infinity, we obtain that Λ ε t Λ ε t tε ε log + b > 0.
12 The proof of the lemma is complete. We now turn to the proof of part b of Theorem. Proposition. The critical exponent s ε is a strictly decreasing continuous function of ε on [0, ε. Furthermore, 4 holds true. Proof. The desired monotonicity of s ε follows directly from Lemma 0, see Fig. above. We will next show that s ε is a continuous function of ε on 0,. Due to the monotonicity of s ε, the following one-sided limits exist for any ε 0, ε : s + ε = lim δ ε s δ and s ε = lim δ ε s δ. The second limit, namely s ε, exists also for ε = ε. Set s ε := 0. If either s + ε > s ε or s ε < s ε for some ε [0, ε, then see Fig. above Λ δ t is not a continuous function of δ at any point t within the open interval s ε, s + ε or, respectively, s ε, s ε. To verify the continuity of s ε on 0, ε it therefore suffices to show that Λ ε t is a continuous function of ε for any fixed t > 0. We will use again the notation and the coupling construction introduced in the course of the proof of Proposition 4. Recall T n from, and let T n, n N, be the corresponding stopping times associated with the sequence X n. Let χ n = T n T n. The random variables χ n form a two-state Markov chain with transition kernel determined by and P χ n+ = χ n = 0 = P η n = η n = 0 = P ζ n+ = 0 = ε ε P χ n+ = χ n = = P η n = η n = 0 = ε. The stationary distribution π = π0, π of this Markov chain is given by π0 = ε ε and π = ε ε ε Similarly to 6, in virtue of Lemma 5 we have: X n n 2 X n a ξk = exp a X n { n 2 χ k log + b }. a 2 It follows then from Hölder s and Jensen s inequalities that for any constants t > 0, p > and q > 0 such that + =, we have p q E P t X n = [ /p { E P Xn pt [E P exp qt [ /p [ E P Xn pt [ E P X pt n { n 2 exp qt /p + b a 2 t 2 n 2 χ k log + b } /q a 2 E P χ k log + b } /q. a 2 n 2 E P χ k.
13 Since Markov chain χ n is aperiodic, its stationary distribution π is the limiting distribution. Thus, Λ ε t p Λ εpt + t log + b lim a P ξ 2 k = n = p Λ εpt + tπ log + b a 2 = p Λ εpt + t ε ε ε log + b. a 2 Since Λ ε t is a continuous function of t and p > is arbitrary, we conclude that 0 < Λ ε t Λ ε t t ε ε ε log + b, a 2 and thus, for a given t > 0, Λ ε t is a Lipschitz function of the parameter ε on any interval bounded away from zero. This completes the proof of the continuity of s ε on 0, ε. In particular, the second limit in 4 holds true. To complete the proof of the proposition it remains to prove that the first limit in 4 holds true, namely lim ε 0 s ε =. To this end it suffices to show that s ε > t for all ε > 0 small enough. To this end, observe that since 9 implies lim n S n = λ <, there exists k 0 N such that S k < 2 + λ < for all k > k0. For n N, let δ n = R n = S k with k > k 0 and let G n = σr, R 2,..., R n be the σ-algebra generated by the random variables R i with i n. Then, with probability one, we have for n 2, P δ n = 0 Gn P {η n k 2 = 0} G n 0 k k 0 k 0 P η n k 2 = 0 Gn = k0 + ε. 2 Denote u = 2 +λ and v = a. It follows from 8, 2, and 0 that for ε < +k 0 we have: Λ ε t = lim n n log E n Q i= R t i lim sup n log [ u t εk v t εk 0 +. n log E Q n i= u tσ i v t σ i It thus holds that Λ ε t < 0, and hence s ε > t, for all ε > 0 small enough. Since t > 0 is arbitrary, it follows that lim ε 0 s ε =. The proof of the proposition is complete. 4 Proof of Proposition 2 For k N, et F k = σx 0, η 0, X, η,..., X k 2, η k 2, X k, η k, X k, X k+ be the σ-algebra generated by the random variables η i with i k and X i with i k +. It follows from that η k is independent of F k. In the proof below, we will repeatedly use without further notice the fact E P Xη k = E P [X ε for a random variable X F k. Proof. 3
14 a In order to verify the claim, take the expectation on both sides of and recall 8, 9. b Take the square and then take the expectation on the both sides of, to obtain: E P X 2 n+ = a 2 E P X 2 n + b 2 ε 2 E P X 2 n + 2b εe P ax n X n = a 2 E P X 2 n + b 2 ε 2 E P X 2 n +2b εe P [ Xn+ bη n X n X n = a 2 E P X 2 n b 2 ε 2 E P X 2 n + 2b εe P X n+ X n = a 2 + 2b ε E P X 2 n b 2 ε 2 E P X 2 n +2b εe P h n, 22 where h n := X n X n+ Xn. 2 We will next derive a Cassini-type formula for E P h n. We have: [ ae P h n+ = E P axn X n+2 aep X 2 [ n+ = E P Xn+ bη n X n ax n+ + bη n X n axn+ 2 [ = E P bηn X n X n+ abη n X n X n+ b 2 η n η n X n X n Hence, = E P [ b εxn X n+ abη n X 2 n + h n b 2 εη n X n X n = E P [ b εxn X n+ ax n bη n X n abη n h n = abe P η n h n. E P X n X n+2 X 2 n+ = E P h n+ = be P η n h n =... = b n ε n E p η 0 h = n b n+ ε n. 23 Using the notation Y n = E P X 2 n and substituting 23 into 22, we obtain Y n+ = [ a 2 + 2b ε Y n b 2 ε 2 Y n + 2 b n+ ε n, from which the claim in b follows, taking in account that Y 0 = and Y = a 2. c For any k N, we have: U n,k+ = E P X n X n+k+ = ae P X n X n+k+ + be P η n+k X n X n+k = au n,k + b εu n,k. Furthermore, using notations introduced in the course of proving b, E P X n X n+ = a E b ε P X n X n+2 E P X 2 a n = [ EP h n+ + Yn+ 2 b εyn 2. a The proof of the proposition is complete. 4
15 5 Concluding remarks. We believe that K ε in the statement of Theorem is decreasing as a function of the parameter ε, but were unable to prove it. Some information about this constant can be derived from the formulas given in [2, 6 see also references in [2 using the recursion representation 6 of W n and the regeneration structure described in Section 3 see the proof of Lemma 7 there which reduces the Markov setup of this paper to an i. i. d. one considered in [2, 6, We think that s ε is a strictly convex function of ε on [0, ε, but were unable to prove it. Since lim ε 0 s ε = +, Fig. strongly suggests that the convexity holds for an interval of small enough values of ε within 0, ε. We believe that, with s ε set to zero, s ε is convex in fact on the whole interval 0, ε. 3. The linear model can serve as an ansatz in a general case. For instance, it seems plausible that a result similar to our Theorem holds for generalized Fibonacci sequences considered in [7. This is a work in progress by the authors. 4. Using appropriate variations of the above Proposition 6 and Lemma 7, Theorem can be extended to a class of recursions W n+ = θ m i=0 Rh i nl+i W n + Q n with arbitrary l, m N, positive reals h i, and suitable coefficients θ large enough by absolute value constant and Q n in general random. For instance, in the spirit of [9, one can consider sequences W n = n X2n 2 X 2k+X 2k+8 or W n = n Xn 2 k Xk 2. The former case corresponds to W n+ = Q n Wn + Q n with Q n = R 2n+ R 2n+2 R 2n+8 R 2n+9, and the later to W n+ = Q n Wn + with Q n = n Rn. 2 We leave details to the reader. References [ E. Ben-Naim and P. L. Krapivsky, Weak disorder in Fibonacci sequences, J. Phys. A , L30 L307. [2 D. Buraczewski, E. Damek, and J. Zienkiewicz, On the Kesten-Goldie constant, J. Difference Equ. Appl , [3 J. F. Collamore, Random recurrence equations and ruin in a Markov-dependent stochastic economic environment, Ann. Appl. Probab , [4 R. Durrett, Probability: Theory and Examples, 4th ed., Cambridge Series in Statistical and Probabilistic Mathematics, Cambridge University Press, 200. [5 H. Furstenberg and H. Kesten, Products of random matrices, Ann. Math. Statist , [6 C. M. Goldie, Implicit renewal theory and tails of solutions of random equations, Ann. Appl. Probab. 99,
16 [7 É. Janvresse, B. Rittaud, and T. de la Rue, Almost-sure growth rate of generalized random Fibonacci sequences, Ann. Inst. H. Poincaré Probab. Statist , 298. [8 H. Kesten, Random difference equations and renewal theory for products of random matrices, Acta. Math , [9 T. Koshy, Fibonacci and Lucas Numbers with Applications Pure and Applied Mathematics: A Wiley-Interscience Series of Texts, Monographs and Tracts, Wiley- Interscience, 200. [0 Y. Lan, Novel computation of the growth rate of generalized random Fibonacci sequences, J. Stat. Phys , [ E. Mayer-Wolf, A. Roitershtein, and O. Zeitouni, Limit theorems for one-dimensional transient random walks in Markov environments, Ann. Inst. H. Poincaré Probab. Statist , [2 Y. Peres, Domains of analytic continuation for the top Lyapunov exponent, Ann. Inst. H. Poincaré Probab. Statist , [3 A. Roitershtein, One-dimensional linear recursions with Markov-dependent coefficients, Ann. Appl. Probab , [4 O. Zeitouni, Random Walks in Random Environment, XXXI Summer School in Probability, St. Flour, 200. Lecture Notes in Math. 837, Springer, 2004, pp [5 C. Zhang and Y. Lan, Computation of growth rates of random sequences with multi-step memory, J. Stat. Phys ,
Kesten s power law for difference equations with coefficients induced by chains of infinite order
Kesten s power law for difference equations with coefficients induced by chains of infinite order Arka P. Ghosh 1,2, Diana Hay 1, Vivek Hirpara 1,3, Reza Rastegar 1, Alexander Roitershtein 1,, Ashley Schulteis
More informationA log-scale limit theorem for one-dimensional random walks in random environments
A log-scale limit theorem for one-dimensional random walks in random environments Alexander Roitershtein August 3, 2004; Revised April 1, 2005 Abstract We consider a transient one-dimensional random walk
More informationLarge deviation bounds for functionals of Viterbi paths
Large deviation bounds for functionals of Viterbi paths Arka P. Ghosh Elizabeth Kleiman Alexander Roitershtein February 6, 2009; Revised December 8, 2009 Abstract In a number of applications, the underlying
More informationLecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.
1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationarxiv: v2 [math.pr] 4 Sep 2017
arxiv:1708.08576v2 [math.pr] 4 Sep 2017 On the Speed of an Excited Asymmetric Random Walk Mike Cinkoske, Joe Jackson, Claire Plunkett September 5, 2017 Abstract An excited random walk is a non-markovian
More informationWeighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More informationarxiv: v5 [math.na] 16 Nov 2017
RANDOM PERTURBATION OF LOW RANK MATRICES: IMPROVING CLASSICAL BOUNDS arxiv:3.657v5 [math.na] 6 Nov 07 SEAN O ROURKE, VAN VU, AND KE WANG Abstract. Matrix perturbation inequalities, such as Weyl s theorem
More informationarxiv: v1 [math.pr] 1 Jan 2013
The role of dispersal in interacting patches subject to an Allee effect arxiv:1301.0125v1 [math.pr] 1 Jan 2013 1. Introduction N. Lanchier Abstract This article is concerned with a stochastic multi-patch
More informationAdditive functionals of infinite-variance moving averages. Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535
Additive functionals of infinite-variance moving averages Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535 Departments of Statistics The University of Chicago Chicago, Illinois 60637 June
More informationPrime numbers and Gaussian random walks
Prime numbers and Gaussian random walks K. Bruce Erickson Department of Mathematics University of Washington Seattle, WA 9895-4350 March 24, 205 Introduction Consider a symmetric aperiodic random walk
More information25.1 Ergodicity and Metric Transitivity
Chapter 25 Ergodicity This lecture explains what it means for a process to be ergodic or metrically transitive, gives a few characterizes of these properties (especially for AMS processes), and deduces
More informationTheory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk
Instructor: Victor F. Araman December 4, 2003 Theory and Applications of Stochastic Systems Lecture 0 B60.432.0 Exponential Martingale for Random Walk Let (S n : n 0) be a random walk with i.i.d. increments
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationRandom convolution of O-exponential distributions
Nonlinear Analysis: Modelling and Control, Vol. 20, No. 3, 447 454 ISSN 1392-5113 http://dx.doi.org/10.15388/na.2015.3.9 Random convolution of O-exponential distributions Svetlana Danilenko a, Jonas Šiaulys
More informationERRATA: Probabilistic Techniques in Analysis
ERRATA: Probabilistic Techniques in Analysis ERRATA 1 Updated April 25, 26 Page 3, line 13. A 1,..., A n are independent if P(A i1 A ij ) = P(A 1 ) P(A ij ) for every subset {i 1,..., i j } of {1,...,
More informationIt follows from the above inequalities that for c C 1
3 Spaces L p 1. Appearance of normed spaces. In this part we fix a measure space (, A, µ) (we may assume that µ is complete), and consider the A - measurable functions on it. 2. For f L 1 (, µ) set f 1
More informationKrzysztof Burdzy University of Washington. = X(Y (t)), t 0}
VARIATION OF ITERATED BROWNIAN MOTION Krzysztof Burdzy University of Washington 1. Introduction and main results. Suppose that X 1, X 2 and Y are independent standard Brownian motions starting from 0 and
More informationSome Results on the Ergodicity of Adaptive MCMC Algorithms
Some Results on the Ergodicity of Adaptive MCMC Algorithms Omar Khalil Supervisor: Jeffrey Rosenthal September 2, 2011 1 Contents 1 Andrieu-Moulines 4 2 Roberts-Rosenthal 7 3 Atchadé and Fort 8 4 Relationship
More informationNecessary and sufficient conditions for strong R-positivity
Necessary and sufficient conditions for strong R-positivity Wednesday, November 29th, 2017 The Perron-Frobenius theorem Let A = (A(x, y)) x,y S be a nonnegative matrix indexed by a countable set S. We
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More informationLARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011
LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic
More informationSYMMETRY RESULTS FOR PERTURBED PROBLEMS AND RELATED QUESTIONS. Massimo Grosi Filomena Pacella S. L. Yadava. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 21, 2003, 211 226 SYMMETRY RESULTS FOR PERTURBED PROBLEMS AND RELATED QUESTIONS Massimo Grosi Filomena Pacella S.
More informationEXISTENCE RESULTS FOR QUASILINEAR HEMIVARIATIONAL INEQUALITIES AT RESONANCE. Leszek Gasiński
DISCRETE AND CONTINUOUS Website: www.aimsciences.org DYNAMICAL SYSTEMS SUPPLEMENT 2007 pp. 409 418 EXISTENCE RESULTS FOR QUASILINEAR HEMIVARIATIONAL INEQUALITIES AT RESONANCE Leszek Gasiński Jagiellonian
More informationLectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 4. Coupling and Harris Processes
Lectures on Stochastic Stability Sergey FOSS Heriot-Watt University Lecture 4 Coupling and Harris Processes 1 A simple example Consider a Markov chain X n in a countable state space S with transition probabilities
More informationAppendix B for The Evolution of Strategic Sophistication (Intended for Online Publication)
Appendix B for The Evolution of Strategic Sophistication (Intended for Online Publication) Nikolaus Robalino and Arthur Robson Appendix B: Proof of Theorem 2 This appendix contains the proof of Theorem
More informationLimit theorems for dependent regularly varying functions of Markov chains
Limit theorems for functions of with extremal linear behavior Limit theorems for dependent regularly varying functions of In collaboration with T. Mikosch Olivier Wintenberger wintenberger@ceremade.dauphine.fr
More informationRegularity of the density for the stochastic heat equation
Regularity of the density for the stochastic heat equation Carl Mueller 1 Department of Mathematics University of Rochester Rochester, NY 15627 USA email: cmlr@math.rochester.edu David Nualart 2 Department
More informationGeometric ρ-mixing property of the interarrival times of a stationary Markovian Arrival Process
Author manuscript, published in "Journal of Applied Probability 50, 2 (2013) 598-601" Geometric ρ-mixing property of the interarrival times of a stationary Markovian Arrival Process L. Hervé and J. Ledoux
More informationGARCH processes probabilistic properties (Part 1)
GARCH processes probabilistic properties (Part 1) Alexander Lindner Centre of Mathematical Sciences Technical University of Munich D 85747 Garching Germany lindner@ma.tum.de http://www-m1.ma.tum.de/m4/pers/lindner/
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationA NEW PROOF OF THE WIENER HOPF FACTORIZATION VIA BASU S THEOREM
J. Appl. Prob. 49, 876 882 (2012 Printed in England Applied Probability Trust 2012 A NEW PROOF OF THE WIENER HOPF FACTORIZATION VIA BASU S THEOREM BRIAN FRALIX and COLIN GALLAGHER, Clemson University Abstract
More informationLecture 10. Theorem 1.1 [Ergodicity and extremality] A probability measure µ on (Ω, F) is ergodic for T if and only if it is an extremal point in M.
Lecture 10 1 Ergodic decomposition of invariant measures Let T : (Ω, F) (Ω, F) be measurable, and let M denote the space of T -invariant probability measures on (Ω, F). Then M is a convex set, although
More informationThe Codimension of the Zeros of a Stable Process in Random Scenery
The Codimension of the Zeros of a Stable Process in Random Scenery Davar Khoshnevisan The University of Utah, Department of Mathematics Salt Lake City, UT 84105 0090, U.S.A. davar@math.utah.edu http://www.math.utah.edu/~davar
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
More informationAn almost sure invariance principle for additive functionals of Markov chains
Statistics and Probability Letters 78 2008 854 860 www.elsevier.com/locate/stapro An almost sure invariance principle for additive functionals of Markov chains F. Rassoul-Agha a, T. Seppäläinen b, a Department
More informationOn Finding Optimal Policies for Markovian Decision Processes Using Simulation
On Finding Optimal Policies for Markovian Decision Processes Using Simulation Apostolos N. Burnetas Case Western Reserve University Michael N. Katehakis Rutgers University February 1995 Abstract A simulation
More informationContinued fractions for complex numbers and values of binary quadratic forms
arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties
More informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More informationExamples of Dual Spaces from Measure Theory
Chapter 9 Examples of Dual Spaces from Measure Theory We have seen that L (, A, µ) is a Banach space for any measure space (, A, µ). We will extend that concept in the following section to identify an
More informationAsymptotic Tail Probabilities of Sums of Dependent Subexponential Random Variables
Asymptotic Tail Probabilities of Sums of Dependent Subexponential Random Variables Jaap Geluk 1 and Qihe Tang 2 1 Department of Mathematics The Petroleum Institute P.O. Box 2533, Abu Dhabi, United Arab
More informationConditional independence, conditional mixing and conditional association
Ann Inst Stat Math (2009) 61:441 460 DOI 10.1007/s10463-007-0152-2 Conditional independence, conditional mixing and conditional association B. L. S. Prakasa Rao Received: 25 July 2006 / Revised: 14 May
More informationThe exact asymptotics for hitting probability of a remote orthant by a multivariate Lévy process: the Cramér case
The exact asymptotics for hitting probability of a remote orthant by a multivariate Lévy process: the Cramér case Konstantin Borovkov and Zbigniew Palmowski Abstract For a multivariate Lévy process satisfying
More informationITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour
More informationProof. We indicate by α, β (finite or not) the end-points of I and call
C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending
More informationThe parabolic Anderson model on Z d with time-dependent potential: Frank s works
Weierstrass Institute for Applied Analysis and Stochastics The parabolic Anderson model on Z d with time-dependent potential: Frank s works Based on Frank s works 2006 2016 jointly with Dirk Erhard (Warwick),
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationLogarithmic scaling of planar random walk s local times
Logarithmic scaling of planar random walk s local times Péter Nándori * and Zeyu Shen ** * Department of Mathematics, University of Maryland ** Courant Institute, New York University October 9, 2015 Abstract
More informationA CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN. Dedicated to the memory of Mikhail Gordin
A CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN Dedicated to the memory of Mikhail Gordin Abstract. We prove a central limit theorem for a square-integrable ergodic
More informationP (A G) dp G P (A G)
First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume
More informationPCA with random noise. Van Ha Vu. Department of Mathematics Yale University
PCA with random noise Van Ha Vu Department of Mathematics Yale University An important problem that appears in various areas of applied mathematics (in particular statistics, computer science and numerical
More informationNormal Approximation for Hierarchical Structures
Normal Approximation for Hierarchical Structures Larry Goldstein University of Southern California July 1, 2004 Abstract Given F : [a, b] k [a, b] and a non-constant X 0 with P (X 0 [a, b]) = 1, define
More informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationLecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is
MARKOV CHAINS What I will talk about in class is pretty close to Durrett Chapter 5 sections 1-5. We stick to the countable state case, except where otherwise mentioned. Lecture 7. We can regard (p(i, j))
More informationJUHA KINNUNEN. Harmonic Analysis
JUHA KINNUNEN Harmonic Analysis Department of Mathematics and Systems Analysis, Aalto University 27 Contents Calderón-Zygmund decomposition. Dyadic subcubes of a cube.........................2 Dyadic cubes
More information( f ^ M _ M 0 )dµ (5.1)
47 5. LEBESGUE INTEGRAL: GENERAL CASE Although the Lebesgue integral defined in the previous chapter is in many ways much better behaved than the Riemann integral, it shares its restriction to bounded
More informationSCHWARTZ SPACES ASSOCIATED WITH SOME NON-DIFFERENTIAL CONVOLUTION OPERATORS ON HOMOGENEOUS GROUPS
C O L L O Q U I U M M A T H E M A T I C U M VOL. LXIII 1992 FASC. 2 SCHWARTZ SPACES ASSOCIATED WITH SOME NON-DIFFERENTIAL CONVOLUTION OPERATORS ON HOMOGENEOUS GROUPS BY JACEK D Z I U B A Ń S K I (WROC
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
More informationOn the concentration of eigenvalues of random symmetric matrices
On the concentration of eigenvalues of random symmetric matrices Noga Alon Michael Krivelevich Van H. Vu April 23, 2012 Abstract It is shown that for every 1 s n, the probability that the s-th largest
More informationGärtner-Ellis Theorem and applications.
Gärtner-Ellis Theorem and applications. Elena Kosygina July 25, 208 In this lecture we turn to the non-i.i.d. case and discuss Gärtner-Ellis theorem. As an application, we study Curie-Weiss model with
More informationTAUBERIAN THEOREM FOR HARMONIC MEAN OF STIELTJES TRANSFORMS AND ITS APPLICATIONS TO LINEAR DIFFUSIONS
Kasahara, Y. and Kotani, S. Osaka J. Math. 53 (26), 22 249 TAUBERIAN THEOREM FOR HARMONIC MEAN OF STIELTJES TRANSFORMS AND ITS APPLICATIONS TO LINEAR DIFFUSIONS YUJI KASAHARA and SHIN ICHI KOTANI (Received
More informationCombinatorial Dimension in Fractional Cartesian Products
Combinatorial Dimension in Fractional Cartesian Products Ron Blei, 1 Fuchang Gao 1 Department of Mathematics, University of Connecticut, Storrs, Connecticut 0668; e-mail: blei@math.uconn.edu Department
More informationBRANCHING PROCESSES 1. GALTON-WATSON PROCESSES
BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES Galton-Watson processes were introduced by Francis Galton in 1889 as a simple mathematical model for the propagation of family names. They were reinvented
More informationA Note on the Central Limit Theorem for a Class of Linear Systems 1
A Note on the Central Limit Theorem for a Class of Linear Systems 1 Contents Yukio Nagahata Department of Mathematics, Graduate School of Engineering Science Osaka University, Toyonaka 560-8531, Japan.
More informationRichard F. Bass Krzysztof Burdzy University of Washington
ON DOMAIN MONOTONICITY OF THE NEUMANN HEAT KERNEL Richard F. Bass Krzysztof Burdzy University of Washington Abstract. Some examples are given of convex domains for which domain monotonicity of the Neumann
More informationE-Companion to The Evolution of Beliefs over Signed Social Networks
OPERATIONS RESEARCH INFORMS E-Companion to The Evolution of Beliefs over Signed Social Networks Guodong Shi Research School of Engineering, CECS, The Australian National University, Canberra ACT 000, Australia
More informationFaithful couplings of Markov chains: now equals forever
Faithful couplings of Markov chains: now equals forever by Jeffrey S. Rosenthal* Department of Statistics, University of Toronto, Toronto, Ontario, Canada M5S 1A1 Phone: (416) 978-4594; Internet: jeff@utstat.toronto.edu
More informationLecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.
Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution
More informationA slow transient diusion in a drifted stable potential
A slow transient diusion in a drifted stable potential Arvind Singh Université Paris VI Abstract We consider a diusion process X in a random potential V of the form V x = S x δx, where δ is a positive
More informationCounting geodesic arcs in a fixed conjugacy class on negatively curved surfaces with boundary
Counting geodesic arcs in a fixed conjugacy class on negatively curved surfaces with boundary Mark Pollicott Abstract We show how to derive an asymptotic estimates for the number of closed arcs γ on a
More informationON THE DYNAMICAL SYSTEMS METHOD FOR SOLVING NONLINEAR EQUATIONS WITH MONOTONE OPERATORS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume, Number, Pages S -9939(XX- ON THE DYNAMICAL SYSTEMS METHOD FOR SOLVING NONLINEAR EQUATIONS WITH MONOTONE OPERATORS N. S. HOANG AND A. G. RAMM (Communicated
More informationZeros of lacunary random polynomials
Zeros of lacunary random polynomials Igor E. Pritsker Dedicated to Norm Levenberg on his 60th birthday Abstract We study the asymptotic distribution of zeros for the lacunary random polynomials. It is
More informationOn Kesten s counterexample to the Cramér-Wold device for regular variation
On Kesten s counterexample to the Cramér-Wold device for regular variation Henrik Hult School of ORIE Cornell University Ithaca NY 4853 USA hult@orie.cornell.edu Filip Lindskog Department of Mathematics
More information1 Sequences of events and their limits
O.H. Probability II (MATH 2647 M15 1 Sequences of events and their limits 1.1 Monotone sequences of events Sequences of events arise naturally when a probabilistic experiment is repeated many times. For
More informationA probabilistic proof of Perron s theorem arxiv: v1 [math.pr] 16 Jan 2018
A probabilistic proof of Perron s theorem arxiv:80.05252v [math.pr] 6 Jan 208 Raphaël Cerf DMA, École Normale Supérieure January 7, 208 Abstract Joseba Dalmau CMAP, Ecole Polytechnique We present an alternative
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationNotes 1 : Measure-theoretic foundations I
Notes 1 : Measure-theoretic foundations I Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Section 1.0-1.8, 2.1-2.3, 3.1-3.11], [Fel68, Sections 7.2, 8.1, 9.6], [Dur10,
More informationThe concentration of the chromatic number of random graphs
The concentration of the chromatic number of random graphs Noga Alon Michael Krivelevich Abstract We prove that for every constant δ > 0 the chromatic number of the random graph G(n, p) with p = n 1/2
More informationCONDITIONAL ERGODICITY IN INFINITE DIMENSION. By Xin Thomson Tong and Ramon van Handel Princeton University
CONDITIONAL ERGODICITY IN INFINITE DIMENSION By Xin Thomson Tong and Ramon van Handel Princeton University The goal of this paper is to develop a general method to establish conditional ergodicity of infinite-dimensional
More informationarxiv: v1 [math.pr] 22 May 2008
THE LEAST SINGULAR VALUE OF A RANDOM SQUARE MATRIX IS O(n 1/2 ) arxiv:0805.3407v1 [math.pr] 22 May 2008 MARK RUDELSON AND ROMAN VERSHYNIN Abstract. Let A be a matrix whose entries are real i.i.d. centered
More informationResistance Growth of Branching Random Networks
Peking University Oct.25, 2018, Chengdu Joint work with Yueyun Hu (U. Paris 13) and Shen Lin (U. Paris 6), supported by NSFC Grant No. 11528101 (2016-2017) for Research Cooperation with Oversea Investigators
More informationProofs for Large Sample Properties of Generalized Method of Moments Estimators
Proofs for Large Sample Properties of Generalized Method of Moments Estimators Lars Peter Hansen University of Chicago March 8, 2012 1 Introduction Econometrica did not publish many of the proofs in my
More informationConvergence Rates for Renewal Sequences
Convergence Rates for Renewal Sequences M. C. Spruill School of Mathematics Georgia Institute of Technology Atlanta, Ga. USA January 2002 ABSTRACT The precise rate of geometric convergence of nonhomogeneous
More informationThe Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation:
Oct. 1 The Dirichlet s P rinciple In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: 1. Dirichlet s Principle. u = in, u = g on. ( 1 ) If we multiply
More information5 Birkhoff s Ergodic Theorem
5 Birkhoff s Ergodic Theorem Birkhoff s Ergodic Theorem extends the validity of Kolmogorov s strong law to the class of stationary sequences of random variables. Stationary sequences occur naturally even
More informationprocess on the hierarchical group
Intertwining of Markov processes and the contact process on the hierarchical group April 27, 2010 Outline Intertwining of Markov processes Outline Intertwining of Markov processes First passage times of
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationBrownian Motion. 1 Definition Brownian Motion Wiener measure... 3
Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................
More informationIt follows from the above inequalities that for c C 1
3 Spaces L p 1. In this part we fix a measure space (, A, µ) (we may assume that µ is complete), and consider the A -measurable functions on it. 2. For f L 1 (, µ) set f 1 = f L 1 = f L 1 (,µ) = f dµ.
More informationON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA
ON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA Holger Boche and Volker Pohl Technische Universität Berlin, Heinrich Hertz Chair for Mobile Communications Werner-von-Siemens
More informationCombinatorial Criteria for Uniqueness of Gibbs Measures
Combinatorial Criteria for Uniqueness of Gibbs Measures Dror Weitz* School of Mathematics, Institute for Advanced Study, Princeton, New Jersey 08540; e-mail: dror@ias.edu Received 17 November 2003; accepted
More informationCountable state discrete time Markov Chains
Countable state discrete time Markov Chains Tuesday, March 18, 2014 2:12 PM Readings: Lawler Ch. 2 Karlin & Taylor Chs. 2 & 3 Resnick Ch. 1 Countably infinite state spaces are of practical utility in situations
More informationRare event simulation for the ruin problem with investments via importance sampling and duality
Rare event simulation for the ruin problem with investments via importance sampling and duality Jerey Collamore University of Copenhagen Joint work with Anand Vidyashankar (GMU) and Guoqing Diao (GMU).
More informationReduced-load equivalence for queues with Gaussian input
Reduced-load equivalence for queues with Gaussian input A. B. Dieker CWI P.O. Box 94079 1090 GB Amsterdam, the Netherlands and University of Twente Faculty of Mathematical Sciences P.O. Box 17 7500 AE
More informationThe Skorokhod reflection problem for functions with discontinuities (contractive case)
The Skorokhod reflection problem for functions with discontinuities (contractive case) TAKIS KONSTANTOPOULOS Univ. of Texas at Austin Revised March 1999 Abstract Basic properties of the Skorokhod reflection
More information