Extensions of system signatures to dependent lifetimes: Explicit expressions and interpretations

The concept of system signature was introduced by Samaniego for systems whose components have i.i.d. lifetimes. We consider its extension to the continuous dependent case and give an explicit expression for this extension as a difference of weighted means of the structure function values. We then derive a formula for the computation of the coefficients of these weighted means in the special case of independent continuous lifetimes. Finally, we interpret this extended concept of signature through a natural least squares approximation problem.     

Reliability and expectation bounds for coherent systems with exchangeable components

Sharp upper and lower bounds are obtained for the reliability functions and the expectations of lifetimes of coherent systems based on dependent exchangeable absolutely continuous components with a given marginal distribution function, by use of the concept of Samaniego's signature. We first show that the distribution of any coherent system based on exchangeable components with absolutely continuous joint distribution is a convex combination of distributions of order statistics (equivalent to the k-out-of-n systems) with the weights identical with the values of the Samaniego signature of the system. This extends the Samaniego representation valid for the case of independent and identically distributed components. Combining the representation with optimal bounds on linear combinations of distribution functions of order statistics from dependent identically distributed samples, we derive the corresponding reliability and expectation bounds, dependent on the signature of the system and marginal distribution of dependent components. We also present the sequences of exchangeable absolutely continuous joint distributions of components which attain the bounds in limit. As an application, we obtain the reliability bounds for all the coherent systems with three and four exchangeable components, expressed in terms of the parent marginal reliability function and specify the respective expectation bounds for exchangeable exponential components, comparing them with the lifetime expectations of systems with independent and identically distributed exponential components.     

Finite axiomatizability in ?ukasiewicz logic

We classify every finitely axiomatizable theory in infinite-valued propositional ?ukasiewicz logic by an abstract simplicial complex (V,Σ) equipped with a weight function ω:V→{1,2,…}. Using the W?odarczyk–Morelli solution of the weak Oda conjecture for toric varieties, we then construct a Turing computable one–one correspondence between (Alexander) equivalence classes of weighted abstract simplicial complexes, and equivalence classes of finitely axiomatizable theories, two theories being equivalent if their Lindenbaum algebras are isomorphic. We discuss the relationship between our classification and Markov’s undecidability theorem for PL-homeomorphism of rational polyhedra.     

Functional central limit theorems for self-normalized least squares processes in regression with possibly infinite variance data

Based on an R²-valued random sample {(y_i,x_i),1≤i≤n} on the simple linear regression model y_i=x_iβ+α+ε_i with unknown error variables ε_i, least squares processes (LSPs) are introduced in D[0,1] for the unknown slope β and intercept α, as well as for the unknown β when α=0. These LSPs contain, in both cases, the classical least squares estimators (LSEs) for these parameters. It is assumed throughout that {(x,ε),(x_i,ε_i),i≥1} are i.i.d. random vectors with independent components x and ε that both belong to the domain of attraction of the normal law, possibly both with infinite variances. Functional central limit theorems (FCLTs) are established for self-normalized type versions of the vector of the introduced LSPs for (β,α), as well as for their various marginal counterparts for each of the LSPs alone, respectively via uniform Euclidean norm and sup–norm approximations in probability. As consequences of the obtained FCLTs, joint and marginal central limit theorems (CLTs) are also discussed for Studentized and self-normalized type LSEs for the slope and intercept. Our FCLTs and CLTs provide a source for completely data-based asymptotic confidence intervals for β and α.     

Parameter estimation for first-order bifurcating autoregressive processes with Weibull innovations

We study the first-order bifurcating autoregressive process X_t=?X_⌊t/2⌋+?_t with Weibull innovations. Using point process technique, we estimate the model parameter ? and the tail index α in the Weibull distribution and obtain the joint limit distribution of estimators.     

Multi-state Systems with Graduate Failure and Equal Transition Intensities

We consider unrecoverable homogeneous multi-state systems with graduate failures, where each component can work at M + 1 linearly ordered levels of performance. The underlying process of failure for each component is a homogeneous Markov process such that the level of performance of one component can change only for one level lower than the observed one, and the failures are independent for different components. We derive the probability distribution of the random vector X, representing the state of the system at the moment of failure and use it for testing the hypothesis of equal transition intensities. Under the assumption that these intensities are equal, we derive the method of moments estimators for probabilities of failure in a given state vector and the intensity of failure. At the end we calculate the reliability function for such systems. Received: May 18, 2007., Revised: July 8, 2008., Accepted: September 29, 2008.     

Analytic and numerical analysis of some statistical features of fragmentation processes

In this work, we investigate the following inhomogeneous model of fragmentation with an exponential splitting probability: suppose that an initial particle having a mass x₀>0 (large enough) is broken, with a size-dependent probability , into b>1 pieces. With probability 1−p(x₀), this fragment is left unchanged for ever. The process of fragmentation is repeated recursively for all pieces.Some statistical features are studied, chiefly the fragment size distribution, number of fragments and partition function of the random fragmentation tree. Also, we give details of the numerical analysis of these features.     

A new test for sphericity of the covariance matrix for high dimensional data

In this paper we propose a new test procedure for sphericity of the covariance matrix when the dimensionality, p, exceeds that of the sample size, N=n+1. Under the assumptions that (A) as p→∞ for i=1,…,16 and (B) p/n→c<∞ known as the concentration, a new statistic is developed utilizing the ratio of the fourth and second arithmetic means of the eigenvalues of the sample covariance matrix. The newly defined test has many desirable general asymptotic properties, such as normality and consistency when (n,p)→∞. Our simulation results show that the new test is comparable to, and in some cases more powerful than, the tests for sphericity in the current literature.     

Nonvanishing of Kronecker coefficients for rectangular shapes

We prove that for any partition (λ₁,…,λd²) of size ?d there exists k?1 such that the tensor square of the irreducible representation of the symmetric group Sk?d with respect to the rectangular partition (k?,…,k?) contains the irreducible representation corresponding to the stretched partition (kλ₁,…,kλd²). We also prove a related approximate version of this statement in which the stretching factor k is effectively bounded in terms of d. We further discuss the consequences for geometric complexity theory which provided the motivation for this work.     

多状态可靠性系统动态signature及其剩余寿命分析

系统signature是分析系统可靠性的一个强有力的工具。本文研究了多状态系统的动态signature。Signature概念被拓展到多维的情形,并将其应用于两状态元件下多态关联系统的分析,得到系统在每一状态下的联合生存函数的表达式,探究了系统在时刻的动态signature,为处于工作状态的多状态系统在时刻t接受检查,发现其处于l(t)状态并且恰好已发生了q(t)次元件失效,分别给出了两状态元件多态关联系统动态signature及其剩余寿命的表达式。     

Tail order and intermediate tail dependence of multivariate copulas

In order to study copula families that have tail patterns and tail asymmetry different from multivariate Gaussian and t copulas, we introduce the concepts of tail order and tail order functions. These provide an integrated way to study both tail dependence and intermediate tail dependence. Some fundamental properties of tail order and tail order functions are obtained. For the multivariate Archimedean copula, we relate the tail heaviness of a positive random variable to the tail behavior of the Archimedean copula constructed from the Laplace transform of the random variable, and extend the results of Charpentier and Segers [7] [A. Charpentier, J. Segers, Tails of multivariate Archimedean copulas, Journal of Multivariate Analysis 100 (7) (2009) 1521–1537] for upper tails of Archimedean copulas. In addition, a new one-parameter Archimedean copula family based on the Laplace transform of the inverse Gamma distribution is proposed; it possesses patterns of upper and lower tails not seen in commonly used copula families. Finally, tail orders are studied for copulas constructed from mixtures of max-infinitely divisible copulas.     

How Many Ways Can One Draw A Graph?

Using results from extremal graph theory, we determine the asymptotic number of string graphs with n vertices, i.e., graphs that can be obtained as the intersection graph of a system of continuous arcs in the plane. The number becomes much smaller, for any fixed d, if we restrict our attention to systems of arcs, any two of which cross at most d times. As an application, we estimate the number of different drawings of the complete graph K_n with n vertices under various side conditions. Dedicated to Miklós Simonovits on his sixtieth birthday * Supported by NSF grant CR-00-98246, PSC-CUNY Research Award 62450-0031 and OTKA-T-032452. † Supported by OTKA-T-032452 and OTKA-T-038397.     

Order restricted inference for sequential k-out-of-n systems

Sequential order statistics have been introduced to model sequential k-out-of-n systems which, as an extension of k-out-of-n systems, allow the failure of some components of the system to influence the remaining ones. Based on an independent sample of vectors of sequential order statistics, the maximum likelihood estimators of the model parameters of a sequential k-out-of-n system are derived under order restrictions. Special attention is paid to the simultaneous maximum likelihood estimation of the model parameters and the distribution parameters for a flexible location-scale family. Furthermore, order restricted hypothesis tests are considered for making the decision whether the usual k-out-of-n model or the general sequential k-out-of-n model is appropriate for a given data.     

失效单调关联系统中可存活元件的剩余寿命的混合表示

本文中研究的是由$n$个独立同分布元件构成的单调关联系统,当该单调关联系统失效时得到了系统中可存活元件的剩余寿命的可靠性函数的混合表示.基于signature的概念,对两个系统的剩余寿命进行了随机比较.     

On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification

Let be identically distributed random vectors in R^d, independently drawn according to some probability density. An observation is said to be a layered nearest neighbour (LNN) of a point if the hyperrectangle defined by and contains no other data points. We first establish consistency results on , the number of LNN of . Then, given a sample of independent identically distributed random vectors from R^d×R, one may estimate the regression function by the LNN estimate , defined as an average over the Y_i’s corresponding to those which are LNN of . Under mild conditions on r, we establish the consistency of towards 0 as n→∞, for almost all and all p≥1, and discuss the links between r_n and the random forest estimates of Breiman (2001) [8]. We finally show the universal consistency of the bagged (bootstrap-aggregated) nearest neighbour method for regression and classification.     

Triangular Matrix Representations

In this paper we develop the theory of generalized triangular matrix representation in an abstract setting. This is accomplished by introducing the concept of a set of left triangulating idempotents. These idempotents determine a generalized triangular matrix representation for an algebra. The existence of a set of left triangulating idempotents does not depend on any specific conditions on the algebras; however, if the algebra satisfies a mild finiteness condition, then such a set can be refined to a “complete” set of left triangulating idempotents in which each “diagonal” subalgebra has no nontrivial generalized triangular matrix representation. We then apply our theory to obtain new results on generalized triangular matrix representations, including extensions of several well known results.     

Joint distributions of numbers of occurrences of a discrete pattern and weak convergence of an empirical process for the pattern

For a {0, 1}-pattern of finite length, an empirical process is introduced in order to describe the number of overlapping occurrences of the pattern at each level t[0,1] in a sequence of the corresponding indicators of i.i.d. [0, 1]-valued observations of length n. A method for obtaining the exact finite-dimensional distributions of the empirical process is given. The weak convergence of the process to a Gaussian process in D[0,1] as n tends to infinity is also established. The limiting process depends on the given pattern. The exact covariance function is compared with the asymptotic covariance function in a numerical example.     

The representation dimension of Hecke algebras and symmetric groups

We establish a lower bound for the representation dimension of all the classical Hecke algebras of types A, B and D. For all the type A algebras, and “most” of the algebras of types B and D, we also establish upper bounds. Moreover, we establish bounds for the representation dimension of group algebras of some symmetric groups.     

Addendum to “An extension of an inequality of Hoeffding to unbounded random variables”: The non-i.i.d. case

Let S _n = X ₁ + ⋯ + X _n be a sum of independent random variables such that 0 ⩽ X _k ⩽ 1 for all k. Write {ie237-01} and q = 1 − p. Let 0 < t < q. In our recent paper [3], we extended the inequality of Hoeffding ([6], Theorem 1) {fx237-01} to the case where X _k are unbounded positive random variables. It was assumed that the means {ie237-02} of individual summands are known. In this addendum, we prove that the inequality still holds if only an upper bound for the mean {ie237-03} is known and that the i.i.d. case where {ie237-04} dominates the general non-i.i.d. case. Furthermore, we provide upper bounds expressed in terms of certain compound Poisson distributions. Such bounds can be more convenient in applications. Our inequalities reduce to the related Hoeffding inequalities if 0 ⩽ X _k ⩽ 1. Our conditions are X _k ⩾ 0 and {ie237-05}. In particular, X _k can have fat tails. We provide as well improvements comparable with the inequalities in Bentkus [2]. The independence of X _k can be replaced by super-martingale type assumptions. Our methods can be extended to prove counterparts of other inequalities in Hoeffding [6] and Bentkus The research was partially supported by the Lithuanian State Science and Studies Foundation, grant No T-25/08.