On computing the OC and ASN for some Markovian SPRT's
If conditional independence constraints define a family of positive distributions that is log-convex then this family turns out to be a Markov model over an undirected graph. This is proved for the distributions on products of finite sets and for the regular Gaussian ones. As a consequence, the assertion known as Brook factorization theorem, Hammersley–Clifford theorem or Gibbs–Markov equivalence is obtained.
The notion of the counting process is recalled and the idea of the ‘cumulative’ process is presented. While the counting process describes the sequence of events, by the cumulative process we understand a stochastic process which cumulates random increments at random moments. It is described by an intensity of the random (counting) process of these moments and by a distribution of increments. We derive the martingale – compensator decomposition of the process and then we study the estimator of the...
In this work the problem of characterization of the Discrete Fourier Transform (DFT) spectrum of an original complex-valued signal , t=0,1,...,n-1, modulated by random fluctuations of its amplitude and/or phase is investigated. It is assumed that the amplitude and/or phase of the signal at discrete times of observation are distorted by realizations of uncorrelated random variables or randomly permuted sequences of complex numbers. We derive the expected values and bounds on the variances of such...
Asymptotic properties of the Discrete Fourier Transform spectrum of a complex monochromatic oscillation with frequency randomly distorted at the observation times t=0,1,..., n-1 by a series of independent and identically distributed fluctuations is investigated. It is proved that the second moments of the spectrum at the discrete Fourier frequencies converge uniformly to zero as n → ∞ for certain frequency fluctuation distributions. The observed effect occurs even for frequency fluctuations with...