Trous spectraux pour certains algorithmes de Metropolis sur
In this note we describe recent results on semiclassical random walk associated to a probability density which may also concentrate as the semiclassical parameter goes to zero. The main result gives a spectral asymptotics of the close to eigenvalues. This problem was studied in [1] and relies on a general factorization result for pseudo-differential operators. In this note we just sketch the proof of this second theorem. At the end of the note, using the factorization, we give a new proof of the...
Methods based on the theory of Markov chains are most commonly used in the recognition of protein coding sequences. However, they require big learning sets to fill up all elements in transition probability matrices describing dependence between nucleotides in the analyzed sequences. Moreover, gene prediction is strongly influenced by the nucleotide bias measured by e.g. G+C content. In this paper we compare two methods: (i) the classical GeneMark algorithm, which uses a three-periodic non-homogeneous...
A properly measurable set (where are Polish spaces and is the space of Borel probability measures on ) is considered. Given a probability distribution the paper treats the problem of the existence of -valued random vector for which and -almost surely that possesses moreover some other properties such as “ has the maximal possible support” or “’s are extremal...
Given a Hilbert space valued martingale (Mₙ), let (M*ₙ) and (Sₙ(M)) denote its maximal function and square function, respectively. We prove that 𝔼|Mₙ| ≤ 2𝔼 Sₙ(M), n=0,1,2,..., 𝔼 M*ₙ ≤ 𝔼 |Mₙ| + 2𝔼 Sₙ(M), n=0,1,2,.... The first inequality is sharp, and it is strict in all nontrivial cases.
Let G be a group acting on Ω and ℱ a G-invariant algebra of subsets of Ω. A full conditional probability on ℱ is a function P: ℱ × (ℱ∖{∅}) → [0,1] satisfying the obvious axioms (with only finite additivity). It is weakly G-invariant provided that P(gA|gB) = P(A|B) for all g ∈ G and A,B ∈ ℱ, and strongly G-invariant provided that P(gA|B) = P(A|B) whenever g ∈ G and A ∪ gA ⊆ B. Armstrong (1989) claimed that weak and strong invariance are equivalent, but we shall show that this is false and that weak...
Let us consider two independent renewal processes generated by appropriate sequences of life times. We say that a renewal time is accepted if in the time between a signal and the preceding one, some signal of the second process occurs. Our purpose is to analyze the sequences of accepted renewals. For simplicity we consider continuous and discrete time separately. In the first case we mainly consider the renewal process rarefied by the Poisson process, in the second we analyze the process generated...