Search results for "TRIX"
showing 10 items of 3314 documents
A note on adjusted responses, fitted values and residuals in Generalized Linear Models
2014
Adjusted responses, adjusted fitted values and adjusted residuals are known to play in Generalized Linear Models the role played in Linear Models by observations, fitted values and ordinary residuals. We think this parallelism, which was widely recognized and used in the early literature on Generalized Linear Models, has been somewhat overlooked in more recent presentations. We revise this parallelism, systematizing and proving some results that are either scattered or not satisfactorily spelled out in the literature. In particular, we formally derive the asymptotic dispersion matrix of the (scaled) adjusted residuals, by proving that in Generalized Linear Models the fitted values are asym…
Robust estimation and inference for bivariate line-fitting in allometry.
2011
In allometry, bivariate techniques related to principal component analysis are often used in place of linear regression, and primary interest is in making inferences about the slope. We demonstrate that the current inferential methods are not robust to bivariate contamination, and consider four robust alternatives to the current methods -- a novel sandwich estimator approach, using robust covariance matrices derived via an influence function approach, Huber's M-estimator and the fast-and-robust bootstrap. Simulations demonstrate that Huber's M-estimators are highly efficient and robust against bivariate contamination, and when combined with the fast-and-robust bootstrap, we can make accurat…
Thermal form factors of the XXZ chain and the large-distance asymptotics of its temperature dependent correlation functions
2013
We derive expressions for the form factors of the quantum transfer matrix of the spin-1/2 XXZ chain which are suitable for taking the infinite Trotter number limit. These form factors determine the finitely many amplitudes in the leading asymptotics of the finite-temperature correlation functions of the model. We consider form-factor expansions of the longitudinal and transversal two-point functions. Remarkably, the formulae for the amplitudes are in both cases of the same form. We also explain how to adapt our formulae to the description of ground state correlation functions of the finite chain. The usefulness of our novel formulae is demonstrated by working out explicit results in the hig…
The smallest singular value of a shifted $d$-regular random square matrix
2017
We derive a lower bound on the smallest singular value of a random d-regular matrix, that is, the adjacency matrix of a random d-regular directed graph. Specifically, let $$C_1<d< c n/\log ^2 n$$ and let $$\mathcal {M}_{n,d}$$ be the set of all $$n\times n$$ square matrices with 0 / 1 entries, such that each row and each column of every matrix in $$\mathcal {M}_{n,d}$$ has exactly d ones. Let M be a random matrix uniformly distributed on $$\mathcal {M}_{n,d}$$ . Then the smallest singular value $$s_{n} (M)$$ of M is greater than $$n^{-6}$$ with probability at least $$1-C_2\log ^2 d/\sqrt{d}$$ , where c, $$C_1$$ , and $$C_2$$ are absolute positive constants independent of any other parameter…
k-Step shape estimators based on spatial signs and ranks
2010
In this paper, the shape matrix estimators based on spatial sign and rank vectors are considered. The estimators considered here are slight modifications of the estimators introduced in Dümbgen (1998) and Oja and Randles (2004) and further studied for example in Sirkiä et al. (2009). The shape estimators are computed using pairwise differences of the observed data, therefore there is no need to estimate the location center of the data. When the estimator is based on signs, the use of differences also implies that the estimators have the so called independence property if the estimator, that is used as an initial estimator, has it. The influence functions and limiting distributions of the es…
Updating input–output matrices: assessing alternatives through simulation
2009
A problem that frequently arises in economics, demography, statistics, transportation planning and stochastic modelling is how to adjust the entries of a matrix to fulfil row and column aggregation constraints. Biproportional methods in general and the so-called RAS algorithm in particular, have been used for decades to find solutions to this type of problem. Although alternatives exist, the RAS algorithm and its extensions are still the most popular. Apart from some interesting empirical and theoretical properties, tradition, simplicity and very low computational costs are among the reasons behind the great success of RAS. Nowadays computer hardware and software have made alternative proce…
Tests of multinormality based on location vectors and scatter matrices
2007
Classical univariate measures of asymmetry such as Pearson’s (mean-median)/σ or (mean-mode)/σ often measure the standardized distance between two separate location parameters and have been widely used in assessing univariate normality. Similarly, measures of univariate kurtosis are often just ratios of two scale measures. The classical standardized fourth moment and the ratio of the mean deviation to the standard deviation serve as examples. In this paper we consider tests of multinormality which are based on the Mahalanobis distance between two multivariate location vector estimates or on the (matrix) distance between two scatter matrix estimates, respectively. Asymptotic theory is develop…
Adaptive Metropolis algorithm using variational Bayesian adaptive Kalman filter
2013
Markov chain Monte Carlo (MCMC) methods are powerful computational tools for analysis of complex statistical problems. However, their computational efficiency is highly dependent on the chosen proposal distribution, which is generally difficult to find. One way to solve this problem is to use adaptive MCMC algorithms which automatically tune the statistics of a proposal distribution during the MCMC run. A new adaptive MCMC algorithm, called the variational Bayesian adaptive Metropolis (VBAM) algorithm, is developed. The VBAM algorithm updates the proposal covariance matrix using the variational Bayesian adaptive Kalman filter (VB-AKF). A strong law of large numbers for the VBAM algorithm is…
Linear Recursive Equations, Covariance Selection, and Path Analysis
1980
Abstract By defining a reducible zero pattern and by using the concept of multiplicative models, we relate linear recursive equations that have been introduced by econometrician Herman Wold (1954) and path analysis as it was proposed by geneticist Sewall Wright (1923) to the statistical theory of covariance selection formulated by Arthur Dempster (1972). We show that a reducible zero pattern is the condition under which parameters as well as least squares estimates in recursive equations are one-to-one transformations of parameters and of maximum likelihood estimates, respectively, in a decomposable covariance selection model. As a consequence, (a) we can give a closed-form expression for t…
Robustifying principal component analysis with spatial sign vectors
2012
Abstract In this paper, we apply orthogonally equivariant spatial sign covariance matrices as well as their affine equivariant counterparts in principal component analysis. The influence functions and asymptotic covariance matrices of eigenvectors based on robust covariance estimators are derived in order to compare the robustness and efficiency properties. We show in particular that the estimators that use pairwise differences of the observed data have very good efficiency properties, providing practical robust alternatives to classical sample covariance matrix based methods.