SOME NEW CHARACTERIZATION RESULTS ON EXPONENTIAL AND RELATED DISTRIBUTIONS. Communicated by Ahmad Reza Soltani. 1. Introduction

Size: px
Start display at page:

Download "SOME NEW CHARACTERIZATION RESULTS ON EXPONENTIAL AND RELATED DISTRIBUTIONS. Communicated by Ahmad Reza Soltani. 1. Introduction"

Transcription

1 Bulletn of the Iranan Mathematcal Socety Vol. 36 No. 1 (21), pp SOME NEW CHARACTERIZATION RESULTS ON EXPONENTIAL AND RELATED DISTRIBUTIONS M. TAVANGAR AND M. ASADI Communcated by Ahmad Reza Soltan Abstract. It s well-known that most of the characterzaton results on exponental dstrbuton are based on the soluton of Cauchy functonal equaton and ntegrated Cauchy functonal equaton. Here, we consder the functonal equaton F (x) F (xy) + F (xq(y)), x, xq(y) [, θ), y [, 1], where F and Q satsfy certan condtons, to gve some new characterzaton results on exponental, power and Pareto dstrbutons usng the concepts of condtonal random varables and order statstcs. 1. Introducton Because of mportance of the exponental and geometrc dstrbutons, n many branches of statstcs and appled probablty, a large number of research artcles appear n the lterature characterzng these dstrbutons based on dfferent propertes. The monographs of Galambos and Kotz (1978), Azarlov and Volodn (1986), and Rao and Shanbhag (1994) are devoted to characterzatons of probablty dstrbutons, manly on MSC(2): Prmary: 65F5, 11Dxx; Secondary: 11Y5. Keywords: Condtonal random varable, order statstcs, power dstrbuton, Pareto dstrbuton, functonal equaton. Receved: 9 January 29, Accepted: 28 May 29. Correspondng author c 21 Iranan Mathematcal Socety. 257

2 258 Tavangar and Asad exponental and geometrc dstrbutons. Usually, the problem of characterzng a probablty dstrbuton functon leads to solve a functonal equaton. It s mentoned n Rao and Shanbhag (1986) that most of the characterstc propertes of the exponental and geometrc dstrbutons, based on condtonal expectatons and order statstcs, can be obtaned from ntegrated Cauchy functonal equaton under mnmal assumptons. The monograph of Rao and Shanbhag (1994) provdes a comprehensve study of the applcatons of the ntegrated Cauchy functonal equaton on characterzng exponental and geometrc dstrbutons based on dfferent relatons between ordered random varables. Asad et al. (21) appled ntegrated Cauchy functonal equaton to obtan several characterzaton results on exponental, power and Pareto dstrbutons. Let X be a lfetme (non-negatve) random varable wth cumulatve dstrbuton functon (cdf) F, and survval functon S 1 F. The random varable X s sad to have exponental dstrbuton wth mean λ f S(x) e x/λ, x, λ >, power functon dstrbuton wth parameter vector (α, θ) f ( x ) α F (x), x θ, α >, θ >, θ Pareto dstrbuton wth parameter vector (α, β) f ( ) β α S(x), x β, α >. x These dstrbutons are of partcular nterest n statstcal lterature for ther flexblty to model varous data wth dfferent applcatons. Our purpose here s to gve some characterzaton results on the above dstrbutons. The results are applcatons of a functonal equaton whch s recently solved by Aczel et al. (1999). Ther result s stated n the followng theorem. Theorem 1.1. Among the functons F : [, θ) R + ( [, )), θ (, ], and Q : [, 1] R +, the functonal equaton (1.1) F (x) F (xy) + F (xq(y)), x, xq(y) [, θ), y [, 1], has the trval solutons (1.2) F, Q arbtrary ( 1 f θ < ),

3 Some new characterzaton results on exponental 259 and (1.3) F (x) c >, x (, θ), F (), Q(y), y (, 1], Q() > arbtrary ( 1 f θ < ). For all other solutons, there exst constants k >, α > such that (1.4) F (x) kx α, Q(y) (1 y α ) 1/α. If θ > 1 and F (1) 1, then k 1. Conversely, all pars of functons of the form (1.2), (1.3) and (1.4) satsfy (1.1). It s mentoned n Aczel et al. (1999) that the functons F and/or Q may map nto the gven ranges; and onto s not assumed. Nether s any regularty (monotoncty, contnuty) supposed. Also, the same result follows when one assumes that Eq. (1.1) holds only for almost all pars (x, y) [, θ) [, 1] (wth respect to planar Lebesgue measure). The remander of the paper s organzed as follows: In Secton 2, we obtan some characterzaton results on exponental, power and Pareto dstrbutons based on functonal equaton n (1.1). Secton 3 deals wth some characterzaton results based on equalty n dstrbuton of some condtonal random varables such as resdual lfe random varable. In ths secton, characterzatons based upon equalty of expectaton of some condtonal random varables are also gven. Secton 4 s devoted to characterzaton results based on dentty of dstrbutons and equalty of expectaton of some functons of order statstcs. The results of ths secton are extensons of the results obtaned recently by Asad (26), and Tavangar and Asad (27). 2. Characterzatons based on relatons satsfed by cumulatve dstrbuton functon Assume that F s a cdf. In what follows, we wll defne the support of F (or a random varable havng cdf F ) as (α(f ), ω(f )), where α(f ) nf{x : F (x) > }, and ω(f ) sup{x : F (x) < 1}. Note that, n general, the former may be, and the latter may be +. If F satsfes (1.1), then, as a consequence of propertes of a dstrbuton functon (such as the rght contnuty), two trval solutons of equaton (1.1) are excluded and we obtan the followng result.

4 26 Tavangar and Asad Theorem 2.1. Let F be any cdf wth support [, θ), θ >. Suppose that Q : [, θ) R +. The functonal equaton (2.1) F (x) F (xy) + F (xq(y)), x, xq(y) [, θ), y [, 1], holds f and only f F s a (rescaled) power functon dstrbuton wth parameter vector (α, θ), for some constant α >, and Q(y) (1 y α ) 1/α, y 1. Remark 2.2. Equaton (2.1) has a probablstc nterpretaton as follows. Let X be a contnuous non-negatve random varable on [, θ) wth cdf F. If there s a functon Q, whch satsfes n the condtons of Theorem 2.1, such that P [X > xy X x] P [X xq(y) X x], x, [, θ), y [, 1], then Q(y) (1 y α ) 1/α, and X has the power functon dstrbuton. Most of the characterzaton results on exponental dstrbuton are based on the Cauchy functonal equaton whch s known n the statstcal lterature as the lack of memory property. A non-negatve random varable X s sad to have the lack of memory property f, for all x, y >, ts survval functon S satsfes S(x + y) S(x)S(y). It s well-known that the only contnuous dstrbuton wth ths property s the exponental survval functon. In the followng theorem we gve a characterzaton result on exponental dstrbuton whch s based upon the functonal equaton n Theorem 2.1. Theorem 2.3. Let F be any cdf wth support R +, and S 1 F. Assume that Q : R + R +. The functonal equaton (2.2) S(x) S(x + y) + S(x + Q(y)), x, y [, ), holds f and only f F s an exponental dstrbuton wth mean λ, for some λ >, and Q(y) λ log(1 e y/λ ), y >. Proof. The f part of the theorem s straghtforward and hence we prove the only f part. To ths end, we defne the cdf G as G(z) S( log z), z [, 1), where S s the survval functon defned n the statement of the theorem. Let u e x, v e y, and Q (v) exp{ Q( log v)}. It s obvous that Q : [, 1] R +. Now, Eq. (2.2) mples that G(u) G(uv) + G(uQ (v)), u, uq (v) [, 1), v [, 1]. That s, the par of functons (G, Q ) satsfes Eq. (2.1) wth θ 1.

5 Some new characterzaton results on exponental 261 Therefore, usng Theorem 2.1, we have G(x) x α, x [, 1), and Q (y) (1 y α ) 1/α, y [, 1], for some constant α >. Ths means that F s an exponental cdf wth mean λ 1/α, and Q s as stated n the theorem. Hence, the proof s complete. Remark 2.4. The probablstc nterpretaton of Eq. (2.2) s as follows. Let X be contnuous non-negatve random varable on (, ) wth survval functon S. If there exsts a functon Q whch satsfes n condtons of Theorem 2.3, and P [X x + y X x] P [X < x + Q(y) X x], x, y >, then Q(y) λ log(1 e y/λ ), for some λ >, and X has an exponental dstrbuton wth mean 1/λ. It s also worth notng that Q(y) here s equal to Q(y) λ y r(x)dx, where r(x) f(x)/f (x) s the reversed hazard rate, and f s the densty of F. The next theorem gves a characterzaton of the Pareto dstrbuton whch follows from Theorem 2.1. The proof, beng the same as the proof of Theorem 2.3, s omtted. Theorem 2.5. Let F be any cdf wth support [β, ), and S 1 F. Suppose that Q : [1, ) R +. Then, the functonal equaton S(x) S(xy) + S(xQ(y)), x, xq(y) [β, ), y [1, ), holds f and only f F s a Pareto dstrbuton wth parameter vector (α, β), for some constant α >, and Q(y) (1 y α ) 1/α, y Characterzatons based on condtonal random varables Gven any cdf F, the quantle (or generalzed nverse) functon F s defned by F (u) nf{x : F (x) u}, u (, 1). It s known that F, n general, does not preserve the relaton < ;.e., t s not true that x < y F (x) < F (y). For any cdf F, the followng lemma, whch can be proved easly, provdes some results on F, whch we wll use n the sequel.

6 262 Tavangar and Asad Lemma 3.1. For any cdf F, () t < F (u) F (t) < u, () u F (t) F (u) t. Let X be an arbtrary random varable wth cdf F. Then, F (X) as well as S(X) 1 F (X) have unform U(, 1) dstrbutons. Hence, usng the probablty ntegral transform, we conclude that F [S(X)] s dstrbuted as F, where F s the quantle functon. That s X d F [S(X)], where d stands for equalty n dstrbuton. A natural queston that arses s whether there exsts a strctly decreasng functon Q, for whch the relaton X d Q(X) holds. In ths secton, we obtan some solutons to ths queston for some specal condtonal random varables (such as the resdual lfe random varable). Frst, we show that when the random varable of nterest s the resdual lfe random varable, the functon Q s unque and the underlyng dstrbuton s exponental. Ths s gven by the followng theorem. Theorem 3.2. Let X be a non-negatve random varable wth the survval functon S. Suppose that Q : R + R + s a strctly decreasng functon. Let also X t [X t X > t] be the resdual lfe random varable. Then X t d Q(Xt ), for almost all t R + (wth respect to Lebesgue measure) wth S(t) >, f and only f S s the survval functon of an exponental random varable wth mean λ, for some constant λ >, and Q(y) λ log(1 e y/λ ), y >. Proof. Frst, note that under the assumpton S(t) >, the condtonal random varable X t s well-defned. Also, note that snce every monotone functon s measurable, Q(X t ) s a random varable. We have, P [Q(X t ) x] 1 P [X t > Q 1 (x)] 1 P [X > t + Q 1 (x)]. P [X > t] Let U be a random varable wth unform U(, 1) dstrbuton. From the probablty ntegral transform, we have X d F (U). Now, t follows

7 Some new characterzaton results on exponental 263 from Lemma 3.1 that and P [Q(X t ) x] 1 P [U > F (t + Q 1 (x))] P [U > F (t)] P [X t x] We need to prove that (3.1) 1 S(t + Q 1 (x)), S(t) P [X t + x] P [X > t] 1 {S(t + x) + F (t + x) F ((t + x) )}. S(t) P [X t x] S(t + x). S(t) Let D {x R + F has jump at x} denote the set of dscontnuty ponts of F whch s known to be countable. If D s an empty set, then the result s trval. Hence, let D {d 1, d 2,...}, and defne the set E s, 1, 2,..., as E {(t, x) R + R + t+x d } {(d x, x) x [, d ]}. It s easy to observe that the E are measurable sets of planar Lebesgue measure zero whch, n turn, mples that D s a set of planar Lebesgue measure zero. Therefore, Eq. (3.1), and consequently the followng equaton hold for almost all pars (t, x) R + R + wth respect to planar Lebesgue measure: S(t) S(t + x) + S(t + Q 1 (x)). Now the result follows from Theorem 2.3. Remark 3.3. It can be easly shown that Theorem 3.2 holds f we replace X t d Q(Xt ) wth X t d [Q(X t) X > t], where Q meets the requrements of the theorem. A smlar result characterzng a (rescaled) power functon dstrbuton s as follows. Theorem 3.4. Let X be a non-negatve random varable wth support [, θ) havng the cdf F. Assume that Q : [, 1] R + s a strctly decreasng functon. Let also X (t) [t 1 X X t]. Then, X (t) d Q(X(t) ), for almost all t [, θ] (wth respect to Lebesgue measure) wth F (t) >, f

8 264 Tavangar and Asad and only f F s a (rescaled) power functon dstrbuton wth parameter vector (α, θ), for some α >, and Q(y) (1 y α ) 1/α, y 1. Proof. Along the lnes of the proof of Theorem 3.2, we get P [X (t) x] 1 F (tx) F (t), for almost all pars (t, x) [, θ] [, 1] wth respect to planar Lebesgue measure, and P [Q(X (t) ) x] F (tq 1 (x)), F (t) for all (t, x) [, θ] [, 1]. Now, the result follows from Theorem 2.1. We can now state the next result characterzng the Pareto dstrbuton. The proof s smlar to the ones gven for the above theorems and hence s omtted. Theorem 3.5. Let X be a non-negatve random varable wth support [β, ), and denote by S ts survval functon. Assume that Q : [, 1] R + s a strctly decreasng functon. Let also X [t] [tx 1 X > t]. Then, X [t] d Q(X[t] ), for almost all t [β, ) (wth respect to Lebesgue measure) wth S(t) >, f and only f S s the survval functon of a Pareto dstrbuton wth parameter vector (α, β), for some α >, and Q(y) (1 y α ) 1/α, y 1. In the followng theorem, we prove some results characterzng exponental, power and Pareto dstrbutons based on some condtonal expectatons. Theorem 3.6. Let X be a non-negatve random varable havng a contnuous cdf F, and survval functon S. () Assume that the support of F s (, θ), and lm t F (t)/t α exsts for constant α >. Then, (3.2) E{X X t} E{(t α X α ) 1/α X t}, t θ, f and only f F s a (rescaled) power functon dstrbuton wth parameter vector (α, θ).

9 Some new characterzaton results on exponental 265 () Assume that the support of F s (, ), and lm t e t/λ S(t) exsts for constant λ >. Then, (3.3) E{X t X > t} E{ λ log(1 e (X t)/λ ) X > t}, t, f and only f F s an exponental dstrbuton wth mean λ. () Assume that the support of F s (β, ), and lm t t α S(t) exsts for constant α >. Then, (3.4) E{X 1 X > t} E{(t α X α ) 1/α X > t}, t β, f and only f F s a Pareto dstrbuton wth parameter vector (α, β). Proof. () The f part s easy to verfy. To prove the only f part, note that Eq. (3.2) s equvalent to: (3.5) t {F (t) F (x) F ((t α x α ) 1/α )}dx, t θ. Snce F s contnuous, gven any t [, θ], there exsts a pont u t (, t) such that (3.6) F (t) t α uα t F (u t ) t α u α + tα u α t F ((t α u α t ) 1/α ) t t α t α u α t Let µ t be a probablty measure whch s concentrated on two ponts only such that t puts mass u α t /t α at pont t u t, and mass 1 u α t /t α at pont t (t α u α t ) 1/α. Let H(t) F (t)/t α, t [, θ]. Then, Eq. (3.6) can be wrtten as: H(t) t H(t u)µ t (du). It follows from Theorem 1 of Fosam and Shanbhag (1997) that H(t) s a postve constant ndependent of t. Hence, the proof s complete. () The proof of the f part s straghtforward and hence we prove the only f part. To ths end, note that Eq. (3.3) s equvalent to {S(t) S(t + x) S(t λ log(1 e x/λ ))}dx, t, whch, after makng approprate transformatons, can be wrtten as: s {S( log s) S( log u) S( log(s α u α ) 1/α } 1 du, s 1, u.

10 266 Tavangar and Asad wth α 1/λ. Defnng G(s) S( log s), s 1, we get an ntegral equaton smlar to Equaton (3.5) wth F replaced by G. The result then follows usng the same arguments as the ones used to prove part () of the theorem. () The f part s easy to verfy and hence we prove the only f part. One can show that Eq. (3.4) s equvalent to 1 {S(t) S(t/x) S([t(1 x α )] 1/α )}dx, t β. Let G(z) S(1/z), < z < 1/β. Upon makng approprate transformatons, t s easly seen that Eq. (3.5) holds wth F, and θ replaced by G, and 1/β, respectvely. Ths mples that G s the cdf of a (rescaled) power functon dstrbuton wth parameter vector (α, 1/β). In vew of the relaton between S and G, the proof s then complete. 4. Characterzatons based on order statstcs Let X 1, X 2,..., X n be ndependent random varables wth a common cdf F. The order statstcs relatve to X are denoted by X 1:n, X 2:n,..., X n:n. Order statstcs have many applcatons n dfferent branches of appled probablty and statstcs such as relablty, lfe-testng, goodness of ft tests, etc. (see, for example, Davd and Nagaraja, 23). In the statstcs lterature, a large number of research work s devoted to characterzatons of probablty dstrbutons based on order statstcs. (Among others, we refer the reader to Rao and Shanbhag, 1994, Azlarov and Volodn, 1986, and Asad, et al., 21). In ths secton, we gve some characterzatons of the exponental, power, and Pareto dstrbutons based on order statstcs. The specalzed versons of the results of ths secton have already appeared n Asad (26), and Tavangar and Asad (27). Before gvng the man results of ths secton, we frst prove the followng lemma. Lemma 4.1. Let X 1:n, X 2:n,..., X n:n be the order statstcs from any cdf F. Then, () The survval functon of [X r:n X 1:n > t], 1 r n, s gven by r 1 Ḡ r,n (x t) ( n ) {1 θ t (x)} {θ t (x)} n, x > t, where θ t (x) S(x)/S(t), and S(x) 1 F (x), and

11 Some new characterzaton results on exponental 267 () The cdf of [X r:n X n:n t] s gven by n ( ) n H r,n (x t) {ϕ t (x)} {1 ϕ t (x)} n, x t, r where ϕ t (x) F (x)/f (t). Proof. () The proof follows from the fact that [X r:n X 1:n > t], r 1, 2,..., n, can be consdered as the order statstcs from condtonal random varable [X X > t] wth survval functon S(x)/S(t), x > t. () The proof follows by notng that [X r:n X n:n t], r 1, 2,..., n, are the order statstcs from condtonal random varable [X X t] wth cdf F (x)/f (t), x t. Now, we can prove the followng theorem. Theorem 4.2. Let X 1:n, X 2:n,..., X n:n denote the order statstcs from any cdf F wth support R +. Let S 1 F and assume that Q : R + R + s a strctly decreasng functon. Then, (4.1) [X r:n t X 1:n > t] d [Q(X n r+1:n t) X 1:n > t], for some 1 r n, and for almost all t R + (wth respect to Lebesgue measure) wth S(t) >, f and only f Q(y) λ log(1 e y/λ ), y >, and F s an exponental dstrbuton wth mean λ, for some λ >. Proof. Frst, we prove the only f part of the theorem. Usng Lemma 4.1, we get r 1 ( ) n P [X r:n t x X 1:n > t] {1 θ t (t + x)} {θ t (t + x)} n +{G r,n (t + x t) G r,n ((t + x) t)}, where G r,n (x t) s the cdf of the condtonal random varable [X r:n X 1:n > t], and θ t (t + x) S(t + x)/s(t). In vew of what we have observed n the proof of Theorem 3.2, we have, n ( ) n P [X r:n t x X 1:n > t] {θ t (t + x)} {1 θ t (t + x)} n n r+1 θt(t+x) 1 B(r, n r + 1) zn r (1 z) r 1 dz,

12 268 Tavangar and Asad for all (t, x) R + R +, except on a set of planar Labesgue measure, where the last equalty s from the relaton between bnomal sums and the ncomplete beta functon n whch B(.,.) denotes the complete beta functon (see, for example, Davd and Nagaraja, 23). On the other hand, we can use Lemma 4.1 agan to obtan: P [Q(X n r+1:n t) x X 1:n > t] 1 P [X n r+1:n > t + Q 1 (x) X 1:n > t] n r ( ) n {1 1 θt (t + Q 1 (x)) } { θt (t + Q 1 (x)) } n n ( ) n {1 θt (t + Q 1 (x)) } { θt (t + Q 1 (x)) } n n r+1 1 θt(t+q 1 (x)) Now, from these results and Eq. (4.1), we obtan: 1 B(r, n r + 1) zn r (1 z) r 1 dz. θ t (t + x) 1 θ t (t + Q 1 (x)), for almost all (t, x) R + R +, whch leads to Eq. (2.2). Now, the result follows from Theorem 2.3. The f part of the theorem s easy to verfy and hence s omtted. Hence, the proof s complete. The followng theorem proves a characterzaton of the power functon dstrbuton. Theorem 4.3. Let X 1:n, X 2:n,..., X n:n be the order statstcs from any cdf F wth support [, θ]. Assume that Q : [, 1] R + s a strctly decreasng functon. Then, [X r:n X n:n t] d [t Q(t 1 X n r+1:n ) X n:n t], for some 1 r n, and for almost all t [, θ] (wth respect to Lebesgue measure) wth F (t) >, f and only f Q(y) (1 y α ) 1/α, y 1, and F s a (rescaled) power functon dstrbuton wth parameter vector (α, θ), for some constant α >.

13 Some new characterzaton results on exponental 269 Proof. To prove the only f part of the theorem, note that one can apply Lemma 4.1 to obtan n ( ) n P [X r:n x X n:n t] 1 {ϕ t (x)} {1 ϕ t (x)} n r +{H r,n (x t) H r,n (x t)}, where ϕ t (x) F (x)/f (t), and H r,n (x t) denotes the cdf of [X r:n X n:n t]. In vew of the arguments already made, one can conclude that for almost all (t, x) [, θ] [, θ] (wth respect to planar Lebesgue measure), n ( ) n P [X r:n x X n:n t]1 {ϕ t (x)} {1 ϕ t (x)} n r r 1 ( n n n r+1 1 ϕt(x) Also, we have, P [ t Q(t 1 X n r+1:n ) x X n:n t ] n n r+1 ϕt(tq 1 (x/t)) ) {ϕ t (x)} {1 ϕ t (x)} n, ( ) n {1 ϕ t (x)} {ϕ t (x)} n, 1 B(r, n r + 1) zn r (1 z) r 1 dz. ( ) n {ϕ t (tq 1 (x/t))} {1 ϕ t (tq 1 (x/t))} n 1 B(r, n r + 1) zn r (1 z) r 1 dz. Now, the result follows from Theorem 2.1. The f part of the theorem s trval and hence ts proof s omtted. The proof s now complete. Remark 4.4. The specal case of Theorem 4.3, when Q(y) 1 y and the underlyng dstrbuton s contnuous, s nvestgated by Asad (26), and Tavangar and Asad (27). Theorem 4.5. Let X 1:n, X 2:n,..., X n:n denote the order statstcs based on any cdf F wth support [β, ). Let also S 1 F. Assume that

14 27 Tavangar and Asad Q : [, 1] R + s a strctly decreasng functon. Then, [ ] [ ( ) ] t d t X 1:n > t Q X 1:n > t, X r:n X n r+1:n for almost all t [β, ), (wth respect to Lebesgue measure) wth S(t) >, f and only f Q(y) (1 y α ) 1/α, y 1, and F s a Pareto dstrbuton wth parameter vector (α, β), for some constant α >. Proof. Usng Lemma 4.1, we can wrte [ ] t r 1 ( ) n P > x X 1:n > t 1 {θ t (t/x)} n {1 θ t (t/x)} X r:n and P [ ( Q t X n r+1:n n r ) ( n {G r,n (t/x t) G r,n ((t/x) t)}, n ( n 1 1 n r+1 θt(t/x) ] > x X 1:n > t 1 θt(t/q 1 (x)) 1 ) {θ t (t/x)} {1 θ t (t/x)} n 1 B(r, n r + 1) zn r (1 z) r 1 dz. ) {θ t (t/q 1 (x))} n {1 θ t (t/q 1 (x))} 1 B(r, n r + 1) zn r (1 z) r 1 dz. The result then follows from Theorem 2.5. (we omt the detals). The followng theorem gves a characterzaton of the rescaled beta dstrbuton. The proof s smlar to the proof of Theorem 4.3 and hence s omtted. Theorem 4.6. Let X 1:n, X 2:n,..., X n:n denote the order statstcs from any cdf F wth support [, θ). Let also S 1 F. Assume that Q : [, 1] R + s a strctly decreasng functon. Then, [X r:n X 1:n > t] d [1 (1 t) Q((1 t) 1 (1 X n r+1:n )) X 1:n > t],

15 Some new characterzaton results on exponental 271 for some 1 r n, and for almost all t [, θ] (wth respect to Lebesgue measure) wth S(t) >, f and only f Q(y) (1 y β ) 1/β, y 1, and F s a rescaled beta dstrbuton of the form F (x) 1 (1 x/θ) β, x < θ, for some constant β >. By mposng some restrctons on the underlyng cdf, one can obtan the followng result whch s stronger than that gven n ths secton. The proof s omtted, snce t follows easly from proofs of Theorems 4.2, 4.3, and 4.5, and the argument made for the proof of Theorem 3.6. Theorem 4.7. Let X 1:n, X 2:n,..., X n:n denote the order statstcs based on a contnuous cdf F and survval functon S. () Assume that the support of F s (, ), and lm e t/λ S(t) exsts as t, for some constant λ >. Then, E{X r:n t X 1:n > t} E{ λ log(1 e (X n r+1:n t) ) X 1:n > t}, t >, for some 1 r n, f and only f F s an exponental dstrbuton wth mean λ. () Assume that the support of F s (, θ), and lm F (t)/t α exsts as t, for some constant α >. Then, E{X r:n X n:n t} E{(t α X α n r+1:n) 1/α X n:n t}, t θ, for some 1 r n, f and only f F s a power functon dstrbuton wth parameter vector (α, θ). () Assume that the support of F s (β, ), and lm t α S(t) exsts as t, for some α >. Then, E{X 1 r:n X 1:n > t} E{(t α X α n r+1:n )1/α X 1:n > t}, t β, for some 1 r n, f and only f F s a Pareto dstrbuton wth parameter vector (α, β). Acknowledgments The authors would lke to thank an anonymous referee and the Chef Edtor, Prof. S. Azam, for ther valuable comments. We are grateful to the offce of graduate studes of the Unversty of Isfahan for ther support. The partal support of the Ordered and Spatal Data Center of Excellence of Ferdows Unversty of Mashhad s also acknowledged.

16 272 Tavangar and Asad References [1] J. Aczel, R. Ger and A. Jara, Soluton of a functonal equaton arsng from utlty that s both separable and addtve, Proceedng of the Amercan Mathematcal Socety 127 (1999) [2] M. Asad, On the mean past lfetme of the components of a parallel system, Journal of Statstcal Plannng and Inference 136 (26) [3] M. Asad, C.R. Rao and D.N. Shanbhag, Some unfed characterzaton results on the generalzed Pareto dstrbuton, Journal of Statstcal Plannng and Inference 93 (21) [4] T.A. Azarlov and N.A. Volodn, Characterzaton Problems Assocated wth the Exponental Dstrbuton, Sprnger-Verlag, [5] H.A. Davd and H.N. Nagaraja, Order Statstcs, John Wley & Sons, New Jersey, 23. [6] E.B. Fosam and D.N. Shanbhag, Varants of the Choquet-Deny theorem wth applcatons, Journal of Appled Probablty 34 (1997) [7] J. Galambos and S. Kotz, Characterzaton of Probablty Dstrbutons, Lecture Notes n Mathematcs, Vol. 675, Sprnger, Berln, [8] C.R. Rao and D.N. Shanbhag, Recent results on characterzaton of probablty dstrbutons: a unfed approach through extensons of Deny s theorem, Advances n Appled Probablty 18 (1986) [9] C.R. Rao and D.N. Shanbhag, Choquet-Deny type functonal equatons wth applcatons to stochastc models, John Wley & Sons, Ltd, Chchester, [1] M. Tavangar and M. Asad, Generalzed Pareto dstrbutons characterzed by generalzed order statstcs, Communcatons n Statstcs: Theory and Methods 36(7) (27) M. Tavangar Department of Statstcs, Unversty of Isfahan, 81744, Isfahan, Iran Emal: mahd.tavangar@gmal.com M. Asad Department of Statstcs, Unversty of Isfahan, 81744, Isfahan, Iran Emal: m.asad@stat.u.ac.r

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Another converse of Jensen s inequality

Another converse of Jensen s inequality Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Statistics Chapter 4

Statistics Chapter 4 Statstcs Chapter 4 "There are three knds of les: les, damned les, and statstcs." Benjamn Dsrael, 1895 (Brtsh statesman) Gaussan Dstrbuton, 4-1 If a measurement s repeated many tmes a statstcal treatment

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan

More information

On characterizing some mixtures of probability distributions

On characterizing some mixtures of probability distributions Journal of Appled Mathematcs & Bonformatcs, vol3, no3, 03, 53-7 ISSN: 79-660 (prnt), 79-6939 (onlne) Scenpress Ltd, 03 On characterzng some mxtures of probablt dstrbutons Al AA-Rahman Abstract The concept

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

MATH 281A: Homework #6

MATH 281A: Homework #6 MATH 28A: Homework #6 Jongha Ryu Due date: November 8, 206 Problem. (Problem 2..2. Soluton. If X,..., X n Bern(p, then T = X s a complete suffcent statstc. Our target s g(p = p, and the nave guess suggested

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Self-complementing permutations of k-uniform hypergraphs

Self-complementing permutations of k-uniform hypergraphs Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product 12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton

More information

SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION

SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776

More information

Estimation of the Mean of Truncated Exponential Distribution

Estimation of the Mean of Truncated Exponential Distribution Journal of Mathematcs and Statstcs 4 (4): 84-88, 008 ISSN 549-644 008 Scence Publcatons Estmaton of the Mean of Truncated Exponental Dstrbuton Fars Muslm Al-Athar Department of Mathematcs, Faculty of Scence,

More information

Chapter 2 Transformations and Expectations. , and define f

Chapter 2 Transformations and Expectations. , and define f Revew for the prevous lecture Defnton: support set of a ranom varable, the monotone functon; Theorem: How to obtan a cf, pf (or pmf) of functons of a ranom varable; Eamples: several eamples Chapter Transformatons

More information

A be a probability space. A random vector

A be a probability space. A random vector Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Random Partitions of Samples

Random Partitions of Samples Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples

More information

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

Double Acceptance Sampling Plan for Time Truncated Life Tests Based on Transmuted Generalized Inverse Weibull Distribution

Double Acceptance Sampling Plan for Time Truncated Life Tests Based on Transmuted Generalized Inverse Weibull Distribution J. Stat. Appl. Pro. 6, No. 1, 1-6 2017 1 Journal of Statstcs Applcatons & Probablty An Internatonal Journal http://dx.do.org/10.18576/jsap/060101 Double Acceptance Samplng Plan for Tme Truncated Lfe Tests

More information

P exp(tx) = 1 + t 2k M 2k. k N

P exp(tx) = 1 + t 2k M 2k. k N 1. Subgaussan tals Defnton. Say that a random varable X has a subgaussan dstrbuton wth scale factor σ< f P exp(tx) exp(σ 2 t 2 /2) for all real t. For example, f X s dstrbuted N(,σ 2 ) then t s subgaussan.

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

Estimation: Part 2. Chapter GREG estimation

Estimation: Part 2. Chapter GREG estimation Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Modelli Clamfim Equazione del Calore Lezione ottobre 2014 CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

3 Basic boundary value problems for analytic function in the upper half plane

3 Basic boundary value problems for analytic function in the upper half plane 3 Basc boundary value problems for analytc functon n the upper half plane 3. Posson representaton formulas for the half plane Let f be an analytc functon of z throughout the half plane Imz > 0, contnuous

More information

On the smoothness and the totally strong properties for nearness frames

On the smoothness and the totally strong properties for nearness frames Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo

More information

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

Hidden Markov Models & The Multivariate Gaussian (10/26/04) CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models

More information

Tail Dependence Comparison of Survival Marshall-Olkin Copulas

Tail Dependence Comparison of Survival Marshall-Olkin Copulas Tal Dependence Comparson of Survval Marshall-Olkn Copulas Hajun L Department of Mathematcs and Department of Statstcs Washngton State Unversty Pullman, WA 99164, U.S.A. lh@math.wsu.edu January 2006 Abstract

More information

Supplement to Clustering with Statistical Error Control

Supplement to Clustering with Statistical Error Control Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve

More information

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

Computing MLE Bias Empirically

Computing MLE Bias Empirically Computng MLE Bas Emprcally Kar Wa Lm Australan atonal Unversty January 3, 27 Abstract Ths note studes the bas arses from the MLE estmate of the rate parameter and the mean parameter of an exponental dstrbuton.

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

On mutual information estimation for mixed-pair random variables

On mutual information estimation for mixed-pair random variables On mutual nformaton estmaton for mxed-par random varables November 3, 218 Aleksandr Beknazaryan, Xn Dang and Haln Sang 1 Department of Mathematcs, The Unversty of Msssspp, Unversty, MS 38677, USA. E-mal:

More information

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Modelli Clamfim Equazioni differenziali 22 settembre 2016 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 22 settembre 2016 professor Danele Rtell danele.rtell@unbo.t 1/22? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

Binomial transforms of the modified k-fibonacci-like sequence

Binomial transforms of the modified k-fibonacci-like sequence Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Continuous Time Markov Chain

Continuous Time Markov Chain Contnuous Tme Markov Chan Hu Jn Department of Electroncs and Communcaton Engneerng Hanyang Unversty ERICA Campus Contents Contnuous tme Markov Chan (CTMC) Propertes of sojourn tme Relatons Transton probablty

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models

More information

arxiv: v1 [math.co] 12 Sep 2014

arxiv: v1 [math.co] 12 Sep 2014 arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March

More information

Strong Markov property: Same assertion holds for stopping times τ.

Strong Markov property: Same assertion holds for stopping times τ. Brownan moton Let X ={X t : t R + } be a real-valued stochastc process: a famlty of real random varables all defned on the same probablty space. Defne F t = nformaton avalable by observng the process up

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

Research Article Green s Theorem for Sign Data

Research Article Green s Theorem for Sign Data Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1 On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition) Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes

More information

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable

More information

Randomness and Computation

Randomness and Computation Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually

More information

8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before

8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before .1 Arc Length hat s the length of a curve? How can we approxmate t? e could do t followng the pattern we ve used before Use a sequence of ncreasngly short segments to approxmate the curve: As the segments

More information

An (almost) unbiased estimator for the S-Gini index

An (almost) unbiased estimator for the S-Gini index An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for

More information

Beyond Zudilin s Conjectured q-analog of Schmidt s problem

Beyond Zudilin s Conjectured q-analog of Schmidt s problem Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs

More information

An Introduction to Morita Theory

An Introduction to Morita Theory An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory

More information

Infinitely Split Nash Equilibrium Problems in Repeated Games

Infinitely Split Nash Equilibrium Problems in Repeated Games Infntely Splt ash Equlbrum Problems n Repeated Games Jnlu L Department of Mathematcs Shawnee State Unversty Portsmouth, Oho 4566 USA Abstract In ths paper, we ntroduce the concept of nfntely splt ash equlbrum

More information

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION PROCDINGS OF TH AMRICAN MATHMATICAL SOCITY Volume 125, Number 7, July 1997, Pages 2119{2125 S 0002-9939(97)03816-1 TH STRONG OPN ST CONDITION IN TH RANDOM CAS NORBRT PATZSCHK (Communcated by Palle. T.

More information

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal Markov chans M. Veeraraghavan; March 17, 2004 [Tp: Study the MC, QT, and Lttle s law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Lttle s law lecture (when dervng the mean response tme

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

Case Study of Markov Chains Ray-Knight Compactification

Case Study of Markov Chains Ray-Knight Compactification Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

ON SEPARATING SETS OF WORDS IV

ON SEPARATING SETS OF WORDS IV ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle

More information

Comments on Detecting Outliers in Gamma Distribution by M. Jabbari Nooghabi et al. (2010)

Comments on Detecting Outliers in Gamma Distribution by M. Jabbari Nooghabi et al. (2010) Comments on Detectng Outlers n Gamma Dstrbuton by M. Jabbar Nooghab et al. (21) M. Magdalena Lucn Alejandro C. Frery September 17, 215 arxv:159.55v1 [stat.co] 16 Sep 215 Ths note shows that the results

More information

First Year Examination Department of Statistics, University of Florida

First Year Examination Department of Statistics, University of Florida Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

A P PL I CA TIONS OF FRACTIONAL EXTERIOR DI F F ER EN TIAL IN THR EE- DI M ENSIONAL S PAC E Ξ

A P PL I CA TIONS OF FRACTIONAL EXTERIOR DI F F ER EN TIAL IN THR EE- DI M ENSIONAL S PAC E Ξ Appled Mathematcs and Mechancs ( Englsh Edton, Vol 24, No 3, Mar 2003) Publshed by Shangha Unversty, Shangha, Chna Artcle ID : 0253-4827 (2003) 03-0256-05 A P PL I CA TIONS OF FRACTIONAL EXTERIOR DI F

More information

Lecture 17 : Stochastic Processes II

Lecture 17 : Stochastic Processes II : Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss

More information

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents

A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION. Contents A SURVEY OF PROPERTIES OF FINITE HORIZON DIFFERENTIAL GAMES UNDER ISAACS CONDITION BOTAO WU Abstract. In ths paper, we attempt to answer the followng questons about dfferental games: 1) when does a two-player,

More information

/ n ) are compared. The logic is: if the two

/ n ) are compared. The logic is: if the two STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence

More information