The Lempert function of the symmetrized polydisc in higher dimensions is not a distance

We prove that the Lempert function of the symmetrized polydisc in dimension greater than two is not a distance.

     

Estimates of the Carathéodory metric on the symmetrized polydisc

Estimates for the Carathéodory metric on the symmetrized polydisc are obtained. It is also shown that the Carathéodory and Kobayashi distances of the symmetrized three-disc do not coincide.     

A new class of metric divergences on probability spaces and its applicability in statistics

The classI _f β, βε(0, ∞], off-divergences investigated in this paper is defined in terms of a class of entropies introduced by Arimoto (1971,Information and Control,19, 181–194). It contains the squared Hellinger distance (for β=1/2), the sumI(Q ₁‖(Q ₁+Q ₂)/2)+I(Q ₂‖(Q ₁+Q ₂)/2) of Kullback-Leibler divergences (for β=1) and half of the variation distance (for β=∞) and continuously extends the class of squared perimeter-type distances introduced by Österreicher (1996,Kybernetika,32, 389–393) (for βε (1, ∞]). It is shown that\((I_{f_\beta } (Q_1 ,Q_2 ))^{\min (\beta ,1/2)}\) are distances of probability distributionsQ ₁,Q ₂ for β ε (0, ∞). The applicability of\(I_{f_\beta }\)-divergences in statistics is also considered. In particular, it is shown that the\(I_{f_\beta }\)-projections of appropriate empirical distributions to regular families define distribution estimates which are in the case of an i.i.d. sample of size'n consistent. The order of consistency is investigated as well.     

Comparison theorems for hyperbolic type metrics

The connection between several hyperbolic type metrics is studied in subdomains of the Euclidean space. In particular, a new metric is introduced and compared to the distance ratio metric.     

度量空间中有限点集的费马点

本文首先对紧致的度量拓扑空间证明了有限点集的费马点是存在的，其次，运用度量几何的经典方法考察了度量空间（包括双曲空间和Ｂａｎａｃｈ空间）中有限点集的费马点的唯一性，此外，还对ｎ维欧氏空间Ｅ＾ｎ中有限点集的费马作了进一步研究。     

Counterexamples in measuring the distance between binary trees

Examples are given to show that the closest partition distance measure need not agree with the nearest neighbor interchange distance for unordered labeled binary trees. Proposed algorithms for computing the closest partition distance are shown to be of exponential complexity and hence may not be useful in approximating the nearest neighbor interchange distance.     

Entropy differential metric, distance and divergence measures in probability spaces: A unified approach

The paper is devoted to metrization of probability spaces through the introduction of a quadratic differential metric in the parameter space of the probability distributions. For this purpose, a φ-entropy functional is defined on the probability space and its Hessian along a direction of the tangent space of the parameter space is taken as the metric. The distance between two probability distributions is computed as the geodesic distance induced by the metric. The paper also deals with three measures of divergence between probability distributions and their interrelationships.     

On the rate of convergence of the maximum likelihood estimator of a <Emphasis Type="Italic">k</Emphasis>-monotone density

Bounds for the bracketing entropy of the classes of bounded k-monotone functions on [0, A] are obtained under both the Hellinger distance and the L ^p (Q) distance, where 1 ⩽ p < ∞ and Q is a probability measure on [0,A]. The result is then applied to obtain the rate of convergence of the maximum likelihood estimator of a k-monotone density. This work was supported by National Science Foundation of USA (Grant No. DMS-0405855, DMS-0804587)     

The mean value of the squared path-difference distance for rooted phylogenetic trees

The path-difference metric is one of the oldest distances for the comparison of fully resolved phylogenetic trees, but its statistical properties are still quite unknown. In this paper we compute the mean value of the square of the path-difference metric between two fully resolved rooted phylogenetic trees with n leaves, under the uniform distribution. This complements previous work by Steel and Penny, who computed this mean value for fully resolved unrooted phylogenetic trees.     

Boolean Metric Spaces and Boolean Algebraic Varieties

Abstract

The concepts of Boolean metric space and convex combination are used to characterize polynomial maps A ⁿ ?→?A ^m in a class of commutative Von Neumann regular rings including p-rings, that we have called CFG-rings. In those rings, the study of the category of algebraic varieties (i.e., sets of solutions to a finite number of polynomial equations with polynomial maps as morphisms) is equivalent to the study of a class of Boolean metric spaces, that we call here CFG-spaces.     

A generalization of the Lee distance and error correcting codes

In this contribution, we will define an l-dimensional Lee distance which is a generalization of the Lee distance defined only over a prime field, and we will construct 2-error correcting codes for this distance. Our l-dimensional Lee distance can be defined not only over a prime field but also over any finite field. The ordinary Lee distance is just the one-dimensional Lee distance. Also the Mannheim or modular distances introduced by Huber are special cases of our distance.     

A Series Criterion for the Almost-Sure Growth Rate of the Generalized Diameter of an Increasing Sequence of Random Points

Let U ₁, U ₂,... be a sequence of i.i.d. random mappings taking values in a space S and let h be a symmetric function on S×S with global maximum Let {x _n} be any nondecreasing real sequence converging to Then p=P(H _n>x _n, infinitely often) is either zero or one, where H _n=max{h(U _i, U _j), 1 ijn}. This paper provides a nonrandom series criterion which is necessary and sufficient to determine the value of p. In addition, various sufficient conditions are presented which may be easier to apply. A number of metric space applications are given.     

On measures of the distance of a mixture from its parent distribution

In a previous paper in this Journal, Heyde and Leslie [6] examined moment measures of the distance of a mixture from its parent distribution. They confined their attention to the case where the parent distribution is either normal or exponential, and related the moment measures to the more familiar uniform distance between distributions. In this paper we improve on their results by sharpening one of their inequalities. We then use new techniques to extend their investigation to a larger class of parent distributions.     

Reeb posets and tree approximations

A well known result in the analysis of finite metric spaces due to Gromov says that given any metric space $(X,d_X)$ there exists a tree metric $t_X$ on $X$ such that ${|d_X-t_X|}_{\infty }$ is bounded above by twice $\mathrm{hyp}\left(X\right)\cdot log\left(2\left|X\right|\right)$. Here $\mathrm{hyp}\left(X\right)$ is the hyperbolicity of $X$, a quantity that measures the treeness of 4-tuples of points in $X$. This bound is known to be asymptotically tight.We improve this bound by restricting ourselves to metric spaces arising from filtered posets. By doing so we are able to replace the cardinality appearing in Gromov’s bound by a certain poset theoretic invariant which can be much smaller thus significantly improving the approximation bound.The setting of metric spaces arising from posets is rich: For example, every finite metric graph can be induced from a filtered poset. Since every finite metric space can be isometrically embedded into a finite metric graph, our ideas are applicable to finite metric spaces as well.At the core of our results lies the adaptation of the Reeb graph and Reeb tree constructions and the concept of hyperbolicity to the setting of posets, which we use to formulate and prove a tree approximation result for any filtered poset.     

Schwarz-Pick Inequalities for Hyperbolic Domains in the Extended Plane

Let and be two hyperbolic simply connected domains in the extended complex plane C¯ = C¯ {}. We derive sharp upper bounds for the modulus of the nth derivative of a holomorphic, resp. meromorphic function f: at a point z ₀ . The bounds depend on the densities (z ₀) and (f(z ₀)) of the Poincaré metrics and on the hyperbolic distances of the points z ₀ and f(z ₀) to the point .     

Métriques de révolution d'un disque et invariance par rotation de la longueur des géodésiques

We give a geometrical proof of a Muhometov type inequality, for a single Riemannian metric defined on a closed disc in the plane. We mainly study the case of equality which is achieved if and only if the distance between points on the boundary is invariant under rotation along the boundary. We show that this implies that the metric itself must be invariant under rotation, at least when the metric is analytic or of nonpositive curvature.     

基于支持向量机的拟南芥基因表达数据分析

针对拟南芥根部基因表达数据分析的问题,本文提出了一种新的基于距离度量学习的支持向机多分类算法．鉴于此问题的特殊性,本文通过最小化4分类机的LOO 误差来求得一个恰当的距离度量．并在此度量下找到若干个属于第5类(其它类)的训练点,从而构造出一个5分类机用来对所有基因分类．实验验证了此算法的可行性,并且比基因表达分析中传统使用的聚类方法更有效．