Search results for " rando"
showing 10 items of 498 documents
Recursive estimation of the conditional geometric median in Hilbert spaces
2012
International audience; A recursive estimator of the conditional geometric median in Hilbert spaces is studied. It is based on a stochastic gradient algorithm whose aim is to minimize a weighted L1 criterion and is consequently well adapted for robust online estimation. The weights are controlled by a kernel function and an associated bandwidth. Almost sure convergence and L2 rates of convergence are proved under general conditions on the conditional distribution as well as the sequence of descent steps of the algorithm and the sequence of bandwidths. Asymptotic normality is also proved for the averaged version of the algorithm with an optimal rate of convergence. A simulation study confirm…
Central Limit Theorem for Linear Eigenvalue Statistics for a Tensor Product Version of Sample Covariance Matrices
2017
For $$k,m,n\in {\mathbb {N}}$$ , we consider $$n^k\times n^k$$ random matrices of the form $$\begin{aligned} {\mathcal {M}}_{n,m,k}({\mathbf {y}})=\sum _{\alpha =1}^m\tau _\alpha {Y_\alpha }Y_\alpha ^T,\quad {Y}_\alpha ={\mathbf {y}}_\alpha ^{(1)}\otimes \cdots \otimes {\mathbf {y}}_\alpha ^{(k)}, \end{aligned}$$ where $$\tau _{\alpha }$$ , $$\alpha \in [m]$$ , are real numbers and $${\mathbf {y}}_\alpha ^{(j)}$$ , $$\alpha \in [m]$$ , $$j\in [k]$$ , are i.i.d. copies of a normalized isotropic random vector $${\mathbf {y}}\in {\mathbb {R}}^n$$ . For every fixed $$k\ge 1$$ , if the Normalized Counting Measures of $$\{\tau _{\alpha }\}_{\alpha }$$ converge weakly as $$m,n\rightarrow \infty $$…
Fractional calculus approach to the statistical characterization of random variables and vectors
2009
Fractional moments have been investigated by many authors to represent the density of univariate and bivariate random variables in different contexts. Fractional moments are indeed important when the density of the random variable has inverse power-law tails and, consequently, it lacks integer order moments. In this paper, starting from the Mellin transform of the characteristic function and by fractional calculus method we present a new perspective on the statistics of random variables. Introducing the class of complex moments, that include both integer and fractional moments, we show that every random variable can be represented within this approach, even if its integer moments diverge. A…
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.
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…
Variable Length Memory Chains: Characterization of stationary probability measures
2021
Variable Length Memory Chains (VLMC), which are generalizations of finite order Markov chains, turn out to be an essential tool to modelize random sequences in many domains, as well as an interesting object in contemporary probability theory. The question of the existence of stationary probability measures leads us to introduce a key combinatorial structure for words produced by a VLMC: the Longest Internal Suffix. This notion allows us to state a necessary and sufficient condition for a general VLMC to admit a unique invariant probability measure. This condition turns out to get a much simpler form for a subclass of VLMC: the stable VLMC. This natural subclass, unlike the general case, enj…
On almost sure convergence of amarts and martingales without the Radon-Nikodym property
1988
It is shown here that for any Banach spaceE-valued amart (X n) of classB, almost sure convergence off(Xn) tof(X) for eachf in a total subset ofE * implies scalar convergence toX.
Modelling residuals dependence in dynamic life tables: A geostatistical approach
2008
The problem of modelling dynamic mortality tables is considered. In this context, the influence of age on data graduation needs to be properly assessed through a dynamic model, as mortality progresses over the years. After detrending the raw data, the residuals dependence structure is analysed, by considering them as a realisation of a homogeneous Gaussian random field defined on R × R. This setting allows for the implementation of geostatistical techniques for the estimation of the dependence and further interpolation in the domain of interest. In particular, a complex form of interaction between age and time is considered, by taking into account a zonally anisotropic component embedded in…
Random walk networks
2004
Abstract Random Boolean networks are among the best-known systems used to model genetic networks. They show an on–off dynamics and it is easy to obtain analytical results with them. Unfortunately very few genes are strictly on–off switched. On the other hand, continuous methods are in principle more suitable to capture the real behavior of the genome, but have difficulties when trying to obtain analytical results. In this work, we introduce a new model of random discrete network: random walk networks, where the state of each gene is changed by small discrete variations, being thus a natural bridge between discrete and continuous models.
Trapping of Continuous-Time Quantum walks on Erdos-Renyi graphs
2011
We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erd\"{o}s-R\'{e}ny graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of dilution, the survival probability typically decays exponentially with a (average) decay rate which depends non monotonically on the graph connectivity; when the degree of dilution is either very low or very high, stationary states, not affected by traps, get more likely giving rise to a survival probability decaying to a finite value. Both these features constitute a qualitative difference with re…