A generalized allocation scheme


 Abner Hubbard
 3 years ago
 Views:
Transcription
1 Annales Mathematicae et Informaticae 39 (202) pp Proceedings of the Conference on Stochastic Models and their Applications Faculty of Informatics, University of Debrecen, Debrecen, Hungary, August 22 24, 20 A generalized allocation scheme István Fazekas a, Bettina Porvázsnyik b a University of Debrecen, Faculty of Informatics Debrecen, Hungary b University of Debrecen, Faculty of Science and Technology Debrecen, Hungary Dedicated to Mátyás Arató on his eightieth birthday Abstract The generalized allocation scheme was introduced by V.F. Kolchin []. Let ξ, ξ 2,..., ξ be independent identically distributed nonnegative integer valued nondegenerate random variables. Consider the random variables η,..., η with joint distribution Pη = k,..., η = k = P ξ = k,..., ξ = k ξi = n. Let ξ i have Poisson distribution, then (η,..., η ) has polynomial distribution. Therefore η = k,..., η = k means that the contents of the boxes are k,..., k after allocating n balls into boxes during the usual allocation procedure. Our aim is to study random variables η,..., η with joint distribution Pη = k,..., η = k = P ξ = k,..., ξ = k ξi n. It can be considered as a general allocation scheme when we place at least n balls into boxes. Let µ n denote the number of cases when η i = r. That is µ n is the number of boxes containing r balls. We shall prove limit theorems for Pµ n = k. Moreover, we shall consider the asymptotic behaviour of Pmax i η i r and Pmin i η i r. Keywords: generalized allocation scheme, conditional probability, law of large numbers, central limit theorem, Poisson distribution. MSC: 60C05, 60F05 Supported by the Hungarian Scientific Research Fund under Grant o. OTKA T07928/2009. Supported by the TÁMOP4.2.2/B0/ project. The project is cofinanced by the European Union and the European Social Fund. 57
2 58 I. Fazekas, B. Porvázsnyik. Introduction The usual allocation scheme is the following. Let n balls be placed successively and independently into boxes. At any allocation the ball can fall into each box with probability /. This model was widely studied. See the early papers Weiss [3], Rényi [2], Békéssy [] and the monograph KolchinSevast yanovchistyakov [8]. See also ChuprunovFazekas [2] for certain recent results. A generalization of the usual allocation scheme was introduced by V.F. Kolchin (see the monographs of Kolchin [7] and Pavlov [0]). Let η, η 2,..., η be nonnegative integervalued random variables. In Kolchin s generalized allocation scheme the joint distribution of η, η 2,..., η can be represented as Pη = k,..., η = k = P ξ = k,..., ξ = k ξ i = n, (.) where ξ, ξ 2,..., ξ are independent identically distributed nonnegative integer valued nondegenerate random variables and k, k 2,..., k are arbitrary nonnegative integers, k + k k = n. This scheme contains the usual allocation procedure, certain random forests, and several other models (see the monographs of Kolchin [7] and Pavlov [0]). The usual allocation scheme is obtained as follows. Let ξ i have Poisson distribution, i.e. P(ξ i = k) = λk k! e λ, k = 0,,.... Then ( ) n n! Pξ = k,..., ξ = k ξ + + ξ = n = k!... k! if k + + k = n. That is (η,..., η ) has polynomial distribution. ow η = k,..., η = k means that the cell contents are k,..., k after allocating n particles into cells considering the usual allocation procedure. The connection of the random forest and the generalized allocation scheme is the following. Let T n, denote the set of forests containing labelled roots and n labelled nonroot vertices. By Cayley s theorem, T n, has (n + ) n elements. Consider uniform distribution on T n,. Let η i denote the number of the nonroot vertices of the ith tree. Then Pη = k,..., η = k = n! (k + ) k... (k + ) k k!... k! ( + n) n. ow let ξ i have Borel distribution (see [5], [9]) P(ξ i = k) = λk (+k) k k! e (k+)λ, k = 0,,..., λ > 0. Then Pξ = k,..., ξ = k ξ + + ξ = n = n! (k + ) k... (k + ) k k!... k! ( + n) n if k + + k = n. See [7, 2, 0]. Therefore η,..., η satisfy (.).
3 A generalized allocation scheme 59 We can say that in the generalized allocation scheme we place n balls into boxes. In the framework of the generalized allocation scheme several asymptotic results can be obtained. Let µ r be the number of the random variables η, η 2,..., η being equal to r (r = 0,,..., n). Observe that µ r = µ rn = µ n = I η i =r (.2) can be considered as the number of boxes containing r balls. Here I A is the indicator of the set A, i.e. I A (x) = if x A and I A (x) = 0 if x A. (µ r, µ rn, and µ n are just different notations for the same quantity.) Limit results for µ r can be obtained in the following way. Let ξ 0 be a random variable with the same distribution as ξ. Let p r = Pξ 0 = r and Eξ 0 = a. Introduce notation S = ξ i. Denote by ξ (r) 0 a random variable with distribution Pξ (r) 0 = k = Pξ 0 = k ξ 0 r. (.3) The expectation and the second moment of ξ (r) 0 are the following a r = Eξ (r) 0 = a rp ( ) 2 r and E ξ (r) Eξ 0 = 0 2 r 2 p r. Let ξ (r) p r p,..., ξ(r) be independent copies of r ξ (r) 0. Let S(r) = ξ(r) i. Denote by C k the binomial coefficient Ck = ( ) k. V.F. Kolchin proved in [7] the following lemma. Lemma.. Let µ n and ξ(r) 0 be defined by (.2) and (.3), respectively. Then Pµ n = k = Cp k k PS(r) k k r( p r ) = n kr. (.4) PS = n Using this representation, normal and Poisson limit theorems were obtained (see [7], and [0]). In [4] a modification of the generalized allocation scheme was studied, that is in (.) the condition was changed for ξ i n. In this paper we introduce another scheme, i.e. we use in (.) condition of the form ξ i n. It can be considered as a general allocation scheme when we place at least n balls into boxes. Let µ n denote the number of cases when η i = r. That is µ n is the number of boxes containing r balls. We shall prove limit theorems for Pµ n = k. Moreover, we shall consider the asymptotic behaviour of Pmax i η i r and Pmin i η i r. In Section 2 Pµ n = k is studied. In sections 3 and 4 Pmax i η i r and Pmin i η i r are considered, respectively. 2. Another generalized allocation scheme Let ξ, ξ 2,..., ξ be independent identically distributed nonnegative integervalued nondegenerate random variables. Consider random variables η, η 2,..., η with
4 60 I. Fazekas, B. Porvázsnyik joint distribution Pη = k,..., η = k = P ξ = k,..., ξ = k ξ i n. (2.) In this case, we place at least n balls into boxes. Example 2.. Let ξ i have Poisson distribution, i.e. 0,,.... Then Pξ = k,..., ξ = k ξ + + ξ n = P(ξ i = k) = λk k! e λ, k = / k!... k! λk0 k=n (λ) k k! (2.2) if k + + k = k 0 n. ow, we place η (random number) balls into boxes. Assume that η n. Let η i denote the number of balls in the ith box. Then Pη = k,..., η = k = = P(η = k,..., η = k η = i)p(η = i) i=n k 0! k!... k! ( ) k0 P(η = k 0 ), (2.3) if k + + k = k 0 n. If we choose the a priori distribution of η as Poisson distribution truncated from below, i.e P(η = i) = (λ)i e λ/ i! k=n (λ) k e λ, i = n, n +,..., k! then we obtain (2.2). That is our scheme (2.) with ξ i having Poisson distribution describes the usual allocation when the number of balls is given by a truncated Poisson distribution. Let µ r = µ rn = µ n = I η i=r be the number of the boxes containing r balls. Then we have the following analogue of Kolchin s formula (.4) for our model. Recall that ξ (r) 0 is defined by (.3). Theorem 2.2. For all k = 0,, 2,..., we have Pµ n = k = Cp k k PS(r) k k r( p r ) n kr. (2.4) PS n Proof. (2.4) can be proved by a certain modification of the proof of Lemma.. Let A (r) k be the event that exactly k of the random variables ξ,..., ξ are equal to r. By (2.), we have Pµ n = k = P(A (r) k S n) = P(A(r) k, S n). P(S n)
5 A generalized allocation scheme 6 Furthermore, P(A (r) k, S n) = P(S n A (r) k )P(A(r) k ) = C k p k r( p r ) k P(S n ξ r,..., ξ k r, ξ k+ = r,..., ξ = r) = C k p k r( p r ) k P(S (r) k n kr). Here we have used that ξ,..., ξ are independent random variables and the event can occur C k different ways, moreover A (r) k P(S n A (r) k ) = P(S n, A (r) k ) P(A (r) k ) = P(ξ + + ξ n, ξ r,..., ξ k r, ξ k+ = r,..., ξ = r) P(ξ r,..., ξ k r, ξ k+ = r,..., ξ = r) = P(ξ + + ξ k n kr, ξ r,..., ξ k r, ξ k+ = r,..., ξ = r) P(ξ r,..., ξ k r, ξ k+ = r,..., ξ = r) = P(ξ + + ξ k n kr, ξ r,..., ξ k r). P(ξ r,..., ξ k r) The proofs of our limit theorems are based on representation (2.4). First we consider two theorems with normal limiting distribution. Let α n = n. Theorem 2.3. Let Eξ 0 = a be finite, Eξ (r) 0 = a r, s 2 r = p r ( p r ). () Let d < a. Then, uniformly for α n < d, we have Pµ n = k = 2πsr e u2 /2 ( + o()), (2.5) as n, and u = k pr s r belongs to an arbitrary bounded fixed interval. /2 (2) Suppose that a r < a. Let a r < d < d < a. If k belongs to a bounded interval, then we have lim Pµ n = k = 0. (2.6) n,, d <α n <d Proof. () By the MoivreLaplace Theorem we have C k p k r( p r ) k = as uniformly if u = k pr s r /2 s 2 r = p r ( p r ). lim P n,, α n <d 2πsr e u2 /2 ( + o()), (2.7) belongs to a bounded fixed interval, where As α n < d < a, applying Kolmogorov s law of large numbers, we obtain k lim P n,, α n <d ξ (r) i n kr ξ i n =. =, (2.8)
6 62 I. Fazekas, B. Porvázsnyik ow (2.4), (2.7) and (2.8) imply (2.5). (2) Let d < α n < d. By Kolmogorov s law of large numbers, we have lim P n,, d <α n <d k ξ (r) i n kr We obtain (2.6) from (2.4), if we apply (2.7) and (2.9). = 0. (2.9) Remark 2.4. It is easy to see that a < a r, a > a r and a = a r if and only if a > r, a < r and a = r, respectively. Let Φ denote the standard normal distribution function. Recall that a = Eξ 0, a r = Eξ (r) 0 and s 2 r = p r ( p r ). Theorem 2.5. Suppose that Eξ0 2 <. Denote by σ 2 the variance of ξ 0 and by σr 2 the variance of ξ (r) 0. Assume 0 < σ2, σr 2 <. Let C <. Then, as n, such that (α n a) C, we have ( ) a r C+us r Φ pr prσ r Pµ n = k = e u2 /2 2πsr Φ ( ) + o() C, (2.0) σ for u = k pr s r /2 belonging to any bounded fixed interval. Proof. As σ 2 = D 2 (ξ 0 ) < and σr 2 = D 2 (ξ (r) 0 ) <, by the central limit theorem, we obtain P ξ i n = P ξ i a (αn a) σ σ ( ) (αn a) = Φ + o(), (2.) σ and similarly we obtain P k ξ (r) i n kr = Φ a r (αn a) + us r p r + o(). (2.2) pr σ r Using (2.), (2.2), and (2.7), relation (2.4) implies the desired result. Using large deviation theorems we can describe the relation between µ n and µ n. Let X, X 2,... be independent identically distributed nonnegative nondegenerate random variables with lattice distribution (assume that the span of the
7 A generalized allocation scheme 63 distribution of X is ). Suppose that Cramér s condition is satisfied, that is Ee λ0x < for some λ 0 > 0. Let Z = X + + X. Introduce notation M(h) = Ee hx, a(h) = (ln(m(h))), v 2 (h) = a (h). As X is nondegenerate, therefore a (h) > 0, so a( ) is strictly increasing. We have the following lemma from []. Lemma 2.6. Let x be an integer number and let h = a ( x ). Then, as, we have P(Z = x) = P(Z x) = ( ( v(h) 2π M (h)e hx + O v(h) 2π M (h)e hx ( e h ) )), ( ( )) + O uniformly for x, with a(ε) x a(λ 0 ε), where ε is an arbitrary small positive number. In particular Introduce notation P(Z x) P(Z = x) = ( e h ) ( + o()). (2.3) L(λ) = Ee λξ0, L r (λ) = Ee λξ(r) 0 where we assume that there exist positive constants λ 0 > 0 and λ (r) 0 > 0 such that Ee λ0ξ0 < and Ee λ(r) 0 ξ(r) 0 < (Cramér s condition). Let m(λ) = (ln(l(λ))), σ 2 (λ) = m (λ), 0 λ λ 0, m r (λ) = (ln(l r (λ))), σ 2 r(λ) = m r(λ), 0 λ λ (r) 0. As ξ 0 is nondegenerate, therefore m(.) is strictly increasing. Assume that 0 < P(ξ 0 = 0) <. Moreover, if we additionally assume that r 0 and P(ξ 0 = 0) + P(ξ 0 = r) <, then ξ (r) 0 is nondegenerate, therefore similar property is valid for the function m r (.). Let h = m (α n ), h r = m r (α n ), and β(α n ) = e h e. hr Theorem 2.7. Assume r > 0, P(ξ 0 = 0) > 0, and P(ξ 0 = 0) + P(ξ 0 = r) <. Let maxa, a r < d < d 2 < minm(λ 0 ), m r (λ (r) 0 ). Then, as n,, we have uniformly for d < α n < d 2. Pµ n = k = Pµ n = kβ(α n )( + o()) (2.4) Proof. We obtain Theorem 2.7 from (2.4) and from Lemma., if we apply (2.3) both for ξ i and for ξ (r) i.
8 64 I. Fazekas, B. Porvázsnyik We shall use the so called power series distribution. Consider the random variable ξ 0 with the following distribution. Let b 0, b, b 2,... be a sequence of nonnegative numbers and let R denote the radius of convergence of the series B(θ) = k=0 b k θ k. k! Assume that R > 0. Let ξ 0 = ξ 0 (θ) have the following distribution p k = p k (θ) = Pξ 0 (θ) = k = Differentiating B(θ) for 0 θ < R, we obtain Eξ 0 (θ) = θb (θ) B(θ), D2 ξ 0 (θ) = θ2 B (θ) B(θ) b kθ k, k = 0,, 2,.... (2.5) k!b(θ) + Eξ 0 (θ) (Eξ 0 (θ)) 2 (see e.g. [7]). We will assume that the distribution of the random variable ξ 0 (θ) satisfies b 0 > 0, b > 0. (2.6) We emphasize that the distribution of ξ 0 = ξ 0 (θ) is not fixed, it depends on θ. We have the following Poisson limit theorem. Theorem 2.8. Suppose that the random variable ξ 0 = ξ 0 (θ) has distribution (2.5), n condition (2.6) is satisfied. Let θ K < R. Let r > and 0. Let r such that p r (θ) λ for some 0 < λ <. Then for all k we have Pµ n = k = λk e λ ( + o()). (2.7) k! Proof. Let k. By the Poisson limit theorem, one has Cp k k r( p r ) k = λk e λ ( + o()). (2.8) k! Relation p r (θ) λ implies that θ = o(), B(θ) = b 0 + o(), B (θ) = b + o() and B (θ) = b 2 + o(). Therefore θ = We know that Eξ 0 = θb (θ) B(θ). Therefore Eξ 0 = b b 0 ( r!(b0 λ + o()) b r ( ) r!(b0λ+o()) /r. b r ) /r ( ) /r ( + o()) = C ( + o()). (2.9) Here and in what follows C denotes an appropriate constant (its value can be different in different formulae). Similarly ( ) /r D 2 ξ 0 = C ( + o()). (2.20)
9 A generalized allocation scheme 65 ow applying condition (2.20), we obtain n r As Eξ (r) 0 = Eξ 0 rp r p r, so (2.9) and condition n r We have We obtain ow applying condition (2.24), we obtain 0, Chebishev s inequality and relations (2.9), P S n = ( + o()). (2.2) 0 imply that ( ) /r Eξ (r) 0 = C ( + o()). (2.22) D 2 ξ (r) 0 = Eξ2 0 a 2 p r ( p r ) 2 + 2arp r ( p r ) 2 r2 p r ( p r ) 2. (2.23) ( ) /r D 2 ξ (r) 0 = C ( + o()). (2.24) n r 0, Chebishev s inequality and relations (2.22), PS (r) k n kr = ( + o()). (2.25) Inserting (2.2), (2.25), and (2.8) into (2.4), we obtain (2.7). 3. Limit theorems for max i η i Let η () = max i η i. η () is the maximal number of balls contained by any of the boxes. Let ξ ( r) 0 be a random variable with distribution Pξ ( r) 0 = k = Pξ 0 = k ξ 0 r. Let ξ ( r) i, i =,...,, be independent copies of ξ ( r) 0. Let S ( r) = ξ( r) i and Eξ ( r) 0 = a r. We can see that a r a. Moreover, a r = a if and only if P(ξ 0 r) =, that is ξ 0 and ξ ( r) 0 have the same distribution. The following representation of η () is useful to obtain limit results. Theorem 3.. We have for all r where P r = Pξ 0 > r. Pη () r = ( P r ) PS( r) n PS n, (3.)
10 66 I. Fazekas, B. Porvázsnyik Proof. Pη () r = Pη r,..., η r = P ξ r,..., ξ r ξ i n P ξ r,..., ξ r, S n = P S n P S n ξ r,..., ξ r = (Pξ r) P S n = ( P r ) PS( r) n PS n. Theorem 3.2. () Let d < a r. Then for all fixed r, as n,, we have Pη () r = ( P r ) ( + o()) (3.2) uniformly for α n < d. (2) Suppose that a r < a and a r < d < d < a. Then for all fixed r, as n,, we have Pη () r = ( P r ) o() (3.3) uniformly for d > α n > d. Proof. () Apply Kolmogorov s law of large numbers for S and S ( r) in (3.). Then (3.2) follows. (2) If d < α n < d and we apply Kolmogorov s law of large numbers, then we obtain lim P S ( r) n,, d <α n <d n = 0. (3.4) Theorem 3.3. Suppose that Eξ0 2 < and let σ r 2 be the variance of ξ( r) 0. Let C <. Then, for all r, as n, such that (α n a) C, we have ( ) Pη () r = ( P r ) Φ C σ r Φ ( ) + o(), for a C r = a, (3.5) σ Pη () r = ( P r ) o(), for a r < a. (3.6) Proof. By the central limit theorem, we have P n = P ξ( r) i a r ξ ( r) i σ r (αn a r ) σ r
11 A generalized allocation scheme 67 ( ) (αn a r ) = Φ + o(). (3.7) σ r In relation (3.) apply (2.) and (3.7) to obtain (3.5) and (3.6). Let η () = max i η i be the maximum in the usual generalized allocation scheme (.). Using large deviation results, we can describe the relation of η () and η (). Introduce notation L r (λ) = Ee λξ( r) 0 where we assume that there exist a positive constant λ ( r) 0 > 0, such that Let Ee λ( r) 0 ξ ( r) 0 < (Cramér s condition). m r (λ) = (ln(l r (λ))), σ 2 r(λ) = m r(λ), 0 λ λ ( r) 0. Let r. If P(ξ 0 = 0) > 0 and P(ξ 0 r) > P(ξ 0 = 0), then ξ ( r) 0 is nondegenerate, therefore m r (.) is a strictly increasing function. Let h = m (α n ), h r = m r (α n ), and β r (α n ) = e h. e h r Theorem 3.4. Assume that r, P(ξ 0 = 0) > 0, and P(ξ 0 r) > P(ξ 0 = 0). Let maxa, a r < d < d 2 < minm(λ 0 ), m r (λ ( r) 0 ). Then, for all r as n,, we have uniformly for d < α n < d 2. Pη () r = Pη () rβ r (α n )( + o()) (3.8) Proof. For the usual generalized allocation scheme, V.F. Kolchin in [7] obtained that Pη () r = ( P r) PS( r) = n (3.9) PS = n for all r where P r = Pξ 0 > r. Using (3.9) and (3.) and applying (2.3) both for ξ i and for ξ ( r) i, the proof of Theorem 3.4 is complete. Theorem 3.5. Suppose that the random variable ξ = ξ(θ) has distribution (2.5), condition (2.6) is satisfied and θ K < R. Let r. Let θ = θ() be such that n p r+ (θ) λ where 0 < λ <. Then, as n, such that 0, we r/(r+) have Pη () = r = e λ + o(), (3.0) Pη () = r + = e λ + o(). (3.)
12 68 I. Fazekas, B. Porvázsnyik Proof. Relation n 0 implies that r/(r+) ( ) /(r+) (r + )!(b0 λ + o()) B(θ) = b 0 + o() and θ =. b r+ Using r + instead of r in the proof of Theorem 2.8, we obtain Let r. Then Moreover, P S n = ( + o()). (3.2) ( ( ) ) /(r+) k r Eξ ( r) k= k b k (r+)!(b0λ+o()) k!b 0 b r+ 0 = ( ( ) ) /(r+) k ( + o()) r b k (r+)!(b0λ+o()) k=0 k!b 0 b r+ ( ) /(r+) = C ( + o()). (3.3) ( ) /(r+) D 2 ξ ( r) 0 C ( + o()). (3.4) Using Chebishev s inequality, (3.3) and (3.4), we obtain Using relations θ 0 and p r+ (θ) λ, we obtain PS ( r) n = ( + o()). (3.5) ( P r ) = o(), ( P r ) = e λ + o(), ( P r+ ) = + o(). (3.6) Inserting (3.2), (3.5), and (3.6) into (3.), we obtain Pη () r = o(), Pη () r = e λ + o(), Pη () r + = + o(). These relations imply (3.0) and (3.). 4. Limit theorems for min i η i In this section we shall prove limit theorems for the minimal content of the boxes. Let η ( ) = min i η i. Let ξ ( r) 0 be a random variable with distribution Pξ ( r) 0 = k = Pξ 0 = k ξ 0 r. Let ξ ( r), i =,...,, be independent copies of ξ ( r) 0. Let S ( r) = ξ( r) i i and Eξ ( r) 0 = a r. One can see that Eξ ( r) 0 Eξ 0 and equality can happen if and only if ξ ( r) 0 = ξ 0. We start with an appropriate representation of η ( )
13 A generalized allocation scheme 69 Theorem 4.. We have for all r where Q r = Pξ 0 < r. Proof. Pη ( ) r = ( Q r ) PS( r) n PS n, (4.) Pη ( ) r = Pη r,..., η r = P ξ r,..., ξ r ξ i n P ξ r,..., ξ r, S n = P S n P S n ξ r,..., ξ r = (Pξ r) P S n = ( Q r ) PS( r) n PS n. Theorem 4.2. Let d < a. Then for all r, as n,, we have uniformly for α n < d. Pη ( ) r = ( Q r ) ( + o()) (4.2) Proof. We apply Kolmogorov s law of large numbers for S Then we obtain (4.2). and S ( r) in (4.). Theorem 4.3. Suppose that Eξ0 2 < and let σ r 2 be the variance of ξ( r) 0. Let C <. Then, for all r, as n, such that (α n a) C, we have ( ) Pη ( ) r = ( Q r ) Φ C σ r Φ ( ) + o(), for a C r = a, (4.3) σ ( ) Pη ( ) r = ( Q r ) Φ ( ) + o(), for a C r > a. (4.4) σ Proof. By the central limit theorem, we have P n = P ξ( r) i a r (αn a r ) ξ ( r) i σ r σ r ( ) (αn a r ) = Φ + o(). (4.5) In relation (4.) apply (2.) and (4.5). Then we obtain (4.3) and (4.4). σ r
14 70 I. Fazekas, B. Porvázsnyik References [] Békéssy, A. On classical occupancy problems. I. Magy. Tud. Akad. Mat. Kutató Int. Közl. 8 (963), o.2, [2] Chuprunov, A.. and Fazekas, I. Inequalities and strong laws of large numbers for random allocations. Acta Math. Hungar. 09 (2005), o.2, [3] Chuprunov, A.. and Fazekas, I. An inequality for moments and its applications to the generalized allocation scheme. Publ. Math. Debrecen, 76 (200), no. 3, [4] Chuprunov, A.. and Fazekas, I. One some analogue of the generalized allocation scheme. (Russian) Diskretnaya Matematika, 2(202), o.. [5] Johnson,. L., Kemp, A. W. and Kotz, S. Univariate Discrete Distributions. Third edition. Wiley Series in Probability and Statistics. WileyInterscience, Hoboken, J, [6] Kolchin, A. V. and Kolchin, V. F. On transition of distributions of sums of independent identically distributed random variables from one lattice to another in the generalised allocation scheme. (Russian) Diskret. Mat. 8 (2006), no. 4, 3 27; translation in Discrete Math. Appl. 6 (2006), no. 6, [7] Kolchin, V.F. Random Graphs. Cambridge University Press, Cambridge, 999. [8] Kolchin, V.F., Sevast yanov, B.A. and Chistyakov, V.P. Random allocations. V.H. Winston & Sons, Washington D. C [9] Lerner, B., Lone, A. and Rao, M. On generalized Poisson distributions. Probab. Math. Statist. 7 (997), no. 2, Acta Univ. Wratislav. o. 2029, [0] Pavlov, Yu. L. Random Forests. VSP, Utrecht, [] Rozovskii, L. V. Probabilities of large deviations for some classes of distributions satisfying the Cramér condition. (Russian) Zap. auchn. Sem. S.Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 298 (2003), Veroyatn. i Stat. 6, 6 85, 38 39; translation in J. Math. Sci. (. Y.) 28 (2005), no., [2] Rényi, A. Three new proofs and generalization of a theorem of Irving Weiss. Magy. Tud. Akad. Mat. Kutató Int. Közl. 7 (962), o.2, [3] Weiss, I. Limiting distributions in some occupancy problems. Ann. Math. Statist. 29 (958), o.3,
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationTHE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:
THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces
More informationChapter 4 Expected Values
Chapter 4 Expected Values 4. The Expected Value of a Random Variables Definition. Let X be a random variable having a pdf f(x). Also, suppose the the following conditions are satisfied: x f(x) converges
More informationLongest runs in coin tossing. Comparison of recursive formulae, asymptotic theorems, computer simulations
Acta Univ. Sapientiae, Mathematica, 2, 2 (21) 215 228 Longest runs in coin tossing. Comparison of formulae, theorems, computer s István Fazekas Department of Applied Mathematics and Probability, University
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the nonnegative
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationPÓLYA URN MODELS UNDER GENERAL REPLACEMENT SCHEMES
J. Japan Statist. Soc. Vol. 31 No. 2 2001 193 205 PÓLYA URN MODELS UNDER GENERAL REPLACEMENT SCHEMES Kiyoshi Inoue* and Sigeo Aki* In this paper, we consider a Pólya urn model containing balls of m different
More informationChapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS
Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Part 4: Geometric Distribution Negative Binomial Distribution Hypergeometric Distribution Sections 37, 38 The remaining discrete random
More informationOn the kpath cover problem for cacti
On the kpath cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationMATHEMATICAL METHODS OF STATISTICS
MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS
More informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. GacovskaBarandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. GacovskaBarandovska Smirnov (1949) derived four
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationReference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.
5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2
More informationLimit theorems for the longest run
Annales Mathematicae et Informaticae 36 (009) pp. 33 4 http://ami.ektf.hu Limit theorems for the longest run József Túri University of Miskolc, Department of Descriptive Geometry Submitted June 009; Accepted
More information5. Convergence of sequences of random variables
5. Convergence of sequences of random variables Throughout this chapter we assume that {X, X 2,...} is a sequence of r.v. and X is a r.v., and all of them are defined on the same probability space (Ω,
More informationRamsey numbers for bipartite graphs with small bandwidth
Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São
More informationSOME TYPES OF CONVERGENCE OF SEQUENCES OF REAL VALUED FUNCTIONS
Real Analysis Exchange Vol. 28(2), 2002/2003, pp. 43 59 Ruchi Das, Department of Mathematics, Faculty of Science, The M.S. University Of Baroda, Vadodara  390002, India. email: ruchid99@yahoo.com Nikolaos
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationLOOKING FOR A GOOD TIME TO BET
LOOKING FOR A GOOD TIME TO BET LAURENT SERLET Abstract. Suppose that the cards of a well shuffled deck of cards are turned up one after another. At any timebut once only you may bet that the next card
More informationLecture 1: Elementary Number Theory
Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers
More informationAsymptotics of discounted aggregate claims for renewal risk model with risky investment
Appl. Math. J. Chinese Univ. 21, 25(2: 29216 Asymptotics of discounted aggregate claims for renewal risk model with risky investment JIANG Tao Abstract. Under the assumption that the claim size is subexponentially
More informationONLINE VERTEX COLORINGS OF RANDOM GRAPHS WITHOUT MONOCHROMATIC SUBGRAPHS
ONLINE VERTEX COLORINGS OF RANDOM GRAPHS WITHOUT MONOCHROMATIC SUBGRAPHS MARTIN MARCINISZYN AND RETO SPÖHEL Abstract. Consider the following generalized notion of graph colorings: a vertex coloring of
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 61, 013, Albena, Bulgaria pp. 15133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of HaifaORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationGeneral theory of stochastic processes
CHAPTER 1 General theory of stochastic processes 1.1. Definition of stochastic process First let us recall the definition of a random variable. A random variable is a random number appearing as a result
More informationCourse 221: Analysis Academic year , First Semester
Course 221: Analysis Academic year 200708, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................
More informationA COUNTEREXAMPLE FOR SUBADDITIVITY OF MULTIPLIER IDEALS ON TORIC VARIETIES
Communications in Algebra, 40: 1618 1624, 2012 Copyright Taylor & Francis Group, LLC ISSN: 00927872 print/15324125 online DOI: 10.1080/00927872.2011.552084 A COUNTEREXAMPLE FOR SUBADDITIVITY OF MULTIPLIER
More informationProbability and Statistics
CHAPTER 2: RANDOM VARIABLES AND ASSOCIATED FUNCTIONS 2b  0 Probability and Statistics Kristel Van Steen, PhD 2 Montefiore Institute  Systems and Modeling GIGA  Bioinformatics ULg kristel.vansteen@ulg.ac.be
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a realvalued function defined on the sample space of some experiment. For instance,
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationGeneralizing the Ramsey Problem through Diameter
Generalizing the Ramsey Problem through Diameter Dhruv Mubayi Submitted: January 8, 001; Accepted: November 13, 001. MR Subject Classifications: 05C1, 05C15, 05C35, 05C55 Abstract Given a graph G and positive
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE COFACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II MohammediaCasablanca,
More informationWald s Identity. by Jeffery Hein. Dartmouth College, Math 100
Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,
More information61. REARRANGEMENTS 119
61. REARRANGEMENTS 119 61. Rearrangements Here the difference between conditionally and absolutely convergent series is further refined through the concept of rearrangement. Definition 15. (Rearrangement)
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More informationUniform Multicommodity Flow through the Complete Graph with Random Edgecapacities
Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete
More informationCOUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
More informationMessagepassing sequential detection of multiple change points in networks
Messagepassing sequential detection of multiple change points in networks Long Nguyen, Arash Amini Ram Rajagopal University of Michigan Stanford University ISIT, Boston, July 2012 Nguyen/Amini/Rajagopal
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a kuniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationON THE EXISTENCE AND LIMIT BEHAVIOR OF THE OPTIMAL BANDWIDTH FOR KERNEL DENSITY ESTIMATION
Statistica Sinica 17(27), 2893 ON THE EXISTENCE AND LIMIT BEHAVIOR OF THE OPTIMAL BANDWIDTH FOR KERNEL DENSITY ESTIMATION J. E. Chacón, J. Montanero, A. G. Nogales and P. Pérez Universidad de Extremadura
More information3. Continuous Random Variables
3. Continuous Random Variables A continuous random variable is one which can take any value in an interval (or union of intervals) The values that can be taken by such a variable cannot be listed. Such
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationThe Relation between Two Present Value Formulae
James Ciecka, Gary Skoog, and Gerald Martin. 009. The Relation between Two Present Value Formulae. Journal of Legal Economics 15(): pp. 6174. The Relation between Two Present Value Formulae James E. Ciecka,
More informationVERTICES OF GIVEN DEGREE IN SERIESPARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIESPARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of seriesparallel labelled
More informationOn an antiramsey type result
On an antiramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider antiramsey type results. For a given coloring of the kelement subsets of an nelement set X, where two kelement
More informationThe HenstockKurzweilStieltjes type integral for real functions on a fractal subset of the real line
The HenstockKurzweilStieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
More informationThe sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France Email: stoll@iml.univmrs.fr
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationThe Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degreediameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationConcentration inequalities for order statistics Using the entropy method and Rényi s representation
Concentration inequalities for order statistics Using the entropy method and Rényi s representation Maud Thomas 1 in collaboration with Stéphane Boucheron 1 1 LPMA Université ParisDiderot High Dimensional
More informationCONVERGENCE OF SEQUENCES OF ITERATES OF RANDOMVALUED VECTOR FUNCTIONS
C O L L O Q U I U M M A T H E M A T I C U M VOL. 97 2003 NO. 1 CONVERGENCE OF SEQUENCES OF ITERATES OF RANDOMVALUED VECTOR FUNCTIONS BY RAFAŁ KAPICA (Katowice) Abstract. Given a probability space (Ω,
More informationSome Problems of SecondOrder Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 09736069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of SecondOrder Rational Difference Equations with Quadratic
More informationSolution Using the geometric series a/(1 r) = x=1. x=1. Problem For each of the following distributions, compute
Math 472 Homework Assignment 1 Problem 1.9.2. Let p(x) 1/2 x, x 1, 2, 3,..., zero elsewhere, be the pmf of the random variable X. Find the mgf, the mean, and the variance of X. Solution 1.9.2. Using the
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More informationOPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics
More informationA Formalization of the Turing Test Evgeny Chutchev
A Formalization of the Turing Test Evgeny Chutchev 1. Introduction The Turing test was described by A. Turing in his paper [4] as follows: An interrogator questions both Turing machine and second participant
More informationSome remarks on PhragménLindelöf theorems for weak solutions of the stationary Schrödinger operator
Wan Boundary Value Problems (2015) 2015:239 DOI 10.1186/s1366101505080 R E S E A R C H Open Access Some remarks on PhragménLindelöf theorems for weak solutions of the stationary Schrödinger operator
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationLecture 4: Random Variables
Lecture 4: Random Variables 1. Definition of Random variables 1.1 Measurable functions and random variables 1.2 Reduction of the measurability condition 1.3 Transformation of random variables 1.4 σalgebra
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationExercise 1. Let E be a given set. Prove that the following statements are equivalent.
Real Variables, Fall 2014 Problem set 1 Solution suggestions Exercise 1. Let E be a given set. Prove that the following statements are equivalent. (i) E is measurable. (ii) Given ε > 0, there exists an
More informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationMath 317 HW #7 Solutions
Math 17 HW #7 Solutions 1. Exercise..5. Decide which of the following sets are compact. For those that are not compact, show how Definition..1 breaks down. In other words, give an example of a sequence
More informationRECURSIVE TREES. Michael Drmota. Institue of Discrete Mathematics and Geometry Vienna University of Technology, A 1040 Wien, Austria
RECURSIVE TREES Michael Drmota Institue of Discrete Mathematics and Geometry Vienna University of Technology, A 040 Wien, Austria michael.drmota@tuwien.ac.at www.dmg.tuwien.ac.at/drmota/ 2008 Enrage Topical
More informationOn the numbertheoretic functions ν(n) and Ω(n)
ACTA ARITHMETICA LXXVIII.1 (1996) On the numbertheoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,
More informationIntroduction to Flocking {Stochastic Matrices}
Supelec EECI Graduate School in Control Introduction to Flocking {Stochastic Matrices} A. S. Morse Yale University Gif sur  Yvette May 21, 2012 CRAIG REYNOLDS  1987 BOIDS The Lion King CRAIG REYNOLDS
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationGrey Brownian motion and local times
Grey Brownian motion and local times José Luís da Silva 1,2 (Joint work with: M. Erraoui 3 ) 2 CCM  Centro de Ciências Matemáticas, University of Madeira, Portugal 3 University Cadi Ayyad, Faculty of
More informationRoots of Polynomials
Roots of Polynomials (Com S 477/577 Notes) YanBin Jia Sep 24, 2015 A direct corollary of the fundamental theorem of algebra is that p(x) can be factorized over the complex domain into a product a n (x
More informationARTICLE IN PRESS Nonlinear Analysis ( )
Nonlinear Analysis ) Contents lists available at ScienceDirect Nonlinear Analysis journal homepage: www.elsevier.com/locate/na A question concerning a polynomial inequality and an answer M.A. Qazi a,,
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora
princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of
More informationMATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators...
MATH4427 Notebook 2 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 20092016 by Jenny A. Baglivo. All Rights Reserved. Contents 2 MATH4427 Notebook 2 3 2.1 Definitions and Examples...................................
More informationLecture 7: Approximation via Randomized Rounding
Lecture 7: Approximation via Randomized Rounding Often LPs return a fractional solution where the solution x, which is supposed to be in {0, } n, is in [0, ] n instead. There is a generic way of obtaining
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS  Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
More informationIntroduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
More informationGambling Systems and MultiplicationInvariant Measures
Gambling Systems and MultiplicationInvariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationOn the Spaces of λconvergent and Bounded Sequences
Thai Journal of Mathematics Volume 8 2010 Number 2 : 311 329 www.math.science.cmu.ac.th/thaijournal Online ISSN 16860209 On the Spaces of λconvergent and Bounded Sequences M. Mursaleen 1 and A.K. Noman
More informationRandom variables, probability distributions, binomial random variable
Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that
More informationStochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations
56 Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations FlorinCătălin ENACHE
More information8.1 Min Degree Spanning Tree
CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree
More informationMean Value Coordinates
Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of its
More informationEleonóra STETTNER, Kaposvár Using Microsoft Excel to solve and illustrate mathematical problems
Eleonóra STETTNER, Kaposvár Using Microsoft Excel to solve and illustrate mathematical problems Abstract At the University of Kaposvár in BSc and BA education we introduced a new course for the first year
More informationTHE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
More informationDeterminants can be used to solve a linear system of equations using Cramer s Rule.
2.6.2 Cramer s Rule Determinants can be used to solve a linear system of equations using Cramer s Rule. Cramer s Rule for Two Equations in Two Variables Given the system This system has the unique solution
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationLectures 56: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5: Taylor Series Weeks 5 Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More information