Semicircle law for generalized Curie-Weiss matrix ensembles at subcritical temperature
|
|
- Jonah Clifford Fitzgerald
- 5 years ago
- Views:
Transcription
1 Seicircle law for generalized Curie-Weiss atrix ensebles at subcritical teperature Werner Kirsch Fakultät für Matheatik und Inforatik FernUniversität in Hagen, Gerany Thoas Kriecherbauer Matheatisches Institut Universität Bayreuth, Gerany Abstract In [13] Hochstättler, Kirsch, and Warzel showed that the seicircle law holds for generalized Curie-Weiss atrix ensebles at or above the critical teperature. We extend their result to the case of subcritical teperatures for which the correlations between the atrix entries are stronger. Nevertheless, one ay use the concept of approxiately uncorrelated ensebles that was first introduced in [13]. In order to do so one needs to reove the average agnetization of the entries by an appropriate odification of the enseble that turns out to be of rank 1 thus not changing the liiting spectral easure. 1 Introduction Hochstättler, Kirsch, and Warzel proved in [13] the seicircle law for ensebles of real syetric atrices where the upper triangular part is filled by what they called approxiately uncorrelated rando variables [13, Def. 4] (see also Definition 5 below). An iportant otivation for introducing this notion is that collections of rando variables with values in {, 1} that are distributed according to the Curie-Weiss law at or above the critical teperature are approxiately uncorrelated and thus the seicircle law holds for the corresponding atrix ensebles. It is the ain goal of the present paper to show how one ay use the concept of approxiately uncorrelated rando variables to prove a seicircle law also for subcritical teperatures. 1
2 In order to state our result precisely we need a few definitions. Curie- Weiss rando variables ξ 1,..., ξ M, also called spins, take values in {, 1} with probability P M β (ξ 1 = x 1,..., ξ M = x M ) = Z β,m e β M ( M i=1 x i) where Z β,m denotes the noralization constant. By E M β we denote the expectation with respect to P M β. The paraeter β 0 is interpreted in physics as inverse teperature, β = 1 T. Inforation on the physical eaning of the Curie-Weiss odel can be found in [6, 6]. If β = 0 the rando variables ξ i are independent while for β > 0 there is a positive correlation between the ξ i that grows with β. At the critical inverse teperature β = 1 a phase transition occurs. While at and above the critical teperature (β 1) the average spin 1 M M i=1 ξ i converges in distribution to the Dirac easure δ 0, the average spin converges to 1 (δ (β) + δ (β) ) below the critical teperature (β > 1), where = (β) (0, 1) is called the average agnetization. It can be defined as the (unique) strictly positive solution of tanh(β) =. (1) For a proof of this fact see e. g. [6] or [15]. The following observation is fundaental for the analysis of [13] and also for the present paper: Curie- Weiss distributed rando variables are of de Finetti type, i.e. they can be represented as an average of independently distributed rando variables. More precisely, for t [, 1] we denote the probability easures P (M) t = M j=1 P (1) t as the M-fold product of P (1) t with P (1) t ({1}) = 1 (1) (1 + t) and P t ({}) = 1 (1 t). () If M is clear fro the context we write P t instead of P (M) t. By E t resp. E (M) t we denote the corresponding expectation. For any function φ on {, 1} M we have ( ) E M β φ(x 1,..., X M ) = 1 ) e MF β (t)/ E t (φ(x 1,..., X M ) Z 1 t dt, with F β (t) := 1 ( 1 β ln 1 + t ) + ln(1 t ), t (, 1), (3) 1 t and noralization constant Z := e MF β(t)/ dt. 1 t In this sense P M (M) β is a weighted t average over all P t. This fact can be proved using the so called Hubbard-Stratonovich transforation (see [13] or [15] and references therein). The above considerations otivate the following definition of generalized Curie-Weiss ensebles introduced in [13, Def. 9].
3 Definition 1 Suppose α > 0, β 0 and let F β, P (M) t be defined as in (3), () above. We define a probability easure on R N by P N α F β N = P (N ) t dν N (t), dν N (t) = 1 αfβ(t)/ e N Z N 1 t dt, where Z N is chosen such that the de Finetti easure ν N becoes a probability easure (see Proposition 8 c) for noralizability of ν N ). The corresponding atrix enseble (X N ) N is then defined as follows. Pick N(N+1) different coponents of the P N α F β - distributed rando vector to fill the N upper triangular part of X N R N N. The reaining entries X N (i, j), 1 j < i N are then deterined by the syetry X N (i, j) = X N (j, i). Observe that P N α F β is invariant under perutations of coponents. Thus N the resulting atrix enseble does neither depend on the choice of the N(N+1) coponents (out of N ) nor on the order in which the upper triangular part of X N is filled. The so generated rando atrix enseble (X N ) N is called a generalized P N α F β - Curie-Weiss enseble. N Reark Note that it is only in the case α = that the N real rando variables fro which the entries of the atrix X N are chosen are indeed Curie-Weiss distributed. The generalization thus consists of allowing for α which still reains in the fraework of exchangeable rando variables. However, for α > one ay view the enseble to be generated by selecting the atrix entries fro a collection of N α Curie-Weiss distributed rando spins ±1. Observe that the definition in [13] is even ore general than Definition 1. It also allows to replace F β by ore general functions F (cf. Reark 1). Let P be the probability easure underlying soe atrix enseble (A N ) N of real syetric atrices A N R N N. Denote by λ 1... λ N the eigenvalues of A N. Then we call σ N := 1 N N i=1 δ λ i the eigenvalue distribution easure of A N. We say that the seicircle law holds for the enseble (A N ) N, if σ N converges weakly in probability to σ sc as N, i.e. for all bounded continuous functions f : R R and for all ɛ > 0 we have ( ) li P N f(x) dσ N (x) f(x) dσ sc (x) > ɛ = 0, where the seicircle σ sc is the Borel easure on R with support [, ] and (Lebesgue-) density 1 π 4 x at x [, ]. The following result is proved in [13]. Theore 3 (Theore 31 and Corollary 8 in [13]) Let (X N ) N be a generalized P N α F β - Curie-Weiss enseble. Then the seicircle law holds for N X N / N if either 3
4 (i) β [0, 1) and α 1 or (ii) β = 1 and α is satisfied. The purpose of the present paper is to extend this result to subcritical teperatures β > 1. Our ain result reads: Theore 4 Let (X N ) N be a generalized P N α F β - Curie-Weiss enseble N with α 1 and β > 1. Denote by = (β) the unique strictly positive solution of the equation tanh(β) = (cf. (1)). Then the seicircle law holds for A N := X N / N(1 ), i.e. for all bounded continuous functions f : R R and for all ɛ > 0 we have ( ) li α N PN F β f(x) dσ N N (x) f(x) dσ sc (x) > ɛ = 0, where σ N denotes the eigenvalue distribution easure of A N. As entioned above, Theore 3 was proved in [13] by introducing the concept of approxiately uncorrelated rando variables. For ensebles of real syetric atrices this ay be forulated as follows (cf. [13, Def. 4]). Definition 5 Let (Ω, F, P) denote the probability space for an enseble (X N ) N of real syetric N N atrices. We say that the entries are approxiately uncorrelated if ( l E X N (i ν, j ν ) p ρ=1 ) X N (u ρ, v ρ ) C l,p N l and for every l N there is a sequence a l,n converging to 0 as N with ( l E X N (i ν, j ν ) ) 1 a l,n (5) for all sequences (i 1, j 1 ),..., (i l, j l ) which are pairwise disjoint and disjoint to the sequences (u 1, v 1 ),..., (u p, v p ) with N-independent constants C l,p. By sequence we ean that all indices (i s, j s ), (u s, v s ) ay depend on N and that for each value of N they belong to the set {(i, j) : 1 i j N}. In [13, Theore 5] it is shown that conditions (4) and (5) are well suited to apply the original ideas of Wigner [7, 8] and Grenander [1] to prove the seicircle law via the ethod of oents (see also [, 3, 18, 1, ] and the onographs [1, 4, 3, 5]). Matrix ensebles with correlated entries have already been considered in [5, 7, 8, 10, 11, 14, 19, 4]. See [13] and the recent survey [16] for ore inforation on these results. (4) 4
5 Theore 3 follows fro [13, Theore 5] by verifying that under conditions (i) and (ii) the enseble P N α F β has approxiately uncorrelated entries. For β > 1 the situation is different. For exaple, condition (4) is N violated for any α > 0, because (cf. [13, proof of Proposition 35]) li N EN α F β N ( XN (1, 1)X N (1, ) ) = > 0, (6) where, again, denotes the average agnetization (1). Indeed, by the independence of X N (1, 1) and X N (1, ) with respect to P t we conclude E t (X N (1, 1)X N (1, )) = E t (X N (1, 1))E t (X N (1, )) = t. Moreover, and this is the crucial difference fro the case β 1, the function F β has two iniizers ± (cf. Proposition 8) so that for large values of N we have ν N 1 (δ + δ ) fro which (6) follows. Proposition 7 stated below can be used to ake this arguent rigorous. In order to prove Theore 4 we use an idea that has already been introduced in the proof of Proposition 3 in [13]. For the oent let us proceed heuristically and assue ν N = 1 (δ + δ ). Therefore we only need to consider the atrix ensebles related to P ±. These fall into the class of real syetric atrices with i.i.d. entries X N (i, j), i j that are distributed according to 1 [(1 ± )δ 1 + (1 )δ ]. Consequently E ± (X N (i, j)) = ± and E ± (XN (i, j)) = 1. Subtracting the ean and dividing by the standard deviation leads to standard Wigner ensebles X N,± := 1 1 (X N E N ), E N (i, j) := 1 for all 1 i, j N. (7) By the classical results of Wigner [7, 8] the eigenvalue distribution easures of X N± / N converge to the seicircle law σ sc when considered with respect to the probability easures P ±. Now we need to relate X N,± back to X N. To this end, observe that X N / N(1 ) is a rank 1 perturbation of both X N,± / N and we can therefore expect (see Lea 11) that the eigenvalue distribution easures of X N / N(1 ) converge to the seicircle law as well. What is still issing is an indicator when to replace the P N α F β - distributed X N N by X N,+ and when by X N,. As we will see by soe basic large deviations arguent in Proposition 9 the su of the entries is an efficient choice for that. Define S N := X N (i, j), X N,+ := 1 {SN >0}, X N, := 1 {SN 0} = 1 X N,+, 1 i j N (8) 1 Y N,± := (X N E N )X N,±, 1 Y N := Y N,+ + Y N,. (9) The core of the proof of Theore 4 is to show that the entries of Y N are approxiately uncorrelated. Since Y N X N / 1 has rank 1 our ain result is then a consequence of [13, Theore 5] and Lea 11. 5
6 We also have results on the largest and second largest singular value of generalized Curie-Weiss atrices [17], which copleent and iprove on [13]. The plan of the paper is as follows. In Section we use Laplace s ethod to ake the starting point of our heuristic arguent, ν N 1 (δ + δ ) for large values of N, precise. The reaining arguents for the proof of our ain result Theore 4 are gathered in Section 3. Acknowledgeent The second author would like to thank the Lehrgebiet Stochastics at the FernUniversität in Hagen, where ost of the work was accoplished, for support and great hospitality. The authors are grateful to Michael Fleerann for valuable suggestions. Analysis of the de Finetti easures In this section we state and prove in Lea 6 the precise version of the forula ν N 1 (δ + δ ) for the de Finetti easure that we used in the heuristic arguents at the end of the Introduction. Lea 6 Assue α > 0, β > 1 and let ν N ν N,α,β be given as in Definition 1. Recall also the definition of the average agnetization (β) in (1). Then the following holds: a) There exist nubers C, δ > 0 such that for all N N : ν N ([, α ]) Ce δn b) For all l N there exist C l > 0 such that for all N N : c) li N t l dν N (t) C l N αl (1 + t) l dν N (t) = 1 (1 ) l for all l N. Lea 6 is proved at the end of this section using Laplace s ethod. The following version is a special case of [0, Theore 7.1] (cf. [13, Proposition 4]). Proposition 7 (Laplace ethod [0]) Suppose F : (, 1) R is differentiable, φ : (, 1) R is continuous and for soe < a < b 1 we have 1. inf t [c,b) F (t) > F (a) for all c (a, b). 6
7 . As t a we have F (t) = F (a) + P (t a) κ + O ( (t a) κ+1 ) (10) φ(t) = Q (t a) λ + O ( (t a) λ ) (11) where κ, λ and P are positive constants, Q is a real constant, and (10) is differentiable. 3. For x R sufficiently large the function t e x F (t) / φ(t) belongs to L 1 (a, b). Then as x the integral I(x) := b a e x F (t) / φ(t) dt satisfies I (x) Q ( ) ( ) λ λ κ Γ κ e x F (a)/ κ xp A(x) where A(x) B(x) eans li x B(x) = 1 and Γ denotes the Gaa function. Next we suarize those properties of the function F β that are used in the proof of Lea 6. In view of Proposition 7 we need to analyze the onotonicity properties of F β. In addition we provide an estiate that is useful to establish integrability of ν N near the endpoints t = ±1. Proposition 8 Assue β > 1 and let F β, (β) be defined as in (1). Then: a) F β C 3 (, 1) is an even function, i.e. F β (t) = F β ( t) for all t (, 1). b) F β < 0 on (0, ), F β > 0 on (, 1), and F β () > 0. c) For all t (, 1) we have e F β(t)/ e 9β/ (1 t ). Proof. Stateent a) is obvious. Stateent b) follows fro a straight forward coputation for which it is useful to observe that ln 1+t 1 t = Artanh(t) and F β (t) = β(1 t ) (Artanh(t) βt). Because of the evenness of F β it suffices to prove stateent c) for 0 t < 1 only. Set X := ln(1 t) 0. Since ln(1 + t) 0 we have F β (t) = 1 8β (X + ln(1 + t)) (ln(1 + t) X) 8β X 1 X. 1 Using in addition that 8β X 3 X + 9 β 0 the clai follows. We now have all ingredients to verify Lea 6. Proof (Lea 6). We begin by evaluating the asyptotic behavior of the noring constant Z N = e N α F β (t)/ φ(t) dt with φ(t) = 1 1 t. 7
8 In order to apply Proposition 7 we need to split the doain of integration into those four regions where F β is onotone. Due to the evenness of F β (Proposition 8 a) it suffices to consider the integrals over [, 0] and [, 1). In both cases the paraeters for condition. of Proposition 7 are κ =, P = F β 1. and 3. of Proposition 7 are satisfied because of stateents b) and c) of Proposition 8. Hence ( )/ = F β ()/ > 0, λ = 1, and Q = 1/(1 ). Conditions Z N Γ( 1 ) 1 ( 4 F β ()N α ) 1 e N α F β ()/. (1) Keeping the integrand fixed one ay apply Proposition 7 also to the integral over [, 0] (now κ = 1, P = F β ( /), λ = 1, Q = 1/(1 (/) )). We arrive at e N α F β (t)/ dt 1 t Γ(1) 1 ( ) F β ( )N α e N α F β ( )/ (13) Taking the quotient of (13) and (1) one easily derives stateent a) with, say, δ = 1 (F β( ) F β()) > 0. In order to obtain the reaining clais set φ 1 (t) := t l /(1 t ) resp. φ (t) := (1 + t) l /(1 t ). Applying Proposition 7 to the intervals [, ] and [, 1) we find e N α F β (t)/ φ 1 (t) dt e N α F β (t)/ φ (t) dt l+1 Γ( ) ( 1 Γ( 1 ) ( (1 ) 1 l 4 F β ()N α 4 F β ()N α ) l+1 e N α F β ()/ ) 1 e N α F β ()/ and stateents b) and c) follow fro (1). 3 Proof of the Main Result We begin the proof with large deviations estiates that deonstrate the efficiency of the indicators X N,± defined in (8). They are iediate consequences of Hoeffding s inequality. Nevertheless, we provide a short proof for the convenience of the reader. Proposition 9 Let P t and S N be defined as in (), (8). For a (0, 1) denote q a := 1 4 log(1 a ) > 0. Then the following estiates hold true. a) For all t [a, 1] : P (N ) t (S N 0) e qan. b) For all t [, a] : P (N ) t (S N > 0) e qan. 8
9 Proof. Since P ±1 (S N = ± 1 N(N + 1)) = 1 we only need to consider t (, 1). Define λ(t) := 1 1 t log 1+t. Then E t (e λ(t)x N (1,1) ) = 1 eλ(t) (1 + t) + 1 e λ(t) (1 t) = 1 t. For t [a, 1) we have λ(t) < 0. Using in addition that the rando variables X N (i, j), 1 i j N, are independent and identically distributed with respect to the probability easure P t we obtain P t (S N 0) E t (e λ(t)s N ) = E t (e λ(t)x N (1,1) ) N(N+1) e qan. Siilarly, λ(t) > 0 for t (, a] and P t (S N > 0) E t (e λ(t)s N ) e qan. We are now ready to prove the lea which is the key for proving our ain result, i.e. to show that Y N defined in (9) has approxiately uncorrelated entries. Lea 10 Let (X N ) N be a generalized P N α F β - Curie-Weiss enseble N with α 1 and β > 1 and let Y N be defined as in (9) (see also (7)). Then (Y N ) N has approxiately uncorrelated entries with respect to the probability easure P N α F β (see Definition 5). N Proof. Let us first consider (5) and define (see (8), (9)) G N,± := X N,± Obviously, l Y N (i ν, j ν ) = X N,± l (X N,± Y N (i ν, j ν )) l = X N,± Y N,± (i ν, j ν ) = (1 ) l X N,± l (X N (i ν, j ν ) ) ( E N α F β l Y N N (i ν, j ν ) ) = E N α F β (G N N,+ ) + E N α F β (G N N, ) and E N α F β N (G N,± ) = (1 ) l E t (X N,± H N,± ) dν N (t), (14) with H N,± := l (X N(i ν, j ν ) ). Note that X N (i ν, j ν ) = 1 and that E t (X N (i ν, j ν )) = t. Since the index pairs (i 1, j 1 ),..., (i l, j l ) are assued to be pairwise disjoint we obtain E t (H N,± ) = (1 + t) l. (15) 9
10 In order to evaluate E N F β N α E t (X N,+ H N,+ ) dν N = (G N,+ ) we decopose + E t (X N,+ H N,+ ) dν N E t (X N,+ H N,+ ) dν N (16) E t (X N, H N,+ ) dν N + E t (H N,+ )dν N. Fro Proposition 9, fro Lea 6 a), and fro the trivial estiate H N,+ (1 + ) l we obtain constants q, C, δ > 0 such that for all N N: E t (X N,+ H N,+ ) dν N (1 + ) l e qn, E t (X N, H N,+ ) dν N (1 + ) l e qn, E t (X N,+ H N,+ ) dν N C(1 + ) l e δn α. Thus the first three suands on the right hand side of (16) all converge to zero as N tends to. By (14), (15) and Lea 6 c) we have proved li N EN α F β N (G N,+ ) = 1. By analogue arguents the expected value of G N, can be seen to converge to 1 as well and (5) is established. Estiate (4) can be proved in a siilar fashion. To this end redefine l p H N,± := (X N (i ν, j ν ) ) (X N (u ρ, v ρ ) ). ρ=1 The expected value in (4) equals ( (1 ) l+p 1 E t (X N,+ H N,+ ) dν N + Oberve that E t (H N,± ) = (t ) l Q ± (t) E t (X N, H N, ) dν N ). (17) with Q ± being a polynoial of degree p and Q ± (t) (1 + ) p for all t [, 1]. Using (16), the arguents thereafter, H N,+ (1 + ) l+p, and stateent b) of Lea 6 one ay establish the existence of constants C, δ, q > 0 such that for all N N : E t (X N,+ H N,+ ) dν N (1 + ) l+p (e qn + Ce δn α + C l N αl ). 10
11 Clearly, the sae estiate holds for E t(x N, H N, ) dν N and (4) is proved since we have assued α 1. The final observation we need is that rank 1 perturbations preserve the weak convergence (in probability) of the eigenvalue distribution easures (cf. [9]). Lea 11 Let (Ω, F, P) denote the probability space underlying two ensebles (A N ) N, (B N ) N of real syetric N N atrices that satisfy rank(a N (ω) B N (ω)) 1 for all ω Ω. Denote by σ N resp. by µ N the eigenvalue distribution easures of A N resp. B N. Assue furtherore that (µ N ) N converges weakly in probability to the seicircle law σ sc. Then (σ N ) N also converges weakly in probability to the seicircle law. Proof. The assuption on the rank of A N B N iplies that the eigenvalues of the two atrices interlace. Therefore we have for any interval I R and any ω Ω that #(eigenvalues of A N (ω) in I) #(eigenvalues of B N (ω) in I). (18) In order to prove Lea 11 we fix a bounded continuous function f : R R and nubers ε, γ > 0. We have to show that there exists N 0 such that for all N N 0 the estiate ( ) P f dσ N f dσ sc > ε < γ (19) holds. Choose a step function g = r i=1 α ix Ii (α i R, the intervals I i [ 4, 4] are pairwise disjoint) such that sup{ f(x) g(x) : x [ 4, 4]} in ( ε 6, 1). (0) Write f dσ N f dσ sc = 6 j=1 j, with 1 := 4 3 := 5 := 4 f dµ N f dσ sc, := 4 g dσ N g dµ N, 4 := 4 R\[ 4,4] f dσ N, (f g) dσ N, (g f) dµ N, 4 6 := f dµ N. R\[ 4,4] It suffices to show for each j = 1,..., 6 that there exists N j such that for all N N j we have P( j > ε 6 ) < γ 6 (1) 11
12 Indeed, (19) then holds for all N N 0 := ax{n j : j = 1,..., 6}. For j =, 4 estiate (1) follows trivially fro (0) with N j = 1. The case j = 1 is a consequence of the assuption of Lea 11. Estiate (18) together with (0) iply 3 r i=1 α i σ N (I i ) µ N (I i ) r( f + 1) N < ε 6 by choosing N 3 sufficiently large. Next we treat j = 6. Using the assued weak convergence of (µ N ) N again and choosing an arbitrary continuous test function f 0 : R [0, 1] with f 0 [,] = 0 and f 0 R\[ 4,4] = 1 one ay obtain N 6 such that for all N N 6 : ( ) ε P µ N (R \ [ 4, 4]) > 1( f +1) P( f 0 dµ N > ε 1( f +1) ) < γ 6. () On the one hand this iplies P( 6 > ε 1 ) < γ 6 for all N N 6. On the other hand we ay use () to handle 5. It follows fro (18) that µ N (R \ [ 4, 4]) σ N (R \ [ 4, 4]) N < ε 1( f + 1) for all N Ñ5 with a suitable choice of Ñ5. Setting N 5 := ax(ñ5, N 6 ) then copletes the proof with the help of (). After all ingredients have been gathered we ay now conclude the proof of our ain result. Proof (Theore 4). We denote by σ N resp. µ N the eigenvalue distribution easures of A N := X N / N(1 ), resp. B N := Y N / N (see (9), (7) for the definition of Y N ). Since (Y N ) N is an approxiately uncorrelated schee of rando variables it follows fro [13, Theore 5] that (µ N ) N converges weakly in probability to the seicircle law σ sc. Since A N B N = N(1 ) (X + X )E N always has rank 1, the clai now follows fro Lea 11. Reark 1 Observe that in the proof of Theore 4 we did not use the special for of the function F β but only those properties that were collected in Proposition 8. Hence the result also holds for generalized P N α F N - Curie- Weiss ensebles (cf. [13, Definition 9]), if F : (, 1) R satisfies all the properties stated in Proposition 8. Of course, condition c) ay by replaced by the requireent that e xf (t)/ dt < for sufficiently 1 t large values of x, because this is the only use of property c). 1
13 References [1] G. Anderson, A. Guionnet, O. Zeitouni: An introduction to rando atrices, Cabridge University Press (010). [] L. Arnold: On the Asyptotic Distribution of the Eigenvalues of Rando Matrices, J. Math. Anal. Appl. 0, 6 68 (1967). [3] L. Arnold: On Wigner s seicircle law for the eigenvalues of rando atrices, Z. Wahrscheinlichkeitstheorie verw. Geb. 19, (1971). [4] Z. Bai, J. Silverstein: Spectral analysis of large diensional rando atrices, Springer (010). [5] W. Bryc, A. Debo, T. Jiang: Spectral easure of large rando Hankel, Markov and Toeplitz atrices, Ann. Prob. 34, 1 38 (006). [6] R. Ellis: Entropy, large deviations, and statistical echanics, Springer 006. [7] O. Friesen, M. Löwe: The Seicircle Law for Matrices with Independent Diagonals, J. Theoret. Probab. 6, (013). [8] O. Friesen, M. Löwe: A phase transition for the liiting spectral density of rando atrices, Electron. J. Probab. 18, 1 17 (013). [9] Z. Füredi, J. Kolós: The eigenvalues of rando syetric atrices, Cobinatorica 1 no. 3, (1981). [10] F. Götze, A. Nauov, A. Tikhoirov: Liit theores for two classes of rando atrices with dependent entries, Theory Probab. Appl. 59, 3 39 (015). [11] F. Götze, A. Tikhoirov: Liit theores for spectra of rando atrices with artingale structure, Theory Probab. Appl. 51, 4 64 (007). [1] U. Grenander: Probabilities on algebraic structures, Wiley [13] W. Hochstättler, W. Kirsch, S. Warzel: Seicircle law for a atrix enseble with dependent entries, J. Theoret. Probab. 9, (016). [14] K. Hofann-Credner, M. Stolz: Wigner theores for rando atrices with dependent entries: ensebles associated to syetric spaces and saple covariance atrices, Electron. Coun. Probab. 13, (008). [15] W. Kirsch: Moents in Probability, book in preparation, to appear at DeGruyter. [16] W. Kirsch, T. Kriecherbauer: Sixty years of oents for rando atrices, Preprint arxiv: to appear in: 13
14 F. Gesztesy et al (Edts.), Partial Differential Equations, Matheatical Physics, and Stochastic Analysis. A Volue in Honor of Helge Holdens 60th Birthday, EMS Congress Reports [17] W. Kirsch, T. Kriecherbauer: Largest and second largest singular values of de Finetti rando atrices; in preparation [18] V. Marchenko, L. Pastur: Distribution of eigenvalues in certain sets of rando atrices. Math. USSR-Sbornik 1, (1967). [19] M. Löwe, K. Schubert: On the liiting spectral density of rando atrices filled with stochastic processes, to appear in: Rando Operators and Stochastic Equations, arxiv: [0] F. Olver: Asyptotics and special functions, Acadeic Press (1974). [1] L. Pastur: On the spectru of rando atrices, Theoret. and Math. Phys. 10 no. 1, (197). [] L. Pastur: Spectra of rando selfadjoint operators, Russian Math. Surveys 8, 1 67 (1973). [3] L. Pastur, M. Sherbina: Eigenvalue distribution of large rando atrices, Matheatical Surveys and Monographs 171, AMS (011). [4] J. Schenker, H. Schulz-Baldes: Seicircle law and freeness for rando atrices with syetries or correlations, Matheatical Research Letters 1, (005). [5] T. Tao: Topics in rando atrix theory, AMS (01). [6] C. Thopson: Matheatical Statistical Mechanics, Princeton University Press (1979). [7] E. Wigner: Characteristic vectors of bordered atrices with infinite diension, Ann. Math. 6, (1955). [8] E. Wigner: On the distribution of the roots of certain syetric atrices, Ann. Math. 67, (1958). Werner Kirsch Thoas Kriecherbauer werner.kirsch@fernuni-hagen.de thoas.kriecherbauer@uni-bayreuth.de 14
ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationDISKRETE MATHEMATIK UND OPTI-
DISKRETE MATHEMATIK UD OPTI- MIERUG Winfried Hochstättler Werner Kirsch Simone Warzel: Semicircle law for a matrix ensemble with dependent entries Technical Report feu-dmo033.4 Contact: winfried.hochstaettler@fernuni-hagen.de
More informationSome Classical Ergodic Theorems
Soe Classical Ergodic Theores Matt Rosenzweig Contents Classical Ergodic Theores. Mean Ergodic Theores........................................2 Maxial Ergodic Theore.....................................
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE
ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationFAST DYNAMO ON THE REAL LINE
FAST DYAMO O THE REAL LIE O. KOZLOVSKI & P. VYTOVA Abstract. In this paper we show that a piecewise expanding ap on the interval, extended to the real line by a non-expanding ap satisfying soe ild hypthesis
More informationOn Conditions for Linearity of Optimal Estimation
On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at
More informationThe Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters
journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationDistributional transformations, orthogonal polynomials, and Stein characterizations
Distributional transforations, orthogonal polynoials, and Stein characterizations LARRY GOLDSTEIN 13 and GESINE REINERT 23 Abstract A new class of distributional transforations is introduced, characterized
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationResearch Article On the Isolated Vertices and Connectivity in Random Intersection Graphs
International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for
More informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationAsymptotics of weighted random sums
Asyptotics of weighted rando sus José Manuel Corcuera, David Nualart, Mark Podolskij arxiv:402.44v [ath.pr] 6 Feb 204 February 7, 204 Abstract In this paper we study the asyptotic behaviour of weighted
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationThe proofs of Theorem 1-3 are along the lines of Wied and Galeano (2013).
A Appendix: Proofs The proofs of Theore 1-3 are along the lines of Wied and Galeano (2013) Proof of Theore 1 Let D[d 1, d 2 ] be the space of càdlàg functions on the interval [d 1, d 2 ] equipped with
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationHermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s
International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of
More informationShannon Sampling II. Connections to Learning Theory
Shannon Sapling II Connections to Learning heory Steve Sale oyota echnological Institute at Chicago 147 East 60th Street, Chicago, IL 60637, USA E-ail: sale@athberkeleyedu Ding-Xuan Zhou Departent of Matheatics,
More informationStatistics and Probability Letters
Statistics and Probability Letters 79 2009 223 233 Contents lists available at ScienceDirect Statistics and Probability Letters journal hoepage: www.elsevier.co/locate/stapro A CLT for a one-diensional
More informationA := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.
59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationTHE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n
THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 9th February 011 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion of
More informationThe Hilbert Schmidt version of the commutator theorem for zero trace matrices
The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that
More informationThe spectral mapping property of delay semigroups
The spectral apping property of delay seigroups András Bátkai, Tanja Eisner and Yuri Latushkin To the eory of G. S. Litvinchuk Abstract. We offer a new way of proving spectral apping properties of delay
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationarxiv: v1 [math.pr] 17 May 2009
A strong law of large nubers for artingale arrays Yves F. Atchadé arxiv:0905.2761v1 [ath.pr] 17 May 2009 March 2009 Abstract: We prove a artingale triangular array generalization of the Chow-Birnbau- Marshall
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 17th February 2010 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative
More informationMachine Learning Basics: Estimators, Bias and Variance
Machine Learning Basics: Estiators, Bias and Variance Sargur N. srihari@cedar.buffalo.edu This is part of lecture slides on Deep Learning: http://www.cedar.buffalo.edu/~srihari/cse676 1 Topics in Basics
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationAlgebraic Montgomery-Yang problem: the log del Pezzo surface case
c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationLORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH
LORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH GUILLERMO REY. Introduction If an operator T is bounded on two Lebesgue spaces, the theory of coplex interpolation allows us to deduce the boundedness
More informationAsymptotic mean values of Gaussian polytopes
Asyptotic ean values of Gaussian polytopes Daniel Hug, Götz Olaf Munsonius and Matthias Reitzner Abstract We consider geoetric functionals of the convex hull of norally distributed rando points in Euclidean
More informationGeneralized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,
Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University
More informationTail estimates for norms of sums of log-concave random vectors
Tail estiates for nors of sus of log-concave rando vectors Rados law Adaczak Rafa l Lata la Alexander E. Litvak Alain Pajor Nicole Toczak-Jaegerann Abstract We establish new tail estiates for order statistics
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationNORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS
NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS NIKOLAOS PAPATHANASIOU AND PANAYIOTIS PSARRAKOS Abstract. In this paper, we introduce the notions of weakly noral and noral atrix polynoials,
More informationNew Classes of Positive Semi-Definite Hankel Tensors
Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationarxiv: v2 [math.co] 3 Dec 2008
arxiv:0805.2814v2 [ath.co] 3 Dec 2008 Connectivity of the Unifor Rando Intersection Graph Sion R. Blacburn and Stefanie Gere Departent of Matheatics Royal Holloway, University of London Egha, Surrey TW20
More informationWeighted Superimposed Codes and Constrained Integer Compressed Sensing
Weighted Superiposed Codes and Constrained Integer Copressed Sensing Wei Dai and Olgica Milenovic Dept. of Electrical and Coputer Engineering University of Illinois, Urbana-Chapaign Abstract We introduce
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationSTRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES
Annales Univ Sci Budapest, Sect Cop 39 (2013) 365 379 STRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES MK Runovska (Kiev, Ukraine) Dedicated to
More informationPrerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.
Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can
More informationM ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.
M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationLower Bounds for Quantized Matrix Completion
Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationThe Fundamental Basis Theorem of Geometry from an algebraic point of view
Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationLecture 21 Nov 18, 2015
CS 388R: Randoized Algoriths Fall 05 Prof. Eric Price Lecture Nov 8, 05 Scribe: Chad Voegele, Arun Sai Overview In the last class, we defined the ters cut sparsifier and spectral sparsifier and introduced
More informationSupplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
Suppleentary Material for Fast and Provable Algoriths for Spectrally Sparse Signal Reconstruction via Low-Ran Hanel Matrix Copletion Jian-Feng Cai Tianing Wang Ke Wei March 1, 017 Abstract We establish
More informationPREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL
PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY
More informationASYMPTOTICS OF MARKOV KERNELS AND THE TAIL CHAIN
ASYMPTOTICS OF MARKOV KERNELS AND THE TAIL CHAIN SIDNEY I. RESNICK AND DAVID ZEBER Abstract. An asyptotic odel for extree behavior of certain Markov chains is the tail chain. Generally taking the for of
More informationG G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k
12 VICTORIA HOSKINS 3. Algebraic group actions and quotients In this section we consider group actions on algebraic varieties and also describe what type of quotients we would like to have for such group
More informationLearnability and Stability in the General Learning Setting
Learnability and Stability in the General Learning Setting Shai Shalev-Shwartz TTI-Chicago shai@tti-c.org Ohad Shair The Hebrew University ohadsh@cs.huji.ac.il Nathan Srebro TTI-Chicago nati@uchicago.edu
More informationAPPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS
APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS Received: 23 Deceber, 2008 Accepted: 28 May, 2009 Counicated by: L. REMPULSKA AND S. GRACZYK Institute of Matheatics Poznan University of Technology ul.
More information1 Rademacher Complexity Bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #10 Scribe: Max Goer March 07, 2013 1 Radeacher Coplexity Bounds Recall the following theore fro last lecture: Theore 1. With probability
More informationCompleteness of Bethe s states for generalized XXZ model, II.
Copleteness of Bethe s states for generalized XXZ odel, II Anatol N Kirillov and Nadejda A Liskova Steklov Matheatical Institute, Fontanka 27, StPetersburg, 90, Russia Abstract For any rational nuber 2
More informationTEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES
TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationTail Estimation of the Spectral Density under Fixed-Domain Asymptotics
Tail Estiation of the Spectral Density under Fixed-Doain Asyptotics Wei-Ying Wu, Chae Young Li and Yiin Xiao Wei-Ying Wu, Departent of Statistics & Probability Michigan State University, East Lansing,
More informationOn the Homothety Conjecture
On the Hoothety Conjecture Elisabeth M Werner Deping Ye Abstract Let K be a convex body in R n and δ > 0 The hoothety conjecture asks: Does K δ = ck iply that K is an ellipsoid? Here K δ is the convex
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationFour-vector, Dirac spinor representation and Lorentz Transformations
Available online at www.pelagiaresearchlibrary.co Advances in Applied Science Research, 2012, 3 (2):749-756 Four-vector, Dirac spinor representation and Lorentz Transforations S. B. Khasare 1, J. N. Rateke
More informationThe isomorphism problem of Hausdorff measures and Hölder restrictions of functions
The isoorphis proble of Hausdorff easures and Hölder restrictions of functions Doctoral thesis András Máthé PhD School of Matheatics Pure Matheatics Progra School Leader: Prof. Miklós Laczkovich Progra
More informationA BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volue 3, Nuber 2, Pages 211 231 c 2006 Institute for Scientific Coputing and Inforation A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR
More informationITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N ( ) 528
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 40 2018 528 534 528 SOME OPERATOR α-geometric MEAN INEQUALITIES Jianing Xue Oxbridge College Kuning University of Science and Technology Kuning, Yunnan
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationOn Certain C-Test Words for Free Groups
Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of
More informationMath Real Analysis The Henstock-Kurzweil Integral
Math 402 - Real Analysis The Henstock-Kurzweil Integral Steven Kao & Jocelyn Gonzales April 28, 2015 1 Introduction to the Henstock-Kurzweil Integral Although the Rieann integral is the priary integration
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationEstimating Parameters for a Gaussian pdf
Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationBiostatistics Department Technical Report
Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent
More informationAn l 1 Regularized Method for Numerical Differentiation Using Empirical Eigenfunctions
Journal of Matheatical Research with Applications Jul., 207, Vol. 37, No. 4, pp. 496 504 DOI:0.3770/j.issn:2095-265.207.04.0 Http://jre.dlut.edu.cn An l Regularized Method for Nuerical Differentiation
More informationSupport recovery in compressed sensing: An estimation theoretic approach
Support recovery in copressed sensing: An estiation theoretic approach Ain Karbasi, Ali Horati, Soheil Mohajer, Martin Vetterli School of Coputer and Counication Sciences École Polytechnique Fédérale de
More informationLecture 20 November 7, 2013
CS 229r: Algoriths for Big Data Fall 2013 Prof. Jelani Nelson Lecture 20 Noveber 7, 2013 Scribe: Yun Willia Yu 1 Introduction Today we re going to go through the analysis of atrix copletion. First though,
More informationTHE CENTER OF MASS FOR SPATIAL BRANCHING PROCESSES AND AN APPLICATION FOR SELF-INTERACTION
THE CENTER OF MASS FOR SPATIAL BRANCHING PROCESSES AND AN APPLICATION FOR SELF-INTERACTION Abstract. Consider the center of ass of a supercritical branching-brownian otion, or that of a supercritical super-brownian
More informationElementary properties of 1-isometries on a Hilbert space
Eleentary properties of 1-isoetries on a Hilbert space Muneo Chō Departaent of Matheatics, Kanagawa University Hiratsua 259-1293, Japan Caixing Gu y Departent of Matheatics, California Polytechnic State
More informationON A CLASS OF DISTRIBUTIONS STABLE UNDER RANDOM SUMMATION
Applied Probability Trust (6 Deceber 200) ON A CLASS OF DISTRIBUTIONS STABLE UNDER RANDOM SUMMATION L.B. KLEBANOV, Departent of Probability and Statistics of Charles University A.V. KAKOSYAN, Yerevan State
More informationResearch Article Perturbations of Polynomials with Operator Coefficients
Coplex Analysis Volue 2013, Article ID 801382, 5 pages http://dx.doi.org/10.1155/2013/801382 Research Article Perturbations of Polynoials with Operator Coefficients Michael Gil Departent of Matheatics,
More informationConsistent Multiclass Algorithms for Complex Performance Measures. Supplementary Material
Consistent Multiclass Algoriths for Coplex Perforance Measures Suppleentary Material Notations. Let λ be the base easure over n given by the unifor rando variable (say U over n. Hence, for all easurable
More informationOPTIMAL DESIGNS FOR ESTIMATING PAIRS OF COEFFICIENTS IN FOURIER REGRESSION MODELS
Statistica Sinica 19 2009, 1587-1601 OPTIMAL DESIGNS FOR ESTIMATING PAIRS OF COEFFICIENTS IN FOURIER REGRESSION MODELS Holger Dette 1, Viatcheslav B. Melas 2 and Petr Shpilev 2 1 Ruhr-Universität Bochu
More informationComputable Shell Decomposition Bounds
Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung
More information