Iterative Approximation of Statistical Distributions and Relation to Information Geometry

The optimal control of stochastic processes through sensor estimation of probability density functions is given a geometric setting via information theory and the information metric. Information theory identifies the exponential distribution as the maximum entropy distribution if only the mean is known and the Γ distribution if also the mean logarithm is known. The surface representing Γ models has a natural Riemannian information metric. The exponential distributions form a one-dimensional subspace of the two-dimensional space of all Γ distributions, so we have an isometric embedding of the random model as a subspace of the Γ models. This geometry provides an appropriate structure on which to represent the dynamics of a process and algorithms to control it. This short paper presents a comparative study on the parameter estimation performance between the geodesic equation and the B-spline function approximations when they are used to optimize the parameters of the Γ family distributions. In this case, the B-spline functions are first used to approximate the Γ probability density function on a fixed length interval; then the coefficients of the approximation are related, through mean and variance calculations, to the two parameters (i.e. μ and β) in Γ distributions. A gradient based parameter tuning method has been used to produce the trajectories for (μ, β) when B-spline functions are used, and desired results have been obtained which are comparable to the trajectories obtained from the geodesic equation. This revised version was published online in August 2006 with corrections to the Cover Date.     

On Approximation for Certain Operators

ＯｎＡｐｐｒｏｘｉｍａｔｉｏｎｆｏｒＣｅｒｔａｉｎＯｐｅｒａｔｏｒｓ￥（郭顺生）ＧｕｏＳｈｕｎｓｈｅｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＨｅｂｅｉＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｓｈｉｊｉａｚｈｕａｎｇ，０５００１６）Ａｂｓｔｒａ...     

On the Local Distance between Arithmetical Distributions

We obtain upper and lower bounds for the local distance ρ(v _x , P _x ). Here v _x is the distribution of a set of strongly additive functions f _x with respect to the usual frequency on the set of positive integers, and P _x is the distribution of the sum of suitably chosen independent random variables. We only consider the case where f _x (p) ∈ {0, 1} for all primes p. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 603–610, October–December, 2005.     

On Characterization of Best Approximation with Certain Constraints

SupposeKis the intersection of a finite number of closed half-spaces {K_i} in a Hilbert spaceX, andx∈X\K. Dykstra's cyclic projections algorithm is a known method to determine an approximate solution of the best approximation ofxfromK, which is denoted byP_K(x). Dykstra's algorithm reduces the problem to an iterative scheme which involves computing the best approximation from the individualK_i. It is known that the sequence {x_j} generated by Dykstra's method converges to the best approximationP_K(x). But since it is difficult to find the definite value of an upper bound of the error ‖x_j−P_K(x)‖, the applicability of the algorithm is restrictive. This paper introduces a new method, called thesuccessive approximate algorithm, by which one can generate a finite sequencex₀, x₁, …, x_kwithx_k=P_K(x). In addition, the error ‖x_j−P_K(x)‖ is monotone decreasing and has a definite upper bound easily to be determined. So the new algorithm is very applicable in practice.     

On Clustering Bodies: Geometry and Polyhedral Approximation

The present paper studies certain classes of closed convex sets in finite-dimensional real spaces that are motivated by their application to convex maximization problems, most notably, those evolving from geometric clustering. While these optimization problems are ℕℙ-hard in general, polynomial-time approximation algorithms can be devised whenever appropriate polyhedral approximations of their related clustering bodies are available. Here we give various structural results that lead to tight approximations.     

On the Distance Distributions of BCH Codes and Their Duals

Based on new bounds on the values of Krawtchoukpolynomials, we improve earlier known estimates forcomponents of the distance distributions of BCH codes and theirduals. Moreover, we show that if one uses estimates on Krawtchoukpolynomials for bounding the error term in the binomial approximationto the distance distribution of BCH codes, the given results are actuallythe best possible. One of the advantages of the proposed approach isthat it provides estimates with no restrictions on the minimumdistance of the code.     

On Distance Laplacian Spectra of Certain Finite Groups

Acta Mathematica Sinica, English Series - For a finite group G, the power graph $$\cal{P}(G)$$ is a simple connected graph whose vertex set is the set of elements of G and two distinct vertices x...     

Bootstrap Approximation of Distributions of the L-Statistics

We study consistency conditions of the bootstrap approximation for linear combinations of order statistics with coefficients determined by a weight function. Bibliography: 10 titles.     

Approximation of Distributions by Bounded Sets

Let P be a probability distribution on a locally compact separable metric space (S,d). We study the following problem of approximation of a distribution P by a set A from a given class $\mathcal{A}\subset2^{S}$ : $$W(A,P)\equiv\int_{S}\varphi(d(x,A))P(dx)\to\min_{A\in\mathcal{A}},$$ where φ is a nondecreasing function. A special case where $\mathcal{A}$ consists of unions of bounded sets, $\mathcal{A}=\{\bigcup_{i=1}^{k}A_{i}:\Delta(A_{i})\leq K,\ i=1,\ldots,k\}$ , is considered in detail. We give sufficient conditions for the existence of an optimal approximative set and for the convergence of the sequence of optimal sets A _n found for measures P _n which satisfy P _n ? P. Current article is a follow-up to Käärik and Pärna (Acta Appl. Math. 78, 175–183, 2003; Acta Comment. Univ. Tartu. 8, 101–112, 2004) where the case of parametric sets was studied.     

Approximation of Distributions by Parametric Sets

Let P be a probability distribution on a separable metric space (S,d). We study the following problem of approximation of a distribution P by a set from a given class A2 ^S : W(A,P) _S (d(x,A))P(dx)min _AA , where is a nondecreasing function. A special case where A is a parametric class A={A():T} is considered in detail. Our main interest is to obtain convergence results for sequences {A ^* _n }, where A ^* _n is an optimal set for a measure P _n satisfying P _n P, as n.     

Greenberg Approximation and the Geometry of Arc Spaces

We study the differential properties of generalized arc schemes and geometric versions of Kolchin's Irreducibility Theorem over arbitrary base fields. As an intermediate step, we prove an approximation result for arcs by algebraic curves.     

On the Lattice Approximation for Certain Generalized Vector Markov Fields in Four Spacetime Dimensions

We extend previous results by Albeverio, Iwata and Schmidt on the construction of a convergent lattice approximation for invariant scalar 3-vector generalized random fields F of an infinitely divisible type and apply them to the construction of convergent lattice approximation for the generalized random vector field A determined by the stochastic quaternionic Cauchy–Riemann equation A = F.     

Eigenvalue Distributions and Geometry of Banach Spaces

We consider the sums Z⁽ⁿ⁾ of i.i.d. random vectors taking values in a d-dimensional Euclidean space. It is assumed that the so-called CRAMER condition holds in a neighbourhood of the origin. We establish lower bounds for the large deviation probabilities P(Z⁽ⁿ⁾ ? A) with A belonging to a large class of sets.     

Approximation of Certain Modified Rational Interpolation in L^pwSpaces

In this paper, the author introduces certain modided integral rational interpolations which are generallzation of T. Herman and P.Vertesi‘s rational interpolation operators and study their degre of approximation in L^pw with w(x)=(1-x^2)^(-1/2) spaces.     

一类广义插值在LM^Ba空间中的逼近

先引入了由一列Orlicz空间生成的Ba空间(LMBa)的定义,然后用分数阶α的连续模给出一类广义插值在LBMa空间中逼近阶.     

一类广义插值在LBaM空间中的逼近

先引入了由一列Orlicz空间生成的Ba空间(LBaM)的定义,然后用分数阶α的连续模给出一类广义插值在LBaM空间中逼近阶.     

Large Scale Geometry of Certain Solvable Groups

In this paper we provide the final steps in the proof of quasi-isometric rigidity of a class of non-nilpotent polycyclic groups. To this end, we prove a rigidity theorem on the boundaries of certain negatively curved homogeneous spaces and combine it with work of Eskin–Fisher–Whyte and Peng on the structure of quasiisometries of certain solvable Lie groups.