有一致降指数的算子

本文讨论了有拓扑一致降指数的算子的可交换拟幂零摄动:举出反例说明有拓扑一致降指数的算子在可交换拟幂零摄动下是不稳定的;得到有拓扑一致降指数的算子和它的可交换拟幂零摄动的超值域与超核之间的关系;利用这些关系,证明了左(右)Drazin可逆算子在可交换幂零摄动下是稳定的.最后还讨论了Banach空间上B-正则类BR_i(1≤i≤13)中算子的R_i型Kato分解与R_i型超Kato分解.     

Asymptotic distributions of regression and autoregression coefficients with martingale difference disturbances

In this paper a form of the Lindeberg condition appropriate for martingale differences is used to obtain asymptotic normality of statistics for regression and autoregression. The regression model is y_t = Bz_t + v_t. The unobserved error sequence {v_t} is a sequence of martingale differences with conditional covariance matrices {Σ_t} and satisfying sup_{t=1,…, n} {v′_tv_tI(v′_tv_t>a) |z_t, v_t−1, z_t−1, …} 0 as a → ∞. The sample covariance of the independent variables z₁, …, z_n, is assumed to have a probability limit M, constant and nonsingular; max_t=1,…,nz′_tz_t/n 0. If (1/n)Σ_t=1ⁿΣ_t Σ, constant, then √nvec( _n−B) N(0,M⁻¹Σ) and _n Σ. The autoregression model is x_t = Bx_{t − 1} + v_t with the maximum absolute value of the characteristic roots of B less than one, the above conditions on {v_t}, and (1/n)Σ_t=max(r,s)+1(Σ_tv_t−1−rv′_t−1−s) δ_rs(ΣΣ), where δ_rs is the Kronecker delta. Then √nvec( _n−B) N(0,Γ⁻¹Σ), where Γ = Σ_{s = 0}^∞B^sΣ(B′)^s.     

On the conditional probability density functions of multivariate uniform random vectors and multivariate normal random vectors

It is shown that the conditional probability density function of Y₁ given (1/n) Σ_i=1ⁿ Y_i=1Y_i^t = Σ, where Y₁, Y₂,…, Y_n are i.i.d, p-variate uniform random vectors with mean 0 equals to that of Y₁ given (1/n) Σ_i=1ⁿ Y_iY_i^t,…, Y_n are i.i.d, p-variate normal random vectors with mean 0 and covariance matrix Σ.     

Exact Misclassification Probabilities for Plug-In Normal Quadratic Discriminant Functions: II. The Heterogeneous Case

We consider the problem of discriminating between two independent multivariate normal populations, N_p(μ₁, Σ₁) and N_p(μ₂, Σ₂), having distinct mean vectors μ₁ and μ₂ and distinct covariance matrices Σ₁ and Σ₂. The parameters μ₁, μ₂, Σ₁, and Σ₂ are unknown and are estimated by means of independent random training samples from each population. We derive a stochastic representation for the exact distribution of the “plug-in” quadratic discriminant function for classifying a new observation between the two populations. The stochastic representation involves only the classical standard normal, chi-square, and F distributions and is easily implemented for simulation purposes. Using Monte Carlo simulation of the stochastic representation we provide applications to the estimation of misclassification probabilities for the well-known iris data studied by Fisher (Ann. Eugen.7 (1936), 179–188); a data set on corporate financial ratios provided by Johnson and Wichern (Applied Multivariate Statistical Analysis, 4th ed., Prentice–Hall, Englewood Cliffs, NJ, 1998); and a data set analyzed by Reaven and Miller (Diabetologia16 (1979), 17–24) in a classification of diabetic status.     

Nonparametric Empirical Bayes Estimation of the Matrix Parameter of the Wishart Distribution

We consider independent pairs (X₁, Σ₁), (X₂, Σ₂), …, (X_n, Σ_n), where eachΣ_iis distributed according to some unknown density functiong(Σ) and, givenΣ_i=Σ,X_ihas conditional density functionq(xΣ) of the Wishart type. In each pair the first component is observable but the second is not. After the (n+1)th observationX_n+1is obtained, the objective is to estimateΣ_n+1corresponding toX_n+1. This estimator is called the empirical Bayes (EB) estimator ofΣ. An EB estimator ofΣis constructed without any parametric assumptions ong(Σ). Its posterior mean square risk is examined, and the estimator is demonstrated to be pointwise asymptotically optimal.     

Majorants and Minorants for Elliptic Measures on

Let μ(· ; Σ, G₁) and μ(· ; Ω, G₂) be elliptically contoured measures on ^k centered at 0, having scale parameters (Σ, Ω) and radial cdf′s (G₁, G₂). Elliptical measures v_m(·) and v_M(·), depending on (Σ, Ω, G₁, G₂), are constructed such that V_m(C) ≤ {μ(C; Σ, G₁), μ(C; Ω, G₂)} for every symmetric convex set C ^k with equality for certain sets. These in turn rely on the construction of spectral lower and upper matrix bounds for (Σ, Ω). Extensions include bounds for certain ensembles and mixtures, including versions having star-shaped contours. The lindings specialize to give envelopes for some nonstandard distributions of quadratic forms, with applications to stochastic characteristics of ballistic systems.     

Inequalities for predictive ratios and posterior variances in natural exponential families

The predictive ratio is considered as a measure of spread for the predictive distribution. It is shown that, in the exponential families, ordering according to the predictive ratio is equivalent to ordering according to the posterior covariance matrix of the parameters. This result generalizes an inequality due to Chaloner and Duncan who consider the predictive ratio for a beta-binomial distribution and compare it with a predictive ratio for the binomial distribution with a degenerate prior. The predictive ratio at x₁ and x₂ is defined to be p_g(x₁)p_g(x₂)/[p_g( )]² = h_g(x₁, x₂), where p_g(x₁) = ∫ ƒ(x₁θ) g(θ) dθ is the predictive distribution of x₁ with respect to the prior g. We prove that h_g(x₁, x₂) ≥ h_g^*(x₁, x₂) for all x₁ and x₂ if ƒ(xθ) is in the natural exponential family and Cov_gx(θ) ≥ Cov_g^*x(θ) in the Loewner sense, for all x on a straight line from x₁ to x₂. We then restrict the class of prior distributions to the conjugate class and ask whether the posterior covariance inequality obtains if g and g^* differ in that the “sample size”     

Some properties of BLUE in a linear model and canonical correlations associated with linear transformations

Let (x, Xβ, V) be a linear model and let A′ = (A′₁, A′₂) be a p × p nonsingular matrix such that A₂X = 0, Rank A₂ = p − Rank X. We represent the BLUE and its covariance matrix in alternative forms under the conditions that the number of unit canonical correlations between y₁ ( = A₁x) and y₂ ( = A₂x) is zero. For the second problem, let x′ = (x′₁, x′₂) and let a g-inverse V⁻ of V be written as (V⁻)′ = (A′₁, A′₂). We investigate the reations (if any) between the nonzero canonical correlations {1 ₁ … ₁ > 0} due to y₁ ( = A₁x) and y₂ ( = A₂x), and the nonzero canonical correlations {1 λ₁ … λ_v+r > 0} due to x₁ and x₂. We answer some of the questions raised by Latour et al. (1987, in Proceedings, 2nd Int. Tampere Conf. Statist. (T. Pukkila and S. Puntanen, Eds.), Univ. of Tampere, Finland) in the case of the Moore-Penrose inverse V⁺ = (A′₁, A′₂) of V.     

Classes of orderings of measures and related correlation inequalities II. Multivariate reverse rule distributions

A function f(x) defined on = ₁ × ₂ × … × _n where each _i is totally ordered satisfying f(x y) f(x y) ≥ f(x) f(y), where the lattice operations and refer to the usual ordering on , is said to be multivariate totally positive of order 2 (MTP₂). A random vector Z = (Z₁, Z₂,…, Z_n) of n-real components is MTP₂ if its density is MTP₂. Classes of examples include independent random variables, absolute value multinormal whose covariance matrix Σ satisfies −DΣ⁻¹D with nonnegative off-diagonal elements for some diagonal matrix D, characteristic roots of random Wishart matrices, multivariate logistic, gamma and F distributions, and others. Composition and marginal operations preserve the MTP₂ properties. The MTP₂ property facilitate the characterization of bounds for confidence sets, the calculation of coverage probabilities, securing estimates of multivariate ranking, in establishing a hierarchy of correlation inequalities, and in studying monotone Markov processes. Extensions on the theory of MTP₂ kernels are presented and amplified by a wide variety of applications.     

Common Principal Components for Dependent Random Vectors

Let the kp-variate random vector X be partitioned into k subvectors X_i of dimension p each, and let the covariance matrix Ψ of X be partitioned analogously into submatrices Ψ_ij. The common principal component (CPC) model for dependent random vectors assumes the existence of an orthogonal p by p matrix β such that β^tΨ_ijβ is diagonal for all (i, j). After a formal definition of the model, normal theory maximum likelihood estimators are obtained. The asymptotic theory for the estimated orthogonal matrix is derived by a new technique of choosing proper subsets of functionally independent parameters.     

Precise asymptotics in some strong limit theorems for multidimensionally indexed random variables

Consider Z₊^d (d2)—the positive d-dimensional lattice points with partial ordering , let {X_k,kZ₊^d} be i.i.d. random variables with mean 0, and set S_n=∑_knX_k, nZ₊^d. We establish precise asymptotics for ∑_n|n|^r/p−2P(|S_n||n|^1/p), and for

Full-size image

, (0δ1) as 0, and for

Full-size image

as .     

Sequential Estimation of the Mean Vector of a Multivariate Linear Process

Sequential procedures are proposed to estimate the unknown mean vector of a multivariate linear process of the form X_t − μ = ∑^∞_{j = 0}A_jZ_{t − j}, where the Z_t are i.i.d. (0, Σ) with unknown covariance matrix Σ. The proposed point estimation is asymptotically risk efficient in the sense of Starr (1966, Ann. Math. Statist.37 1173-1185). The fixed accuracy confidence set procedure is asymptotically efficient with prescribed coverage probability in the sense of Chow and Robbins (1965, Ann. Math. Statist.36 457-462). A random central limit theorem for this process, under a mild summability condition on the coefficient matrices A_j, is also obtained.     

Applications of the growth characteristics induced by the spectral distance

Let A be a complex unital Banach algebra. Using a connection between the spectral distance and the growth characteristics of a certain entire map into A, we derive a generalization of Gelfand’s famous power boundedness theorem. Elaborating on these ideas, with the help of a Phragm´en-Lindel¨of device for subharmonic functions, it is then shown, as the main result, that two normal elements of a C^?-algebra are equal if and only if they are quasinilpotent equivalent.     

On the enumeration of parking functions by leading terms

Let x=(x₁,…,x_n) be a sequence of positive integers. An x-parking function is a sequence (a₁,…,a_n) of positive integers whose non-decreasing rearrangement b₁b_n satisfies b_ix₁++x_i. In this paper we give a combinatorial approach to the enumeration of (a,b,…,b)-parking functions by their leading terms, which covers the special cases x=(1,…,1), (a,1,…,1), and (b,…,b). The approach relies on bijections between the x-parking functions and labeled rooted forests. To serve this purpose, we present a simple method for establishing the required bijections. Some bijective results between certain sets of x-parking functions of distinct leading terms are also given.     

On the Conditional Variance for Scale Mixtures of Normal Distributions

For a scale mixture of normal vector, X=A^1/2G, where X, G ⁿ and A is a positive variable, independent of the normal vector G, we obtain that the conditional variance covariance, Cov(X₂ X₁), is always finite a.s. for m2, where X₁ ⁿ and m<n, and remains a.s. finite even for m=1, if and only if the square root moment of the scale factor is finite. It is shown that the variance is not degenerate as in the Gaussian case, but depends upon a function S_A, m(·) for which various properties are derived. Application to a uniform and stable scale of normal distributions are also given.     

Average Width and Optimal Interpolation of the Sobolev-Wiener Class Wpq(R) in the Metric Lq(R)

In this paper, we determine the exact value of average n − K width _n(W^r_pq(R), L_q(R)) of Sobolev-Wiener class W^r_pq(R) in the metric L_q(R) for 1 > q ≥ p > ∞ and get the value of _n(W^r_p(R), L_qp(R)) for the dual case. We also solve the optimal interpolation problems of W^r_pq(R) in the metric L_q(R) and W^r_p(R) in the metric L_qp(R) for 1 < q ≤ p < ∞.     

X-inner automorphisms of enveloping rings

In this paper, we determine the X-inner automorphisms of the smash product R # U(L) of a prime ring R by the universal enveloping algebra U(L) of a characteristic 0 Lie algebra L. Specifically, we show that any such automorphism σ stabilizing R can be written as a product σ = σ₁σ₂, where σ₁ is induced by conjugation by a unit of Q₃(R), the symmetric Martindale ring of quotients of R, and σ₂ is induced by conjugation by a unit of Q₃(T). Here S = Q_l(R) is the left Martindale ring of quotients of R and T is the centralizer of S in S # U(L) - R # U(L). One of the subtleties of the proof is that we must work in several unrelated overrings of R # U(L).     

On linear combinations of two tripotent, idempotent, and involutive matrices

Let A=c₁A₁+c₂A₂, wherec₁, c₂ are nonzero complex numbers and (A₁,A₂) is a pair of two n×n nonzero matrices. We consider the problem of characterizing all situations where a linear combination of the form A=c₁A₁+c₂A₂ is (i) a tripotent or an involutive matrix when are commuting involutive or commuting tripotent matrices, respectively, (ii) an idempotent matrix when are involutive matrices, and (iii) an involutive matrix when are involutive or idempotent matrices.     

Characterizations of multivariate normality II. Through linear regressions

It is established that a vector (X′₁, X′₂, …, X′_k) has a multivariate normal distribution if (i) for each X_i the regression on the rest is linear, (ii) the conditional distribution of X₁ about the regression does not depend on the rest of the variables, and (iii) the conditional distribution of X₂ about the regression does not depend on the rest of the variables, provided that the regression coefficients satisfy some more conditions that those given by [4]J. Multivar. Anal. 6 81–94].     

Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs

A graph H is called a supersubdivison of a graph G if H is obtained from G by replacing every edge uv of G by a complete bipartite graph K_2,m (m may vary for each edge) by identifying u and v with the two vertices in K_2,m that form one of the two partite sets. We denote the set of all such supersubdivision graphs by SS(G). Then, we prove the following results.

1. Each non-trivial connected graph G and each supersubdivision graph HSS(G) admits an α-valuation. Consequently, due to the results of Rosa (in: Theory of Graphs, International Symposium, Rome, July 1966, Gordon and Breach, New York, Dunod, Paris, 1967, p. 349) and El-Zanati and Vanden Eynden (J. Combin. Designs 4 (1996) 51), it follows that complete graphs K_2cq+1 and complete bipartite graphs K_mq,nq can be decomposed into edge disjoined copies of HSS(G), for all positive integers m,n and c, where q=|E(H)|.

2. Each connected graph G and each supersubdivision graph in SS(G) is strongly n-elegant, where n=|V(G)| and felicitous.

3. Each supersubdivision graph in EASS(G), the set of all even arbitrary supersubdivision graphs of any graph G, is cordial.

Further, we discuss a related open problem.