Search results for "Matrix"
showing 10 items of 3205 documents
An autoregressive approach to spatio-temporal disease mapping
2007
Disease mapping has been a very active research field during recent years. Nevertheless, time trends in risks have been ignored in most of these studies, yet they can provide information with a very high epidemiological value. Lately, several spatio-temporal models have been proposed, either based on a parametric description of time trends, on independent risk estimates for every period, or on the definition of the joint covariance matrix for all the periods as a Kronecker product of matrices. The following paper offers an autoregressive approach to spatio-temporal disease mapping by fusing ideas from autoregressive time series in order to link information in time and by spatial modelling t…
Estimates of Regression Coefficients Based on the Sign Covariance Matrix
2002
SummaryA new estimator of the regression parameters is introduced in a multivariate multiple-regression model in which both the vector of explanatory variables and the vector of response variables are assumed to be random. The affine equivariant estimate matrix is constructed using the sign covariance matrix (SCM) where the sign concept is based on Oja's criterion function. The influence function and asymptotic theory are developed to consider robustness and limiting efficiencies of the SCM regression estimate. The estimate is shown to be consistent with a limiting multinormal distribution. The influence function, as a function of the length of the contamination vector, is shown to be linea…
Can the Adaptive Metropolis Algorithm Collapse Without the Covariance Lower Bound?
2011
The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that is, the sample covariance matrix of the history of the chain plus a (small) constant $\epsilon>0$ multiple of the identity matrix $I$. The lower bound on the eigenvalues of $S_n$ induced by the factor $\epsilon I$ is theoretically convenient, but practically cumbersome, as a good value for the parameter $\epsilon$ may not always be easy to choose. This article considers variants of the AM algorithm that do not explicitly bound the eigenvalues of $S_n$ away …
Tridiagonality, supersymmetry and non self-adjoint Hamiltonians
2019
In this paper we consider some aspects of tridiagonal, non self-adjoint, Hamiltonians and of their supersymmetric counterparts. In particular, the problem of factorization is discussed, and it is shown how the analysis of the eigenstates of these Hamiltonians produce interesting recursion formulas giving rise to biorthogonal families of vectors. Some examples are proposed, and a connection with bi-squeezed states is analyzed.
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…