Bernouilli and Gibbs Probabilities of Subgroups of {0, 1} s.
A new point process is proposed which can be viewed either as a Boolean cluster model with two cluster modes or as a -thinned Neyman-Scott cluster process with the retention of the original parent point. Voronoi tessellation generated by such a point process has extremely high coefficients of variation of cell volumes as well as of profile areas and lengths in the planar and line induced tessellations. An approximate numerical model of tessellation characteristics is developed for the case of small...
The necessary and sufficient condition for a function to be Borel measurable (given by Theorem stated below) provides a technique to prove (in Corollary 2) the existence of a Borel measurable map such that holds for each , where denotes Bernoulli sequence of random variables with .
The autoregressive process takes an important part in predicting problems leading to decision making. In practice, we use the least squares method to estimate the parameter θ̃ of the first-order autoregressive process taking values in a real separable Banach space B (ARB(1)), if it satisfies the following relation: . In this paper we study the convergence in distribution of the linear operator for ||θ̃|| > 1 and so we construct inequalities of Bernstein type for this operator.
In this paper, we study particular examples of the intertwining relationQtΛ = ΛPtbetween two Markov semi-groups (Pt, t ≥ 0) defined respectively on (E,ε) and (F,F), via the Markov kernelΛ: (E,ε) → (F,F).
We asymptotically estimate from above the expected Betti numbers of random real hypersurfaces in smooth real projective manifolds. Our upper bounds grow as the square root of the degree of the hypersurfaces as the latter grows to infinity, with a coefficient involving the Kählerian volume of the real locus of the manifold as well as the expected determinant of random real symmetric matrices of given index. In particular, for large dimensions, these coefficients get exponentially small away from...
Logic and Probability, as theories, have been developed quite independently and, with a few exceptions (like Boole's), have largely ignored each other. And nevertheless they share a lot of similarities, as well a considerable common ground. The exploration of the shared concepts and their mathematical treatment and unification is here attempted following the lead of illustrious researchers (Reichenbach, Carnap, Popper, Gaifman, Scott & Krauss, Fenstad, Miller, David Lewis, Stalnaker, Hintikka...
We introduce the function , where and are the pdf and cdf of , respectively. We derive two recurrence formulas for the effective computation of its values. We show that with an algorithm for this function, we can efficiently compute the second-order terms of Bonferroni-type inequalities yielding the upper and lower bounds for the distribution of a max-type binary segmentation statistic in the case of small samples (where asymptotic results do not work), and in general for max-type random variables...