Search results for "combinatoric"
showing 10 items of 1776 documents
Pairwise Markov properties for regression graphs
2016
With a sequence of regressions, one may generate joint probability distributions. One starts with a joint, marginal distribution of context variables having possibly a concentration graph structure and continues with an ordered sequence of conditional distributions, named regressions in joint responses. The involved random variables may be discrete, continuous or of both types. Such a generating process specifies for each response a conditioning set that contains just its regressor variables, and it leads to at least one valid ordering of all nodes in the corresponding regression graph that has three types of edge: one for undirected dependences among context variables, another for undirect…
Uniform ergodicity of the iterated conditional SMC and geometric ergodicity of particle Gibbs samplers
2018
We establish quantitative bounds for rates of convergence and asymptotic variances for iterated conditional sequential Monte Carlo (i-cSMC) Markov chains and associated particle Gibbs samplers. Our main findings are that the essential boundedness of potential functions associated with the i-cSMC algorithm provide necessary and sufficient conditions for the uniform ergodicity of the i-cSMC Markov chain, as well as quantitative bounds on its (uniformly geometric) rate of convergence. Furthermore, we show that the i-cSMC Markov chain cannot even be geometrically ergodic if this essential boundedness does not hold in many applications of interest. Our sufficiency and quantitative bounds rely on…
Affine-invariant rank tests for multivariate independence in independent component models
2016
We consider the problem of testing for multivariate independence in independent component (IC) models. Under a symmetry assumption, we develop parametric and nonparametric (signed-rank) tests. Unlike in independent component analysis (ICA), we allow for the singular cases involving more than one Gaussian independent component. The proposed rank tests are based on componentwise signed ranks, à la Puri and Sen. Unlike the Puri and Sen tests, however, our tests (i) are affine-invariant and (ii) are, for adequately chosen scores, locally and asymptotically optimal (in the Le Cam sense) at prespecified densities. Asymptotic local powers and asymptotic relative efficiencies with respect to Wilks’…
On (n-l)-wise and joint independence and normality of n Random variables: an example
1981
An example is given of a vector of n random variables such that any (n-1)-dimensional subvector consists of n-1 independent standard normal variables. The whole vector however is neither independent nor normal.
The Concept of Duality and Applications to Markov Processes Arising in Neutral Population Genetics Models
1999
One possible and widely used definition of the duality of Markov processes employs functions H relating one process to another in a certain way. For given processes X and Y the space U of all such functions H, called the duality space of X and Y, is studied in this paper. The algebraic structure of U is closely related to the eigenvalues and eigenvectors of the transition matrices of X and Y. Often as for example in physics (interacting particle systems) and in biology (population genetics models) dual processes arise naturally by looking forwards and backwards in time. In particular, time-reversible Markov processes are self-dual. In this paper, results on the duality space are presented f…
On the empirical spectral distribution for certain models related to sample covariance matrices with different correlations
2021
Given [Formula: see text], we study two classes of large random matrices of the form [Formula: see text] where for every [Formula: see text], [Formula: see text] are iid copies of a random variable [Formula: see text], [Formula: see text], [Formula: see text] are two (not necessarily independent) sets of independent random vectors having different covariance matrices and generating well concentrated bilinear forms. We consider two main asymptotic regimes as [Formula: see text]: a standard one, where [Formula: see text], and a slightly modified one, where [Formula: see text] and [Formula: see text] while [Formula: see text] for some [Formula: see text]. Assuming that vectors [Formula: see t…
Statistical mechanics characterization of spatio-compositional inhomogeneity
2009
On the basis of a model system of pillars built of unit cubes, a two-component entropic measure for the multiscale analysis of spatio-compositional inhomogeneity is proposed. It quantifies the statistical dissimilarity per cell of the actual configurational macrostate and the theoretical reference one that maximizes entropy. Two kinds of disorder compete: i) the spatial one connected with possible positions of pillars inside a cell (the first component of the measure), ii) the compositional one linked to compositions of each local sum of their integer heights into a number of pillars occupying the cell (the second component). As both the number of pillars and sum of their heights are conser…
Affine equivariant multivariate rank methods
2003
The classical multivariate statistical methods (MANOVA, principal component analysis, multivariate multiple regression, canonical correlation, factor analysis, etc.) assume that the data come from a multivariate normal distribution and the derivations are based on the sample covariance matrix. The conventional sample covariance matrix and consequently the standard multivariate techniques based on it are, however, highly sensitive to outlying observations. In the paper a new, more robust and highly efficient, approach based on an affine equivariant rank covariance matrix is proposed and outlined. Affine equivariant multivariate rank concept is based on the multivariate Oja (Statist. Probab. …
Grover Search with Lackadaisical Quantum Walks
2015
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we investigate its effects on Grover's algorithm when formulated as search for a marked vertex on the complete graph of $N$ vertices. For the discrete-time quantum walk using the phase flip coin, adding a self-loop to each vertex boosts the success probability from 1/2 to 1. Additional self-loops, however, decrease the success probability. Using instead the Ambainis, Kempe, and Rivosh (2005) coin, adding self-loops simply slows down the search. These coins also diffe…
Quantum Walk Search on Johnson Graphs
2016
The Johnson graph $J(n,k)$ is defined by $n$ symbols, where vertices are $k$-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, $J(n,1)$ is the complete graph $K_n$, and $J(n,2)$ is the strongly regular triangular graph $T_n$, both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that $J(n,3)$, which is the $n$-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dynamics. This method can also be applied to general Johnson graphs $J(n,k)$ with fixed $k$.