Results 291 to 300 of about 561,804 (322)

Asymptotic Exit Time Distributions

SIAM Journal on Applied Mathematics, 1982
Let $x( t )$ be a diffusion resulting from the stochastic perturbation of a deterministic dynamical system by a nondegenerate white noise. Let $\tau $ be the time of first exit of $x( t )$ from a domain on which the deterministic flow has a single simple attracting critical point and is inward at the boundary.
openaire   +2 more sources

ASYMPTOTIC DISTRIBUTION OF EIGENVALUES

Mathematics of the USSR-Izvestiya, 1983
The method of a spectral almost-projection is employed to investigate the asymptotic behavior of the eigenvalue distribution functions of semibounded essentially selfadjoint systems of differential operators in a domain and of pseudodifferential operators on Rn.
openaire   +1 more source

Asymptotic expansions for probability distributions. II

Lithuanian Mathematical Journal, 1983
[For part III see the foregoing review; Zbl 0571.60033.] Let \(\xi\) be a lattice random variable on \(\{\) 0,1,2,...\(\}\) with the probability distribution p(k). It is assumed that the cumulants \(\gamma_{\ell}\) of order \(\ell =1,2,..\). satisfy the conditions: \(\gamma_ 1>0,| \gamma_{\ell}| \leq Hc^{\ell}\ell !/\Delta^{\ell -1}\), \(\ell =2,3,..\).
openaire   +6 more sources

Local Asymptotic Distributions of Stationarity Tests

Journal of Time Series Analysis, 2006
Abstract. In this paper, we study the asymptotic behaviour of several test statistics of the null hypothesis of stationarity under a sequence of local alternatives. The sequence of local alternatives is modelled as a nearly stationary process, i.e. a non‐stationary process in any finite sample which converges to a stationary process asT ↑ ∞.
CAPPUCCIO, NUNZIO, LUBIAN D.
openaire   +3 more sources

S-asymptotic of a distribution

Pliska. Studia Mathematica Bulgarica, 1989
Summary: We give a definition of asymptotic behaviour at infinity of a Schwartz distribution -- the so-called S-asymptotic. Some basic properties of this S-asymptotic are proved and possibilities of its applications are given.
Pilipović, Stevan, Stanković, Bogoljub
openaire   +1 more source

Asymptotically Optimal Distributed Censoring

2006 IEEE International Symposium on Information Theory, 2006
We consider the problem of Bayesian decentralized binary detection in a sensor network in which the sensors have access to some side information that affects the statistics of the measurements they make. Sensors can decide whether or not to make a measurement and transmit a message to the fusion center ("censoring"), and also have a choice of the ...
Wee-peng Tay, John Tsitsiklis, Moe Win
openaire   +1 more source

Asymptotic distributions of pontograms

Mathematical Proceedings of the Cambridge Philosophical Society, 1987
Let{N(x), x ≥ 0} be a Poisson process with intensity parameter λ > 0, and introduceWhen looking for the changepoint in the Land's End data, Kendall and Kendall [7] proved for all 0 < ε1 < 1 − ε2 < 1 thatwhere {V(s), − ∞ < s < ∞} is an Ornstein–Uhlenbeck process with covariance function exp (−|t − s|). D. G.
Csörgö, Miklós, Horváth, Lajos
openaire   +2 more sources

Asymptotically almost periodic distributions

Applicable Analysis, 1989
In this work we extend to the space of Schwartz' distributions the notion of asymptotic almost periodicity of M. Frechet. The main justification for the introduction of this concept is the fact that for certain differential equations in distributions the existence of an asymptotic almost periodic (distribution) solution implies the existence of an ...
openaire   +1 more source

Asymptotic Distributions of Records

2015
Above (see Chap. 3) it was described the asymptotic (as n → ∞) behavior of numbers of records N(n) among random variables X 1 , X 2 ,…. X n . Don’t forget that we suppose that X’s are independent and have the same continuous distribution function F.
Mohammad Ahsanullah, Valery B. Nevzorov
openaire   +1 more source

Asymptotically optimal distributed consensus

1989
The Distributed Consensus problem requires correct processors to reach consensus in the presence of the arbitrary behavior of t faulty processors. In this paper we present a protocol that achieves consensus with n>4t total processors using 2t+2 rounds of communication and messages of size 1.
Piotr Berman, Juan A. Garay
openaire   +1 more source