The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices.
Ontology highlight
ABSTRACT:
SUBMITTER: Wang D
PROVIDER: S-EPMC5519689 | biostudies-other | 2017
REPOSITORIES: biostudies-other
Similar Datasets
Project description:A recently developed lower bound theory for Coulombic problems (E. Pollak, R. Martinazzo, J. Chem. Theory Comput. 2021, 17, 1535) is further developed and applied to the highly accurate calculation of the ground-state energy of two- (He, Li+, and H-) and three- (Li) electron atoms. The method has been implemented with explicitly correlated many-particle basis sets of Gaussian type, on the basis of the highly accurate (Ritz) upper bounds they can provide with relatively small numbers of functions. The use of explicitly correlated Gaussians is developed further for computing the variances, and the necessary modifications are here discussed. The computed lower bounds are of submilli-Hartree (parts per million relative) precision and for Li represent the best lower bounds ever obtained. Although not yet as accurate as the corresponding (Ritz) upper bounds, the computed bounds are orders of magnitude tighter than those obtained with other lower bound methods, thereby demonstrating that the proposed method is viable for lower bound calculations in quantum chemistry applications. Among several aspects, the optimization of the wave function is shown to play a key role for both the optimal solution of the lower bound problem and the internal check of the theory.
| S-EPMC8796283 | biostudies-literature
Project description:BackgroundSufficient-cause interaction is a type of interaction that has received much attention recently. The sufficient component cause model on which the sufficient-cause interaction is based is however a non-identifiable model. Estimating the interaction parameters from the model is mathematically impossible.MethodsIn this paper, I derive bounding formulae for sufficient-cause interactions under the assumption of no redundancy.ResultsTwo real data sets are used to demonstrate the method (R codes provided). The proposed bounds are sharp and sharper than previous bounds.ConclusionsSufficient-cause interactions can be quantified by setting bounds on them.
| S-EPMC5399844 | biostudies-literature
Project description:Situations often arise in which the matrix of independent variables is not of full column rank. That is, there are one or more linear dependencies among the independent variables. This paper covers in detail the situation in which the rank is one less than full column rank and extends this coverage to include cases of even greater rank deficiency. The emphasis is on the row geometry of the solutions based on the normal equations. The author shows geometrically how constrained-regression/generalized-inverses work in this situation to provide a solution in the face of rank deficiency.
| S-EPMC3378569 | biostudies-literature
Project description:Recovering low-rank structures via eigenvector perturbation analysis is a common problem in statistical machine learning, such as in factor analysis, community detection, ranking, matrix completion, among others. While a large variety of bounds are available for average errors between empirical and population statistics of eigenvectors, few results are tight for entrywise analyses, which are critical for a number of problems such as community detection. This paper investigates entrywise behaviors of eigenvectors for a large class of random matrices whose expectations are low-rank, which helps settle the conjecture in Abbe et al. (2014b) that the spectral algorithm achieves exact recovery in the stochastic block model without any trimming or cleaning steps. The key is a first-order approximation of eigenvectors under the ℓ ∞ norm: uk≈Auk*λk*, where {u k } and {uk*} are eigenvectors of a random matrix A and its expectation EA , respectively. The fact that the approximation is both tight and linear in A facilitates sharp comparisons between u k and uk* . In particular, it allows for comparing the signs of u k and uk* even if ‖uk-uk*‖∞ is large. The results are further extended to perturbations of eigenspaces, yielding new ℓ ∞-type bounds for synchronization ( ℤ2 -spiked Wigner model) and noisy matrix completion.
| S-EPMC8046180 | biostudies-literature
Project description:Probe-level microarray data are usually stored in matrices, where the row and column correspond to array and probe, respectively. Scientists routinely summarize each array by a single index as the expression level of each probe-set (gene). We examine the adequacy of a uni-dimensional summary for characterizing the data matrix of each probe-set. To do so, we propose a low-rank matrix model for the probe-level intensities, and develop a useful framework for testing the adequacy of uni-dimensionality against targeted alternatives. This is an interesting statistical problem where inference has to be made based on one data matrix whose entries are not i.i.d. We analyze the asymptotic properties of the proposed test statistics, and use Monte Carlo simulations to assess their small sample performance. Applications of the proposed tests to GeneChip data show that evidence against a uni-dimensional model is often indicative of practically relevant features of a probe-set.
| S-EPMC2876352 | biostudies-literature
Project description:The well-known massively parallel sequencing method is efficient and it can obtain sequence data from multiple individual samples. In order to ensure that sequencing, replication, and oligonucleotide synthesis errors do not result in tags (or barcodes) that are unrecoverable or confused, the tag sequences should be abundant and sufficiently different. Recently, many design methods have been proposed for correcting errors in data using error-correcting codes. The existing tag sets contain small tag sequences, so we used a modified genetic algorithm to improve the lower bound of the tag sets in this study. Compared with previous research, our algorithm is effective for designing sets of DNA tags. Moreover, the GC content determined by existing methods includes an imprecise range. Thus, we improved the GC content determination method to obtain tag sets that control the GC content in a more precise range. Finally, previous studies have only considered perfect self-complementarity. Thus, we considered the crossover between different tags and introduced an improved constraint into the design of tag sets.
| S-EPMC4332859 | biostudies-literature
Project description:Monocytes differentiate into osteoclasts through stimulation of receptor activator of NF-kappaB (RANK). Many downstream effectors of RANK play a positive role in osteoclastogenesis, but their relative importance in osteoclast differentiation is unclear. We report the discovery that activation of a single pathway downstream of RANK is sufficient for osteoclast differentiation. In this regard, introduction of constitutively activated IKKbeta (IKKbeta(SSEE)) but not wild-type IKKbeta into monocytes stimulates differentiation of bona fide osteoclasts in the absence of RANK ligand (RANKL). This phenomenon is independent of upstream signals because IKKbeta(SSEE) induced the development of bone-resorbing osteoclasts from RANK and IKKalpha knockout monocytes and in conditions in which NEMO-IKKbeta association was inhibited. NF-kappaB p100 and p105, but not RelB, were critical mediators of this effect. Inflammatory autocrine signaling by tumor necrosis factor alpha (TNF-alpha) and interleukin 1 (IL-1) were dispensable for the spontaneous osteoclastogenesis driven by IKKbeta(SSEE). More important, adenoviral gene transfer of IKKbeta(SSEE) induced osteoclasts and osteolysis in calvariae and knees of mice. Our data establish the sufficiency of IKKbeta activation for osteolysis and suggest that IKKbeta hyperactivation may play a role in conditions of pathologic bone destruction refractory to RANK/RANKL proximal therapeutic interventions.
| S-EPMC3153134 | biostudies-other
Project description:With the growth of high-throughput proteomic data, in particular time series gene expression data from various perturbations, a general question that has arisen is how to organize inherently heterogenous data into meaningful structures. Since biological systems such as breast cancer tumors respond differently to various treatments, little is known about exactly how these gene regulatory networks (GRNs) operate under different stimuli. Challenges due to the lack of knowledge not only occur in modeling the dynamics of a GRN but also cause bias or uncertainties in identifying parameters or inferring the GRN structure. This paper describes a new algorithm which enables us to estimate bias error due to the effect of perturbations and correctly identify the common graph structure among biased inferred graph structures. To do this, we retrieve common dynamics of the GRN subject to various perturbations. We refer to the task as "repairing" inspired by "image repairing" in computer vision. The method can automatically correctly repair the common graph structure across perturbed GRNs, even without precise information about the effect of the perturbations. We evaluate the method on synthetic data sets and demonstrate an application to the DREAM data sets and discuss its implications to experiment design.
| S-EPMC5154690 | biostudies-literature
Project description:This paper is concerned with the interplay between statistical asymmetry and spectral methods. Suppose we are interested in estimating a rank-1 and symmetric matrix M⋆∈ℝn×n , yet only a randomly perturbed version M is observed. The noise matrix M - M ⋆ is composed of independent (but not necessarily homoscedastic) entries and is, therefore, not symmetric in general. This might arise if, for example, we have two independent samples for each entry of M ⋆ and arrange them in an asymmetric fashion. The aim is to estimate the leading eigenvalue and the leading eigenvector of M ⋆. We demonstrate that the leading eigenvalue of the data matrix M can be O(n) times more accurate (up to some log factor) than its (unadjusted) leading singular value of M in eigenvalue estimation. Moreover, the eigen-decomposition approach is fully adaptive to heteroscedasticity of noise, without the need of any prior knowledge about the noise distributions. In a nutshell, this curious phenomenon arises since the statistical asymmetry automatically mitigates the bias of the eigenvalue approach, thus eliminating the need of careful bias correction. Additionally, we develop appealing non-asymptotic eigenvector perturbation bounds; in particular, we are able to bound the perterbation of any linear function of the leading eigenvector of M (e.g. entrywise eigenvector perturbation). We also provide partial theory for the more general rank-r case. The takeaway message is this: arranging the data samples in an asymmetric manner and performing eigen-decomposition could sometimes be quite beneficial.
| S-EPMC8300484 | biostudies-literature
Project description:Eigenvalues and eigenvectors of covariance matrices are important statistics for multivariate problems in many applications, including quantitative genetics. Estimates of these quantities are subject to different types of bias. This article reviews and extends the existing theory on these biases, considering a balanced one-way classification and restricted maximum-likelihood estimation. Biases are due to the spread of sample roots and arise from ignoring selected principal components when imposing constraints on the parameter space, to ensure positive semidefinite estimates or to estimate covariance matrices of chosen, reduced rank. In addition, it is shown that reduced-rank estimators that consider only the leading eigenvalues and -vectors of the "between-group" covariance matrix may be biased due to selecting the wrong subset of principal components. In a genetic context, with groups representing families, this bias is inverse proportional to the degree of genetic relationship among family members, but is independent of sample size. Theoretical results are supplemented by a simulation study, demonstrating close agreement between predicted and observed bias for large samples. It is emphasized that the rank of the genetic covariance matrix should be chosen sufficiently large to accommodate all important genetic principal components, even though, paradoxically, this may require including a number of components with negligible eigenvalues. A strategy for rank selection in practical analyses is outlined.
| S-EPMC2567364 | biostudies-other