Search results for "Random"

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…

Anderson localization problem: An exact solution for 2-D anisotropic systems

2007

Our previous results [J.Phys.: Condens. Matter 14 (2002) 13777] dealing with the analytical solution of the two-dimensional (2-D) Anderson localization problem due to disorder is generalized for anisotropic systems (two different hopping matrix elements in transverse directions). We discuss the mathematical nature of the metal-insulator phase transition which occurs in the 2-D case, in contrast to the 1-D case, where such a phase transition does not occur. In anisotropic systems two localization lengths arise instead of one length only.

Self-consistent Euclidean-random-matrix theory

2019

Varying-time random effects models for longitudinal data: unmixing and temporal interpolation of remote-sensing data

2008

Remote sensing is a helpful tool for crop monitoring or vegetation-growth estimation at a country or regional scale. However, satellite images generally have to cope with a compromise between the time frequency of observations and their resolution (i.e. pixel size). When concerned with high temporal resolution, we have to work with information on the basis of kilometric pixels, named mixed pixels, that represent aggregated responses of multiple land cover. Disaggreggation or unmixing is then necessary to downscale from the square kilometer to the local dynamic of each theme (crop, wood, meadows, etc.). Assuming the land use is known, that is to say the proportion of each theme within each m…

A nonstationary cylinder-based model describing group dispersal in a fragmented habitat

2014

International audience; A doubly nonstationary cylinder-based model is built to describe the dispersal of a population from a point source. In this model, each cylinder represents a fraction of the population, i.e., a group. Two contexts are considered: The dispersal can occur in a uniform habitat or in a fragmented habitat described by a conditional Boolean model. After the construction of the models, we investigate their properties: the first and second order moments, the probability that the population vanishes, and the distribution of the spatial extent of the population.

On decoupling in Banach spaces

2021

AbstractWe consider decoupling inequalities for random variables taking values in a Banach space X. We restrict the class of distributions that appear as conditional distributions while decoupling and show that each adapted process can be approximated by a Haar-type expansion in which only the pre-specified conditional distributions appear. Moreover, we show that in our framework a progressive enlargement of the underlying filtration does not affect the decoupling properties (in particular, it does not affect the constants involved). As a special case, we deal with one-sided moment inequalities for decoupled dyadic (i.e., Paley–Walsh) martingales and show that Burkholder–Davis–Gundy-type in…

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…

Malliavin smoothness on the Lévy space with Hölder continuous or BV functionals

2020

Abstract We consider Malliavin smoothness of random variables f ( X 1 ) , where X is a pure jump Levy process and the function f is either bounded and Holder continuous or of bounded variation. We show that Malliavin differentiability and fractional differentiability of f ( X 1 ) depend both on the regularity of f and the Blumenthal–Getoor index of the Levy measure.

Random time-changes and asymptotic results for a class of continuous-time Markov chains on integers with alternating rates

2021

We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state probabilities of the random variables of the process. Moreover we study independent random time-changes with the inverse of the stable subordinator, the stable subordinator and the tempered stable subodinator. We also present some asymptotic results in the fashion of large deviations. These results give some generalizations of those presented in Di Crescenzo A., Macci C., Martinucci B. (2014).

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…