Skip to main content
Entropy logoLink to Entropy
. 2020 Jun 28;22(7):713. doi: 10.3390/e22070713

On Voronoi Diagrams on the Information-Geometric Cauchy Manifolds

Frank Nielsen 1
PMCID: PMC7517249  PMID: 33286486

Abstract

We study the Voronoi diagrams of a finite set of Cauchy distributions and their dual complexes from the viewpoint of information geometry by considering the Fisher-Rao distance, the Kullback-Leibler divergence, the chi square divergence, and a flat divergence derived from Tsallis entropy related to the conformal flattening of the Fisher-Rao geometry. We prove that the Voronoi diagrams of the Fisher-Rao distance, the chi square divergence, and the Kullback-Leibler divergences all coincide with a hyperbolic Voronoi diagram on the corresponding Cauchy location-scale parameters, and that the dual Cauchy hyperbolic Delaunay complexes are Fisher orthogonal to the Cauchy hyperbolic Voronoi diagrams. The dual Voronoi diagrams with respect to the dual flat divergences amount to dual Bregman Voronoi diagrams, and their dual complexes are regular triangulations. The primal Bregman Voronoi diagram is the Euclidean Voronoi diagram and the dual Bregman Voronoi diagram coincides with the Cauchy hyperbolic Voronoi diagram. In addition, we prove that the square root of the Kullback-Leibler divergence between Cauchy distributions yields a metric distance which is Hilbertian for the Cauchy scale families.

Keywords: Cauchy distribution, Fisher-Rao distance, Kullback-Leibler divergence, chi square divergence, Bregman divergence, Jensen-Bregman divergence, Legendre-Fenchel divergence, metrization, Voronoi diagram, hyperbolic geometry, q-Gaussian, conformal flattening

1. Introduction

Let P={P1,,Pn} be a finite set of points in a space X equipped with a measure of dissimilarity D(·,·):X×XR+. The Voronoi diagram [1] of P partitions X into elementary Voronoi cells Vor(P1),,Vor(Pn) (also called Dirichlet cells [2]) such that

VorD(Pi):=XX,D(Pi,X)D(Pj,X),j{1,,n} (1)

denotes the proximity cell of point generator Pi (also called Voronoi site), i.e., the locii of points XX closer with respect to D to Pi than to any other generator Pj.

When the dissimilarity D is chosen as the Euclidean distance ρE, we recover the ordinary Voronoi diagram [1]. The Euclidean distance ρE(P,Q) between two points P and Q is defined as

ρE(P,Q)=pq2, (2)

where p and q denote the Cartesian coordinates of point P and Q, respectively, and ·2 the 2-norm. Figure 1 (left) displays the Voronoi cells of an ordinary Voronoi diagram for a given set of generators.

Figure 1.

Figure 1

Euclidean Voronoi diagram of a set of generators (black square) in the plane with colored Voronoi cells (left). Euclidean Voronoi diagrams (red) and their dual Delaunay triangulations (blue) for n=8 points (middle) and n=256 points (right).

The Voronoi diagram and its dual Delaunay complex [3] are fundamental data structures of computational geometry [4]. These core geometric data-structures find many applications in robotics, 3D reconstruction, geographic information systems (GISs), etc. See the textbook [1] for some of their applications. The Delaunay simplicial complex is obtained by drawing a straight edge between two generators iff their Voronoi cells share an edge (Figure 1, right). In Euclidean geometry, the Delaunay simplicial complex triangulates the convex hull of the generators, and is therefore called the Delaunay triangulation. Figure 1 depicts the dual Delaunay triangulations corresponding to ordinary Voronoi diagrams. In general, when considering arbitrary dissimilarity D, the Delaunay simplicial complex may not triangulate the convex hull of the generators (see [5] and Section 4).

When the dissimilarity is oriented or asymmetric, i.e., D(P,Q)D(Q,P), one can define the reverse or dual dissimilarity D*(P,Q):=D(Q,P). This duality is termed reference duality in [6], and is an involution:

(D*)*(P,Q)=D(P,Q). (3)

The dissimilarity D(P:Q) is called the forward dissimilarity.

In the remainder, we shall use the ‘:’ notational convention [7] between the arguments of the dissimilarity to emphasize that a dissimilarity D is asymmetric: D(P:Q)D(Q:P). For an oriented dissimilarity D(·:·), we can define two types of dual Voronoi cells as follows:

VorD(Pi):=XX,D(Pi:X)D(Pj:X),j{1,,n}, (4)

and

VorD*(Pi):=XXD(X:Pi)D(X:Pj),j{1,,n}, (5)
=XXD*(Pi:X)D*(Pj:X),j{1,,n}, (6)
=VorD*(Pi)=VorD*(Pi). (7)

That is, the dual Voronoi cell VorD*(Pi) with respect to a dissimilarity D is the primal Voronoi cell VorD*(Pi) for the dual (reverse) dissimilarity D*.

In general, we can build a Voronoi diagram as a minimization diagram [8] by defining the n functions fi(X):=D(Pi:X). Then XVorD(Pi) iff fi(X)fj(X) for all j{1,,n}. Thus, by building the lower envelope [8] of the n functions f1(X),,fn(X), we can retrieve the Voronoi diagram.

An important class of smooth asymmetric dissimilarities are the Bregman divergences [9]. A Bregman divergence BF is defined for a smooth and strictly convex functional generator F(θ) by

BF(θ1:θ2):=F(θ1)F(θ2)(θ1θ2)F(θ2), (8)

where F denotes the gradient of F. In information geometry [7,10,11], Bregman divergences are the canonical divergences of dually flat spaces [7]. Dually flat spaces generalize the (self-dual) Euclidean geometry obtained for the generator FEucl(θ)=12θθ. In information sciences, dually flat spaces can be obtained, for example, as the induced information geometry of the Kullback-Leibler divergence [12] of an exponential family manifold [7,13] or a mixture manifold [14]. The dual Bregman Voronoi diagrams and their dual regular complexes have been studied in [15,16].

In this paper, we study the Voronoi diagrams induced by the Fisher-Rao distance [17,18,19], the Kullback-Leibler (KL) divergence [12] and the chi square distance [20] for the family C of Cauchy distributions. Cauchy distributions also called Lorentzian distributions in the literature [21,22].

The paper is organized with our main contributions as follows:

In Section 2, we concisely review the information geometry of the Cauchy family: We first describe the hyperbolic Fisher-Rao geometry in Section 2.1 and make a connection between the Fisher-Rao distance and the chi square divergence, then we point out the remarkable fact that any α-geometry coincides with the Fisher-Rao geometry (Section 2.2), and we finally present dually flat geometric structures on the Cauchy manifold related to Tsallis’ quadratic entropy [23,24] which amount to a conformal flattening of the Fisher-Rao geometry (Section 2.4). Section 3.3 proves that the square root of the KL divergence between any two Cauchy distributions yields a metric distance (Theorem 3), and that this metric distance can be isometrically embedded in a Hilbert space for the case of Cauchy scale families (Theorem 4). Section 4 shows that the Cauchy Voronoi diagrams induced either by the Fisher-Rao distance, the chi-square divergence, or the Kullback-Leibler divergence (and its square root metrization) all coincide with a hyperbolic Voronoi diagram [25] calculated on the Cauchy 2D location-scale parameters. This result yields a practical and efficient construction algorithm of hyperbolic Cauchy Voronoi diagrams [25,26] (Theorem 5) and their dual hyperbolic Cauchy Delaunay complexes (explained in detail in Section 6). We prove that the hyperbolic Cauchy Voronoi diagrams are Fisher orthogonal to the dual Cauchy Delaunay complexes (Theorem 6). In Section 4.2, we show that the primal Voronoi diagram with respect to the flat divergence coincides with the hyperbolic Voronoi diagram, and that the Voronoi diagram with respect to the reverse flat divergence matches the ordinary Euclidean Voronoi diagram. Finally, we conclude this work in Section 5.

2. Information Geometry of the Cauchy Family

We start by reporting the Fisher-Rao geometry of the Cauchy manifold (Section 2.1), then show that all α-geometries coincide with the Fisher-Rao geometry (Section 2.2). Then we recall that we can associate an information-geometric structure to any parametric divergence (Section 2.3), and finally dually flatten this Fisher-Rao curved geometry using Tsallis’s quadratic entropy [23,24] (Section 2.4) and a conformal Fisher metric.

2.1. Fisher-Rao Geometry of the Cauchy Manifold

Information geometry [7,10,11] investigates the geometry of families of probability measures. The 2D family C of Cauchy distributions

C:=pλ(x):=sπ(s2+(xl)2),λ:=(l,s)H:=R×R+, (9)

is a location-scale family [27] (and also a univariate elliptical distribution family [28]) where lR and s>0 denote the location parameter and the scale parameter, respectively:

pl,s(x):=1spxls, (10)

where

p(x):=1π(1+x2)=:p0,1(x) (11)

is the Cauchy standard distribution.

Let lλ(x):=logpλ(x) denote the log density. The parameter space H:=R×R+ of the Cauchy family is called the upper plane. The Fisher-Rao geometry [17,19,29] of C consists in modeling C as a Riemannian manifold (C,gFR) by choosing the Fisher Information metric [7] (FIm)

gFR(λ)=[gijFR(λ)],gijFR(λ):=Epλilλ(x)jlλ(x), (12)

as the Riemannian metric tensor, where m:=λm for m{1,2} (i.e., 1=l and 2=s). The matrix [gijFR] is called the Fisher Information Matrix (FIM), and is the expression of the FIm tensor in a local coordinate system {e1,e2}: gijFR(λ)=g(ei,ej) with i,j{1,2}.

The Fisher-Rao distance ρFR[pλ1,pλ2]=ρFR[pl1,s1,pl2,s2] is then defined as the Riemannian geodesic length distance on the Cauchy manifold (C,gFR):

ρFRpλ1x,pλ2x=minλ(s)such thatλ(0)=λ1,λ(1)=λ201dλ(t)dtTgFR(λ(s))dλ(t)dtdt. (13)

The Fisher information metric tensor for the Cauchy family [28] is

gFR(λ)=gFR(l,s)=12s21001, (14)

where λ=(l,s)H.

A generic formula for the Fisher-Rao distance between two univariate elliptical distributions is reported in [28]. This formula when instantiated for the Cauchy distributions yields the following closed-form formula for the Fisher-Rao distance:

ρFR[pl1,s1,pl2,s2]=12logtanψ12tanψ22, (15)

where

ψi=arcsinsiA,i{1,2}, (16)
A2=s12+(l2l1)2(s12s22)24(l2l1)2. (17)

However, by noticing that the metric tensor for the Cauchy family (Equation (14)) is equal to the scaled metric tensor gP of the Poincaré (P) hyperbolic upper plane [30]:

gP(x,y)=1y21001, (18)

we get a relationship between the square infinitesimal lengths (line elements) dsFR2=dl2+ds22s2 and dsP2=dx2+dy2y2 as follows:

dsFR=12dsP. (19)

It follows that the Fisher-Rao distance between two Cauchy distributions is simply obtained by rescaling the 2D hyperbolic distance expressed in the Poincaré upper plane [30]:

ρFR[pl1,s1,pl2,s2]=12ρP(l1,s1;l2,s2) (20)

where

ρP(l1,s1;l2,s2):=arccosh1+δ(l1,s1,l2,s2), (21)

with

arccosh(x):=logx+x21,x>1, (22)

and

δ(l1,s1;l2,s2):=(l2l1)2+(s2s1)22s1s2. (23)

This latter term δ shall naturally appear in Section 2.4 when studying the dually flat space obtained by conformal flattening the Fisher-Rao geometry. The expression δ(l1,s1,l2,s2) of Equation (23) can be interpreted as a conformal divergence for the squared Euclidean distance [31,32,33].

We may also write the delta term using the 2D Cartesian coordinates λ=(λ(1),λ(2)) as:

δ(λ1,λ2):=(λ2(1)λ1(1))2+(λ2(2)λ1(1))22λ1(2)λ2(2)=λ1λ2222λ1(2)λ2(2), (24)

where λH.

In particular, when l1=l2, we get the simplified Fisher-Rao distance for Cauchy scale families:

ρFR[pl,s1,pl,s2]=12logs1s2. (25)

Proposition 1.

The Fisher-Rao distance between two Cauchy distributions is

ρFR[pl1,s1,pl2,s2]=12logs1s2whenl1=l2,12arccosh1+(l2l1)2+(s2s1)22s1s2when l1l2.

The Fisher-Rao manifold of Cauchy distributions has constant negative scalar curvature κ=2, see [28] for detailed calculations.

Remark 1.

It is well-known that the Fisher-Rao geometry of location-scale families amount to a hyperbolic geometry [27]. For d-variate scale-isotropic Cauchy distributions pλ(x) with λ=(l,s)Rd×R, the Fisher information metric is gFR(λ)=12s2I, where I denotes the (d+1)×(d+1) identity matrix. It follows that

ρFR[pl1,s1,pl2,s2]=12arccosh1+Δ(l1,s1,l2,s2), (26)

where

Δ(l1,s1,l2,s2):=l2l122+(s2s1)22s1s2, (27)

where ·2 is the d-dimensional Euclidean 2-norm: x=xx. That is, ρFR[pl1,s1,pl2,s2] is the scaled d-dimensional real hyperbolic distance [30] expressed in the Poincaré upper space model.

Let us mention that recently the Riemannian geometry of location-scale models was also studied from the complementary viewpoint of warped metrics [34,35].

Remark 2.

Li and Zhao [36] proposed to use the Wasserstein Information metric (WIm) expressed using the distribution parameter coordinates by the Wasserstein Information Matrix (WIM). They reported the explicit formula of the WIM for generic location-scale families:

IW(l,s)=Epλ[x2]2lEpλ[x]+l2s2001. (28)

In particular, the WIM of the Gaussian family (a location-scale family) is the identity matrix and yields the Euclidean geometry (see the Wasserstein geometry of Gaussians [37]). Although the WIM can be calculated for the Gaussian location-scale family, let us notice that the moments greater or equal to one (i.e., E[X] and E[X2]) are not finite for the Cauchy distributions. Thus, the WIM is not well-defined for the Cauchy family since Equation (28) makes sense only for finite moments.

2.2. The Dualistic α-Geometry of the Statistical Cauchy Manifold

A statistical manifold [38] is a triplet (M,g,T) where g is a Riemannian metric tensor and T is a cubic totally symmetric tensor (i.e., Tσ(i)σ(j)σ(k)=Tijk for any permutation σ). For a parametric family of probability densities M={pλ(x)}, the cubic tensor is called the skewness tensor [7], and defined by:

Tijk(θ):=Epλilλ(x)jlλ(x)klλ(x). (29)

A statistical manifold structure (M,g,T) allows one to construct Amari’s dualistic α-geometry [7] for any αR: Namely a quadruplet (M,gFR,α,α) where α and α are dual torsion-free affine connections coupled to the Fisher metric gFR (i.e., α=(α)*). We refer the reader to the textbook [7] and the overview [11] for further details.

The Fisher-Rao geometry (M,gFR) corresponds to the 0-geometry, i.e., the self-dual geometry where 0:=g is the Levi-Civita metric connection [7] induced by the metric tensor (with (g)*=g). That is, we have

(C,gFR)=(C,gFR,0,0). (30)

In information geometry, the invariance principle states that the geometry should be invariant under the transformation of a random variable X to Y provided that Y=t(X) is a sufficient statistics [7] of X. The α-geometry (M,gFR,α,α) and its special case of Fisher-Rao geometry are invariant geometry [7,11] for any αR.

A remarkable fact is that all the α-geometries of the Cauchy family coincide with the Fisher-Rao geometry since the cubic skewness tensor T vanishes everywhere [28], i.e., Tijk=0. The non-zero coefficients of the Christoffel symbols of the α-connections (including the Levi-Civita metric connection derived from the Fisher metric tensor) are:

αΓ121=αΓ211=αΓ222=1s, (31)
αΓ112=1s. (32)

Thus, all α-geometries coincide and have constant negative scalar curvature κ=2. In other words, we cannot choose a value for α to make the Cauchy manifold dually flat [7]. To contrast with this result, Mitchell [28] reported values of α for which the α-geometry is dually flat for some parametric location-scale families of distributions: For example, it is well known that the manifold N of univariate Gaussian distributions is ±1-flat [7]. The manifold Sk of t-Student’s distributions with k degrees of freedom is proven dually flat when α=±k+5k1 [28]. Dually flat manifolds are Hessian manifolds [39] with dual geodesics being straight lines in one of the two dual global affine coordinate systems. On a global Hessian manifold, the canonical divergences are Bregman divergences. Thus, these dually flat Bregman manifolds are computationally friendly [15] as many techniques of computational geometry [4] can be naturally extended to these Hessian spaces (e.g., the smallest enclosing balls [40]).

2.3. Dualistic Structures Induced by a Divergence

A divergence or contrast function [13] is a smooth parametric dissimilarity. Let M denote the manifold of its parameter space. Eguchi [13] showed how to associate to any divergence D a canonical information-geometric structure (M,Dg,D,D*). Moreover, the construction allows proving that D*=D*. That is the dual connection D* for the divergence D corresponds to the primal connection for the reverse divergence D* (see [7,11] for details).

Conversely, Matsumoto [41] proved that given an information-geometric structure (M,g,,*), one can build a divergence D such that (M,g,T)=(M,Dg,DT) from which we can derive the structure (M,Dg,D,D*). Thus, when calculating the Voronoi diagram VorD for an arbitrary divergence D, we may use the induced information-geometric structure (M,Dg,D,D*) to investigate some of the properties of the Voronoi diagram: For example, is the bisector BiDD-autoparallel?, or is the bisector BiD of two generators orthogonal with respect to the metric Dg to their D-geodesic? Section 4 will study these questions in particular cases.

2.4. Dually Flat Geometry of the Cauchy Manifold by Conformal Flattening

The Cauchy distributions are usually handled in information geometry using the wider scope of q-Gaussians [7,22,42] (deformed exponential families [43]). The q-Gaussians also include the Student’s t-distributions. Cauchy distributions are q-Gaussians for q=2. These q-Gaussians are also called q-normal distributions [44], and they can be obtained as maximum entropy distributions with respect to Tsallis’ entropy Tq(·) [23,24] (see Theorem 4.12 of [7]):

Tq(p):=1q11pq(x)dx,q1. (33)

When q=2, we have the following Tsallis’ quadratic entropy:

T2(p):=1p2(x)dx. (34)

We have limq1Tq(p)=S(p):=p(x)logp(x)dx, Shannon entropy.

Thus, q-Gaussians are q-exponential families [21], generalizing the MaxEnt exponential families derived from Shannon entropy [45]. The integral E(p):=p2(x)dx corresponds to Onicescu’s informational energy [46,47]. Tsallis’ entropy is considered in non-extensive statistical physics [24].

A dually flat structure construction for q-Gaussians is reported in [7] (Sec. 4.3, pp. 84–89). We instantiate this construction for the Cauchy distributions (2-Gaussians):

Let

expC(u):=11u,u1, (35)

denote the deformed q-exponential and

logC(u):=11u,u0, (36)

its compositional inverse, the deformed q-logarithm.

The probability density of a 2-Gaussian can be factorized as

pθ(x)=expC(θxF(θ)), (37)

where θ denotes the 2D natural parameters. We have:

logC(pθ(x))=11sπ(s2+(xl)2)=1πs+(xl)2s, (38)
=:θt(x)F(θ), (39)
=2πlsx+πsx2θt(x)πs+πl2s1F(θ). (40)

Therefore the natural parameter is θ(l,s)=(θ1,θ2)=2πls,πsΘ=R×R (for t(x)=(x,x2)) and the deformed log-normalizer is

F(θ(λ))=πs+πl2s1=:Fλ(λ), (41)
F(θ)=π2θ2θ124θ21. (42)

In general, we obtain a strictly convex and C3-function Fq(θ), called the q-free energy for a q-Gaussian family. Here, we let F(θ):=F2(q) for the Cauchy family: F(θ) is the Cauchy free energy.

We convert back the natural parameter θΘ to the ordinary parameter λH as follows:

λ(θ)=(l,s)=θ12θ2,πθ2. (43)

The gradient of the deformed log-normalizer is:

F(θ)=θ12θ2π2θ22+θ124θ22. (44)

The gradient F(θ) defines the dual global affine coordinate system η:=F(θ) where ηH=R×R+ is the dual parameter space.

It follows the following divergence Dflat[pλ1:pλ2] [7] between Cauchy densities which is by construction equivalent to a Bregman divergence BF(θ1:θ2) (canonical divergence in dually flat space) between their corresponding natural parameters (Eq. (4.95) of [7] instantiated for q=2):

Dflat[pλ1:pλ2]:=1pλ22(x)dxpλ22(x)pλ1(x)dx1, (45)
=2πs2s12+s22+(l1l2)22s1s21, (46)
=2πs2(s1s2)2+(l1l2)22s1s2, (47)
=2πs2δ(l1,s1,l2,s2), (48)
=BF(θ1:θ2), (49)

where θ1:=θ(λ1) and θ2:=θ(λ2). We term BF(θ1:θ2) the Bregman-Tsallis (quadratic) divergence (BFq for general q-Gaussians).

We used a computer algebra system (CAS, see Section 7) to calculate the closed-form formulas of the following definite integrals:

pλ22(x)dx=12πs2, (50)
pλ22(x)pλ1dx=s12+s22+(l1l2)22s1s2. (51)

Here, observe that the equivalent Bregman divergence is not on swapped parameter order as it is the case for ordinary exponential families: DKL[pθ1:pθ2]=BF(θ2:θ1) where F denotes the cumulant function of the exponential family, see [7,11].

We term the divergence Dflat the flat divergence because its induced affine connection [13] Dflat has zero curvature (i.e., the 4D Riemann-Christofel curvature tensor induced by the connection vanishes, see [7] p. 134).

Since Dflat[pλ1:pλ2]=2πs2δ(l1,s1,l2,s2)=πs1(s1s2)2+(l1l2)2, the flat divergence is interpreted as a conformal squared Euclidean distance [33], with conformal factor πs1. In general, the Fisher-Rao geometry of q-Gaussians has scalar curvature [44] κ=q3q. Thus, we recover the scalar curvature κ=2 for the Fisher-Rao Cauchy manifold since q=2.

Theorem 1.

The flat divergence Dflat[pλ1:pλ2] between two Cauchy distributions is equivalent to a Bregman divergence BF(θ1:θ2) on the corresponding natural parameters, and yields the following closed-form formula using the ordinary location-scale parameterization:

Dflat[pλ1:pλ2]=2πs2δ(l1,s1,l2,s2)=πs1(s1s2)2+(l1l2)2=πs1λ1λ222. (52)

The conversion of η-coordinates to θ-coordinates are calculated as follows:

θ(η)=2πη1η2η12πη2η12:=F*(η), (53)

where

F*(η):=θ(η)ηF(θ(η)), (54)

is the Legendre-Fenchel convex conjugate [7]:

F*(η)=12πη2η12. (55)

Since

η(λ)=η(θ(λ))=(λ1,λ12+λ22)=(l,l2+s2), (56)

we have

Fλ*(λ):=F*(η(λ))=12πl2+s2l2=12πs (57)

that is independent of the location parameter l. Moreover, we have [7]

Fλ*(λ):=11p2(x)dx=1112πs=12πs. (58)

We can convert the dual parameter η to the ordinary parameter λH as follows:

λ(η)=(l,s)=(η1,η2η12). (59)

It follows that we have the following equivalent expressions for the flat divergence:

Dflat[pλ1:pλ2]=BF(θ1:θ2)=BF*(η2:η1)=AF(θ1:η2)=AF*(η2:θ1), (60)

where

AF(θ1:η2):=F(θ1)+F*(η2)θ1η2, (61)

is the Legendre-Fenchel divergence measuring the inequality gap of the Fenchel-Young inequality:

F(θ1)+F*(η2)θ1η2. (62)

That is, AF(θ1:η2)=rhs(θ1:η2)lhs(θ1:η2)0, where rhs(θ1:η2):=F(θ1)+F*(η2) and lhs(θ1:η2)=θ1η2.

The Hessian metrics of the dual convex potential functions F(θ) and F*(η) are:

2F(θ)=12θ2θ12θ22θ12θ22θ122θ222π2θ22=:gF(θ), (63)
2F*(η)=2η2η12+2η12(η2η12)32η1(η2η12)32η1(η2η12)3212(η2η12)32=:gF*(η). (64)

We check the Crouzeix identity [11,48]:

2F(θ)2F*(η(θ))=2F(θ(η))2F*(η)=I, (65)

where I denotes the 2×2 identity matrix.

The Hessian metric 2F(θ) is also called the q-Fisher metric [44] (for q=2). Let gFRλ(λ) and gFRθ(θ) denote the Fisher information metric expressed using the λ-coordinates and the θ-coordinates, respectively. Then, we have

gFRθ(θ)=Jacλ(θ)×gFRλ(λ(θ))×Jacλ(θ), (66)

where Jacλ(θ) denotes the Jacobian matrix:

Jacλ(θ):=λiθj. (67)

Similarly, we can express the Hessian metric gF:=2F(θ) using the λ-coordinate system:

gFλ(λ)=Jacθ(λ)×gFθ(θ(λ))×Jacθ(λ). (68)

We calculate explicitly the following Jacobian matrices:

Jacθ(λ)=π2λ22λ1λ2201λ22. (69)

and

Jacλ(θ)=12θ2θ12θ220πθ22. (70)

We check that we have

gFθ(θ)=2θ2π2gFRθ(θ), (71)
gFλ(λ)=2πσgFRλ(λ). (72)

That is, the Riemannian metric tensors gFRλ(λ) and gFλ(λ) (or gFθ(θ) and gFRθ(θ)) are conformally equivalent. This is, there exists a smooth function u(λ)=log2πσ such that gFλ(λ)=eu(λ)gFRλ(λ).

This dually flat space construction of the Cauchy manifold

C,g(θ)=2F(θ),Dflat,Dflat*=Dflat*

can be interpreted as a conformal flattening of the curved α-geometry [7,44,49]. The relationships between the curvature tensors of dual ±α-connections are studied in [50].

Notice that this dually flat geometry can be recovered from the divergence-based structure of Section 2.3 by considering the Bregman-Tsallis divergence. Figure 2 illustrates the relationships between the invariant α-geometry and the dually flat geometry of the Cauchy manifold. The q-Gaussians can further be generalized by χ-family with corresponding deformed logarithm and exponential functions [7,45]. The χ-family unifies both the dually flat exponential family with the dually flat mixture family [45].

Figure 2.

Figure 2

Information-geometric structures on the Cauchy manifold and their relationships.

A statistical dissimilarity D[pλ1:pλ2] between two parametric distributions pλ1 and pλ2 amounts to an equivalent dissimilarity D(θ1:θ2) between their parameters: D(θ1:θ2):=D[pλ1:pλ2]. When the parametric dissimilarity is smooth, one can construct the divergence-based α-geometry [11,51]. Thus, the dually flat space structure of the Cauchy manifold can also be obtained from the divergence-based ±α-geometry obtained from the flat divergence Dflat (see Figure 2). It can be shown that the dually flat space q-geometry is the unique geometry in the intersection of the conformal Fisher-Rao geometry with the deformed χ-geometry (Theorem 13 of [45]) when the manifold is the positive orthant Rd+1. Please note that a dually flat space in information geometry is usually not Riemannian flat (with respect to the Levi-Civita connection, e.g., the Gaussian manifold). In particular, Matsuzoe proved in [52] that the Riemannian manifold (C,2F(θ)) induced by the q-Fisher metric is of constant curvature 1 when q=2.

There are many alternative possible ways to build a dually flat space from a q-Gaussian family once a convex Bregman generator F(θ) has been built from the density pq(θ) of a q-Gaussian. The method presented above is a natural generalization of the dually flat space construction for exponential families. To give another approach, let us mention that Matsuzoe [52] also introduced another Hessian metric gM(θ)=[gijM(θ)] defined by:

gijM(θ):=ipθ(x)jlogqpθ(x)dx. (73)

This metric is conformal to both the Fisher metric and the q-Fisher metric, and is obtained by generalizing equivalent representations of the Fisher information matrix (see α-representations in [7]).

3. Invariant Divergences: f-Divergences and α-Divergences

3.1. Invariant Divergences in Information Geometry

The f-divergences [20,53] between two densities p(x) and q(x) is defined for a positive convex function f, strictly convex at 1, with f(1)=0 as:

If[p:q]:=Xp(x)fq(x)p(x)dx, (74)

The KL divergence is a f-divergence obtained for the generator f(u)=log(u).

An invariant divergence is a divergence D which satisfies the information monotonicity [7]: D[pX:pY]D[pt(X):pt(Y)] with equality iff t(X) is a sufficient statistic. The invariant divergences are the f-divergences for the simplex sample space [7]. Moreover, the standard f-divergences (calibrated with f(1)=0 and f(1)=f(1)=1) induce the Fisher information metric (FIm) for its metric tensor Ifg when the sample space is the probability simplex: Ifg=gFR, see [7].

3.2. α-Divergences between Location-Scale Densities

Let Iα[p:q] denote the α-divergence [7,54,55] between p and q:

Iα[p:q]:=1α(1α)(1Cα[p:q]),α{0,1} (75)

where Cα[p:q] is Chernoff α-coefficient [56,57]:

Cα[p:q]:=pα(x)q1α(x)dx, (76)
=q(x)p(x)q(x)α, (77)
=C1α[q:p]. (78)

We have Iα[p:q]=I1α[q:p]=Iα*[p:q].

The α-divergences include the chi square divergence (α=2), the squared Hellinger divergence (α=12, symmetric) and in the limit cases the Kullback-Leibler (KL) divergence (α1) and the reverse KL divergence (α0). The α-divergences are f-divergences for the generator:

fα(u)=u1αuα(α1),ifα0,α1ulog(u),ifα=0(reverseKullback-Leiblerdivergence),log(u),ifα=1(Kullback-Leiblerdivergence). (79)

For location scale families, let

Cα(l1,s1;l2,s2):=Cαpl1,s1:pl2,s2. (80)

Using change of variables in the integrals, one can show the following identities:

Cα(l1,s1;l2,s2)=Cα0,1;l2l1s1,s2s1, (81)
=Cαl1l2s2,s1s2;0,1, (82)
=C1α0,1;l1l2s2,s1s2, (83)
=C1α(l2,s2;l1,s1). (84)

For the location-scale families which include the normal family N, the Cauchy family C and the t-Student families Sk with fixed degree of freedom k, the α-divergences are not symmetric in general (e.g., α-divergences between two normal distributions). However, we have shown that the chi square divergences and the KL divergence are symmetric when densities belong to the Cauchy family. Thus, it is of interest to prove whether the α-divergences between Cauchy densities are symmetric or not, and report their closed-form formula for all αR.

Using symbolic integration described in Section 7, we found that

C3(pλ1;pλ2)=3s24+(2s12+6l2212l1l2+6l12)s22+3s14+(6l2212l1l2+6l12)s12+3l2412l1l23+18l12l2212l13l2+3l14)8s12s22, (85)

and checked that this Chernoff similarity coefficient is symmetric:

C3(pλ1;pλ2)=C3(pλ2;pλ1). (86)

Therefore the 3-divergence I3 between two Cauchy distributions is symmetric. In particular, when l1=l2=l, we find that

C3(pl,s1;pl,s2)=3(s14+s24)+2s12s228s12s22, (87)
=1+34(s12s22)22s12s22, (88)
=1+34δ(l2,s12,l22,s22). (89)

In the Section 7, we proved by symbolic calculations that the α-divergences are symmetric for α{0,1,2,3,4}.

Remark 3.

The Cauchy family can also be interpreted as a family of univariate elliptical distributions [28]. A univariate elliptical distribution has canonical parametric density:

qμ,σ(x):=1σhxμσ2, (90)

for some function h(u). For example, the Gaussian distributions are elliptical distributions obtained for h(u)=12πexp12u. Location-scale densities pl,s with standard density p0,1 can be interpreted as univariate elliptical distributions qμ,σ with h(u)=p0,1(u2) and (μ,σ)=(l,s): pl,s=qμ,σ. It follows that the Cauchy densities are elliptical distributions for h(u)=1π(1+u). By doing a change of variable in the KL divergence integral, we find again the following identity:

DKLqμ1,σ1:qμ2,σ2=DKLq0,1:qμ2μ1σ2,σ1σ2. (91)

3.3. Metrization of the Kullback-Leibler Divergence

The Kullback-Leibler divergence [12] DKL[p:q] between two continuous probability densities p and q defined over the real line support is an oriented dissimilarity measure defined by:

DKL[p:q]:=p(x)logp(x)q(x)dx. (92)

The closed-form formula for the KL divergence between two Cauchy distributions requires to perform a (non-trivial) integration task. The following closed-form expression has been reported in [58] using advanced symbolic integration:

DKL[pl1,s1:pl2,s2]=log1+(s1s2)2+(l1l2)24s1s2. (93)

Although the KL divergence is usually asymmetric, it is a remarkable fact that it is symmetric between any two Cauchy densities. However, the KL divergence of Equations (92) and (93) does not satisfy the triangle inequality, and therefore although symmetric, it is not a metric distance.

The KL divergence between two Cauchy distributions is related to the Pearson DχP2[p:q] and Neyman DχN2[p:q] chi square divergences [20]:

DχP2[p:q]:=(q(x)p(x))2p(x)dx, (94)
DχN2[p:q]:=(q(x)p(x))2q(x)dx=DχP2*[p:q]=DχP2[q:p]. (95)

Indeed, the formula for the Pearson and Neyman chi square divergences between two Cauchy distributions coincide, and (surprisingly) amount to the δ distance:

DχP2[pl1,s1:pl2,s2]=DχN2[pl1,s1:pl2,s2], (96)
=(s1s2)2+(l2l1)22s1s2, (97)
=:δ(l1,s1;l2,s2). (98)

Since the Pearson and Neyman chi square divergences are symmetric, let us write Dχ2[p:q]=DχP2[p:q] in the remainder. We can rewrite the Fisher-Rao distance between two Cauchy distributions using the Dχ2 divergence as follows:

ρFR[pl1,s1,pl2,s2]=12arccosh1+Dχ2[pl1,s1:pl2,s2]. (99)

Figure 3 plots the strictly increasing chi-to-Fisher-Rao conversion function:

tχFR(u):=12arccosh1+u. (100)

Figure 3.

Figure 3

Plot of the chi-to-Fisher-Rao conversion function: A strictly increasing function.

Since the Cauchy family is a location-scale family, we have the following general invariance property of f-divergences:

Theorem 2.

The f-divergence [53] between two location-scale densities pl1,s1 and pl2,s2 can be reduced to the calculation of the f-divergence between one standard density with another location-scale density:

If[pl1,s1:pl2,s2]=Ifp:pl2l1s1,s2s1=Ifpl1l2s2,s1s2:p. (101)

Proof. 

The proof follows from changes of the variable x in the definite integral of Equation (74): Consider y=xl1s1 with dx=s1dy, x=s1y+l1 and xl2s2=s1y+l1l2s2=yl2l1s1s2s1. We have

If[pl1,s1:pl2,s2]:=Xpl1,s1(x)fpl2,s2(x)pl1,s1(x)dx, (102)
=Y1s1p(y)f1s2pyl2l1s1s2s11s1p(y)s1dy, (103)
=p(y)fpl2l1s1,s2s1(y)p(y)dy, (104)
=Ifp:pl2l1s1,s2s1. (105)

The proof for If[pl1,s1:pl2,s2]=If(pl1l2s2,s1s2:p) is similar. One can also use the conjugate generator f*(u):=uf(1u) which yields the reverse f-divergence: If*[p:q]=If[q:p]=If*[p:q]. □

Since the KL divergence is expressed by DKL[pl1,s1:pl2,s2]=log1+12δ(l1,s1;l2,s2), we also check that

δ(l1,s1;l2,s2)=δ0,1;l1l2s2,s1s2, (106)
=δl2l1s1,s2s1;0,1, (107)
=:δ(a,b), (108)

where

δ(a,b):=a2+(b1)24b. (109)

It follows the following corollary for scale families:

Corollary 1.

The f-divergences between scale densities is scale-invariant and amount to a scalar scale-invariant divergence Df(s1:s2):=If[ps1:ps2].

Proof. 

Df(s1:s2):=If[ps1:ps2]=Ifp:ps2s1=:Df1:s2s1, (110)
=Ifps1s2:q=:Dfs1s2:1. (111)

 □

Many algorithms and data-structures can be designed efficiently when dealing with metric distances: For example, the metric ball tree [59] or the vantage point tree [60,61] are two such data structures for querying efficiently nearest neighbors in metric spaces. Thus, it is of interest to consider statistical dissimilarities which are metric distances. The total variation distance [12] and the square-root of the Jensen-Shannon divergence [62] are two common examples of statistical metric distances often met in the literature. In general, the metrization of f-divergences was investigated in [63,64].

We shall prove the following theorem:

Theorem 3.

The square root of the Kullback-Leibler divergence between two Cauchy density pl1,s1 and pl2,s2 is a metric distance:

ρKL[pl1,s1,pl2,s2]:=DKL[pl1,s1:pl2,s2]=log1+(s1s2)2+(l1l2)24s1s2. (112)

Proof. 

The proof consists in showing that the square root of the conversion function of the Fisher-Rao distance to the KL divergence is a metric transform [65]. A metric transform t(u):R+R+ is a transform which preserves the metric distance ρ, i.e., (tρ)(p,q)=t(ρ(p,q)) is a metric distance. The following are sufficient conditions for function t(u) to be a metric transform:

  1. t is a strictly increasing function,

  2. t(0)=0,

  3. t satisfies that subadditive property: t(a+b)t(a)+t(b) for all a,b0.

For example, strictly concave functions t(u) with t(0)=0 are metric transforms. In general, one can check that t(u) is subadditive by verifying that the ratio of functions t(u)u is non-decreasing.

The following transform tFRKL(u) converts the Fisher-Rao distance ρFR to the Kullback-Leibler divergence DKL:

tFRKL(u):=log12+12cosh(2u), (113)

where

cosh(x):=ex+ex2. (114)

The square root of that conversion function is a subadditive function since tFRKL(u)u is non-decreasing (see Figure 4) and tFRKL(0)=0.

Since the Fisher-Rao distance is a metric distance and since tFRKL(u) is a metric transform, we conclude that

ρKL[pl1,s1:pl2,s2]:=DKL[pl1,s1:pl2,s2]=tFRKL(ρFR[pl1,s1:pl2,s2]) (115)

is a metric distance. □

Figure 4.

Figure 4

Plot of the function tFRKL(u)u.

A metric distance ρ(p,q) is said to be Hilbertian if there exists an embedding ϕ(·) into a Hilbert space such that ρ(p,q)=ϕ(p)ϕ(q)H, where ·H is a norm. A metric is said to be Euclidean if there exists an embedding with associated norm 2, the Euclidean norm. For example, the square root of the celebrated Jensen-Shannon divergence is a Hilbertian distance [62].

Let us prove the following:

Theorem 4.

The square root of the KL divergence between to Cauchy densities of the same scale family is a Hilbertian distance.

Proof. 

For Cauchy distributions with fixed location parameter l, the KL divergence of Equation (93) simplifies to:

DKL[pl,s1:pl,s2]=log(s1+s2)24s1s2. (116)

We can rewrite this KL divergence as

DKL[pl,s1:pl,s2]=2logA(s1,s2)G(s1,s2), (117)

where A(s1,s2)=s1+s22 and G(s1,s2)=s1s2 are the arithmetic mean and the geometric mean of s1 and s2, respectively. Then we use Lemma 3 of [66] to conclude that DKL[pl,s1:pl,s2] is a Hilbertian metric distance.

Another proof consists in rewriting the KL divergence as a scaled Jensen-Bregman divergence [66,67]:

DKL[pl,s1:pl,s2]=2JBF(s1,s2), (118)

where

JBF(θ1,θ2):=F(θ1)+F(θ2)2Fθ1+θ22, (119)

for a strictly convex generator F. We use F(θ)=log(u), i.e., the Burg information yielding the Jensen-Burg divergence JBF. Then we use Corollary 1 of [66] (i.e., F is the cumulant of an infinitely divisible distribution) to conclude that JBF(θ1,θ2) is a metric distance (and hence, ρKL(l,s1,l,s2)=DKL[pl,s1:pl,s2]=2JBF(s1,s2) is a Hilbertian metric distance). □

The α-skewed Jensen-Bregman divergence is defined by

JBFα(θ1:θ2):=αF(θ1)+(1α)F(θ2)Fαθ1+(1α)θ2, (120)

and the maximal α-skewed Jensen-Bregman divergence is called the Jensen-Chernoff divergence:

JBFα*(θ1:θ2):=maxα(0,1)JBFα(θ1:θ2). (121)

The maximal exponent α* corresponds to the error exponent in Bayesian hypothesis testing on exponential family manifolds [57]. In general, the metrization of Jensen-Bregman divergence (and Jensen-Chernoff) was studied in [68].

Furthermore, by combining Corollary 1 of [66] with Theorem 3 of [67], we get the following proposition:

Proposition 2.

The square root of the Bhattacharyya divergence between two densities of an exponential family is a metric distance when the exponential family is infinitely divisible.

This proposition holds because the Bhattacharyya divergence

DBhat[p,q]=logp(x)q(x)dx, (122)

between two parametric densities p(x)=pθ1(x) and q(x)=pθ2(x) of an exponential family with cumulant function F amounts to a Jensen-Bregman divergence [67] (Theorem 3 of [67]):

DBhat[pθ1(x),pθ2(x)]=JBF(θ1,θ2). (123)

Notice that Proposition 2 recovers the fact that the square root of the Bhattacharyya divergence between two zero-centered normal distributions is a metric (proved differently in [69]) since the set of normal distributions form an infinitely divisible exponential family.

4. Cauchy Voronoi Diagrams and Dual Cauchy Delaunay Complexes

Let us consider the Voronoi diagram [1] of a finite set P={pλ1,pλn} of n Cauchy distributions with the location-scale parameters λi=(li,si)H for i{1,,n}. We shall consider the Fisher-Rao distance ρFR, the KL divergence DKL and its square root metrization ρKL, the chi square divergence Dχ2, and the flat divergence Dflat.

4.1. The Hyperbolic Cauchy Voronoi Diagrams

Observe that the Voronoi diagram does not change under any strictly increasing function t of the dissimilarity measure (e.g., square root function): VorDt(P)=VorD(P). Thus, we get the following theorem:

Theorem 5.

The Cauchy Voronoi diagrams under the Fisher-Rao distance, the the chi-square divergence and the Kullback-Leibler divergence all coincide, and amount to a hyperbolic Voronoi diagram on the corresponding location-scale parameters.

Proof. 

The KL divergence can be expressed as

DKL[pl1,s1:pl2,s2]=log1+12δ(l1,s1,l2,s2). (124)

Thus, both the DKL and ρFR dissimilarities are expressed as strictly increasing functions of δ (a synonym for the Dχ2 divergence). Therefore the Voronoi bisectors between two Cauchy distributions pl1,s1 and pl2,s2 for D{ρFR,DKL,DKL,Dχ2} amounts to the same expression:

BiD(pλ1:pλ2)=λH:δ(λ,λ1)=δ(λ,λ2), (125)
BiD(pl1,s1:pl2,s2)=(l,s)H:δ(l,s,l1,s1)=δ(l,s,l2,s2). (126)

 □

It follows that we can calculate the Cauchy Voronoi diagram of n Cauchy distributions in optimal Θ(nlogn) time by calculating the 2D hyperbolic Voronoi diagram [25,26] on the location-scale parameters (see Section 6 for details). Figure 5 displays the Voronoi diagram of a set of Cauchy distributions by its equivalent parameter hyperbolic Voronoi diagram in the Poincaré upper plane model, the Poincaré disk model, and the Klein disk model. Figure 6 shows the hyperbolic Voronoi diagram in the upper plane with colored Voronoi cells. A model of hyperbolic geometry is said to be conformal if it preserves angles, i.e., its underlying Riemannian metric tensor is a scalar positive function of the Euclidean metric tensor. The Poincaré disk model and the Poincaré upper plane model are both conformal models [30]. The Klein model is not conformal, except at the disk origin. Let D={p:p<1} denote the open unit disk domain for the Poincaré and Klein disk models. Indeed, the Riemannian metric corresponding to the Klein disk model is

dsKlein2(p)=dsEucl21p2+p,dp1p22, (127)

where dp=dx+dy and dsEucl=dx2+dy2 denotes the Euclidean line element. Since dsKlein2(0)=dsEucl2, we deduce that Klein model is conformal at the origin (when measuring the angles between two vectors v1 and v2 of the tangent plane T0).

Figure 5.

Figure 5

Hyperbolic Voronoi diagram of a set of Cauchy distributions in the Poincaré upper plane (top), the Poincaré disk model (bottom left), and the Klein disk model (bottom right).

Figure 6.

Figure 6

A hyperbolic Cauchy Voronoi diagram of a finite set of Cauchy distributions (black square generators, colored Voronoi cells, and black cell borders).

The dual of the Voronoi diagram is called the Delaunay (simplicial) complex [4,5]: We build the Delaunay complex by drawing an edge between generators whose Voronoi cells are adjacent. For the ordinary Euclidean Delaunay complex with points in general position (i.e., no d+2 cospherical points in dimension d), the Delaunay complex triangulates the convex hull of the points [8,70]. Therefore it is called the Delaunay triangulation [1,3,8]. Figure 7 displays an Euclidean Voronoi diagram with its dual Delaunay triangulation.

Figure 7.

Figure 7

Duality between the ordinary Euclidean Voronoi diagram and the Delaunay structures: The Voronoi diagram partitions the space into Voronoi proximity cells. The Delaunay complex triangulates the convex hull of the generators. A Delaunay edge is drawn between the generators of adjacent Voronoi cells. Observe that the Delaunay edges cuts orthogonally the corresponding Voronoi bisectors in Euclidean geometry.

Similarly, for the hyperbolic Voronoi diagram, we construct the hyperbolic Delaunay complex by drawing a hyperbolic geodesic edge between any two generators whose Voronoi cells are adjacent. However, we do not necessarily obtain anymore a geodesic triangulation of the hyperbolic geodesic convex hull but rather a simplicial complex, hence the name hyperbolic Delaunay complex [5,71,72]. In extreme cases, the hyperbolic Delaunay complex has a tree structure. See Figure 8 for examples of a hyperbolic Delaunay triangulation and a hyperbolic Delaunay complex which is not a triangulation In fact, hyperbolic geometry is very well-suited for embedding isometrically with low distortion weighted tree graphs [73]. Hyperbolic embeddings of hierarchical structures [74] has become a hot topic in machine learning.

Figure 8.

Figure 8

Examples of hyperbolic Voronoi Delaunay complexes drawn in the Klein model: Delaunay complex triangulates the convex hull yielding the Delaunay triangulation (top left), and Delaunay complex which does not triangulate the convex hull, (top right). Bottom: A hyperbolic Voronoi diagram and its dual Delaunay complex displayed in the Poincaré disk model (left) and in the Klein disk model (right).

Let us now prove that these Cauchy hyperbolic Voronoi/Delaunay structures are Fisher orthogonal:

Theorem 6.

The Cauchy Voronoi diagram is Fisher orthogonal to the Cauchy Delaunay complex.

Proof. 

It is enough to prove that the corresponding hyperbolic geodesic γ(pλ1,pλ2) is orthogonal to the bisector Bi(pλ1:pλ2). The distance in the Klein disk model is

ρKlein(p,q)=ρK(p,q):=arccosh1p,q1p21q2. (128)

The equation of the hyperbolic bisector in the Klein disk model [25] is

BiρKlein(λ1:λ2)=λD:λ1λ12λ21λ22λ1+1λ221λ12=0. (129)

Using a Möbius transformation [25] (i.e., a hyperbolic “rigid motion”), we may consider without loss of generality that pλ1=pλ2. It follows that the bisector equation writes simply as

BiρKlein=λ:21pλ1λλ1=0. (130)

Since the Klein disk model is conformal at the origin, we deduce from Equation (130) that we have γ(pλ1,pλ2)Bi(pλ1:pλ2). □

Figure 9 displays two bisectors with their corresponding geodesics in the Klein model. We check that the Euclidean angles are deformed when the intersection point is not at the disk origin. Section 6 provides further details for the efficient construction of the hyperbolic Voronoi diagram in the Klein model.

Figure 9.

Figure 9

In hyperbolic geometry, the Voronoi bisector between two generators is orthogonal to the geodesic linking them. The top figures display a pair of (bisector,geodesic) in the Klein model (left), and the same pair in the Poincaré model (right). When viewed in Klein non-conformal model, the bisector does not intersect orthogonally (with respect to the Euclidean geometry) the geodesic (left) except when the intersection point is at the disk origin (bottom right).

Remark 4.

The hyperbolic Cauchy Voronoi diagram can be used for classification tasks in statistics as originally motivated by C.R. Rao in his celebrated paper [17]: Let pλ1,,pλn be n Cauchy distributions, and x1,,xs be s identically and independently samples drawn from a Cauchy distribution pλ. We can estimate λ^ the location-scale parameters from the s samples [75], and then decide the multiple test hypothesis Hi:pλ=pλi by choosing the hypothesis Hi such that ρFR(pλi,pλ)ρFR(pλj,pλ) for all j{1,,n}. This classification task amounts to perform a nearest neighbor query in the Fisher-Rao hyperbolic Cauchy Voronoi diagram. Hypothesis testing for comparing location parameters based on Rao’s distance is investigated in [76].

Figure 10 displays the hyperbolic Voronoi Cauchy diagram induced by 300 Cauchy distribution generators.

Figure 10.

Figure 10

Equivalent hyperbolic Voronoi diagram and dual Delaunay complex of a set of Cauchy distributions in the Poincaré upper plane (left), the Poincaré disk model (middle), and the Klein disk model (right). Top row figures for n=24 Cauchy distributions, middle row figures for n=1024 distributions and bottom row figures for a quasi-regular set of n=25 Cauchy distributions.

Notice that it is possible to construct a set of points such that all hyperbolic Voronoi cells for that point set are unbounded. See Figure 11 for such an example.

Figure 11.

Figure 11

A hyperbolic Voronoi diagram with all unbounded Voronoi cells.

The ordinary Euclidean Delaunay triangulation satisfies the empty sphere property [4,77]: That is the circumscribing spheres passing through the vertices of the Delaunay triangles of the Delaunay complex are empty of any other Voronoi site. This property still holds for the hyperbolic Delaunay complex which is obtained by a filtration of the ordinary Euclidean Delaunay triangulation in [5]. A hyperbolic ball in the Poincaré conformal disk model or the upper plane model has the shape of a Euclidean ball with displaced center [71]. Figure 12 displays the Delaunay complex with the empty sphere property in the Poincaré and Klein disk models. The centers of these circumscribing spheres are located at the T-junctions of the Voronoi diagrams.

Figure 12.

Figure 12

Delaunay triangles of the hyperbolic Delaunay complex satisfy the empty circumscribing sphere property. The empty sphere centers are located on the Voronoi T-junction vertices. The hyperbolic spheres are displayed as ordinary Euclidean sphere (with displaced center) in the Poincaré model (left column) and as ellipsoids (with displaced center) in the Klein model (right column). The centers of the empty hyperbolic spheres are located at the Voronoi T-junctions.

4.2. The Dual Voronoi Diagrams on the Cauchy Dually Flat Manifold

The dual Cauchy Voronoi diagrams with respect to the flat divergence Dflat (and dual reverse flat divergence Dflat* which corresponds to a dual Bregman-Tsallis divergence) of Section 2.4 amount to calculate 2D dual Bregman Voronoi diagrams [15,16]. We get the following dual bisectors: The primal bisector with respect to the dual flat divergence is:

BiDflat(pλ1:pλ2)=pλ:Dflat[pλ1:pλ]=Dflat[pλ2:pλ], (131)
=λ:δ(l1,s1;l,s)=δ(l2,s2;l,s). (132)

Thus, this primal bisector with respect to the flat divergence corresponds to the hyperbolic bisector of the Fisher-Rao distance/chi square/ KL divergences:

BiDflat(pλ1:pλ2)=BiρFR(pλ1:pλ2)=BiDKL(pλ1:pλ2)=BiDχ2(pλ1:pλ2). (133)

The dual bisector with respect to the dual flat divergence (reverse Bregman-Tsallis divergence) is:

BiDflat*(pλ1:pλ2)=pλ:Dflat[pλ:pλ1]=Dflat[pλ:pλ2], (134)
=λ:λλ1=λλ2. (135)

That is, the dual bisector corresponds to an ordinary Euclidean bisector:

BiDflat*(pλ1:pλ2)=BiρE(pλ1,pλ2). (136)

Notice that BiDflat*(pλ1:pλ2)=BiDflat*(pλ1:pλ2).

To summarize, one primal bisector coincides with the Fisher-Rao bisector while the dual bisector amounts to the ordinary Euclidean bisector.

Theorem 7.

The dual Cauchy Voronoi diagrams with respect to the flat divergence can be calculated efficiently in Θ(nlogn)-time.

The construction of 2D Bregman Voronoi diagrams is described in [15].

4.3. The Cauchy Voronoi Diagrams with Respect to α-Divergences

The dual bisectors with respect to the α-divergences between any two parametric probability densities pλ1(x) and pλ2(x) are

BiIα(pλ1:pλ2)=pλ:Iα[pλ1:pλ]=Iα[pλ2:pλ], (137)
=λ:Cα(pλ1;pλ)=Cα(pλ2;pλ), (138)

and

BiIα*(pλ1:pλ2)=pλ:Iα[pλ:pλ1]=Iα[pλ:pλ2], (139)
=BiI1α(pλ1:pλ2). (140)

It is an open problem to prove when the dual α-bisectors coincide for the Cauchy family. We have shown it is the case for the χ2-divergence and the KL divergence. In theory, the Risch semi-algorithm [78] allows one to answer whether a definite integral has a closed-form formula or not. However, the Risch semi-algorithm is only a semi-algorithm as it requires to implement an oracle to check whether some mathematical expressions are equivalent to zero or not.

5. Conclusions

In this paper, we have considered the construction of Voronoi diagrams of finite sets of Cauchy distributions with respect to some common statistical distances. Since statistical distances can potentially be asymmetric, we defined the dual Voronoi diagrams with respect to the forward and reverse/dual statistical distances. From the viewpoint of information geometry [7], we have reported the construction of two types of geometry on the Cauchy manifold: (1) The invariant α-geometry equipped with the Fisher metric tensor gFR and the skewness tensor T from which we can build a family of pairs of torsion-free affine connections coupled with the metric, and (2) a dually flat geometry induced by a Bregman generator defined by the free energy Fq of the q-Gaussians (here, instantiated to q=2 when dealing with the Cauchy family). The metric tensor of the latter geometry is called the q-Fisher information metric, and is a Riemannian conformal metric of the Fisher information metric. We have shown that the Fisher-Rao distance amount to a scaled hyperbolic distance in the Poincaré upper plane model (Proposition 1), and that all Amari’s α-geometries [7] coincide with the Fisher-Rao geometry since the cubic tensor vanishes, thus yielding a hyperbolic manifold of negative constant scalar curvature κ=2 for the Cauchy α-geometric manifolds. We noticed that the Fisher-Rao distance and the KL divergence can be expressed as a strictly increasing function of the chi square divergence. Then we explained how to conformally flatten the curved Fisher-Rao geometry to obtain a dually flat space where the flat divergence amounts to a canonical Bregman divergence built from Tsallis’ quadratic entropy (Theorem 1). We reported the Hessian metrics of the dual potential functions of the dually flat space, and showed that there are other alternative choices for building Hessian structures [52].

Table 1 summarizes the various closed-form formula of statistical dissimilarities obtained for the Cauchy family. We proved that the square root of the KL divergence between any two Cauchy distributions is a metric distance (Theorem 3) in general, and more precisely a Hilbertian metric for the scale Cauchy families (Theorem 4). It follows that the Cauchy Voronoi diagram for the Fisher-Rao distance coincides with the Voronoi diagram with respect to the KL divergence or the chi square divergence (Figure 13). We showed how to build this hyperbolic Cauchy diagram from an equivalent hyperbolic Voronoi diagram on the corresponding location-scale parameters (see also Section 6). Then we proved that the dual hyperbolic Cauchy Delaunay complex is Fisher orthogonal to the Fisher-Rao hyperbolic Cauchy Voronoi diagram (Theorem 6). The dual Voronoi diagrams with respect to the dual flat divergences can be built from the corresponding dual Bregman-Tsallis divergences with the primal Voronoi diagram coinciding with the hyperbolic Voronoi diagram and the dual diagram coinciding with the ordinary Euclidean Voronoi diagram (Figure 13). These results are particular to the special case of the Cauchy location-scale family, and do not hold in general for arbitrary location-scale families since the cubic tensor may not vanish [28] and the KL divergence is usually asymmetric (e.g., the Gaussian location-scale family). However, the Fisher-Rao geometry of any location-scale family amounts after a potential rescaling to hyperbolic geometry [27,79].

Table 1.

Summary of the main closed-form formula for the statistical distances between Cauchy densities and their induced Voronoi diagrams.

Formula Voronoi
Dχ2[pl1,s1,pl2,s2]=(l2l1)2+(s2s1)22s1s2 VorDχ2 hyperbolic Voronoi
ρFR[pl1,s1,pl2,s2]=12arccosh(1+Dχ2[pl1,s1,pl2,s2]) VorρFR hyperbolic Voronoi
DKL[pl1,s1,pl2,s2]=log1+12Dχ2[pl1,s1,pl2,s2] VorDKL hyperbolic Voronoi
ρKL[pl1,s1,pl2,s2]=DKL[pl1,s1,pl2,s2] (metric) VorρKL hyperbolic Voronoi
Dflat[pl1,s1,pl2,s2]=2πs2Dχ2[pl1,s1,pl2,s2] Bregman Voronoi:
VorDflat hyperbolic Voronoi, VorDflat* Euclidean Voronoi.

Figure 13.

Figure 13

Voronoi diagrams of a set of Cauchy distributions with respect to the Fisher-Rao (FR) distance ρFR, the Kullback-Leibler (KL) divergence DKL, the χ2-divergence Dχ2, and the asymmetric Bregman-Tsallis flat divergence Dflat.

6. Klein Hyperbolic Voronoi Diagram from a Clipped Power Diagram

We concisely recall the efficient construction of the hyperbolic Voronoi diagram in the Klein disk model [25]. Let P={p1,,pn} be a set of n points in the d-dimensional open unit ball domain D=xRd:x2<1, where ·2 denotes the Euclidean 2-norm. The hyperbolic distance between two points p and q is expressed in the Klein model as follows:

ρK(p,q):=arccosh1p,q1p221q22. (141)

It follows that the Klein bisector between any two points in the Klein disk is an hyperplane (affine equation) clipped to D:

BiρK(λ1:λ2)=λD:λ1λ122λ21λ222λ1+1λ2221λ122=0. (142)

The Klein bisector is a hyperplane (i.e., line in 2D) restricted to the disk domain D. A Voronoi diagram is said to be affine [8] when all bisectors are hyperplanes. It is known that affine Voronoi diagrams can be constructed from equivalent power diagrams [8]. Thus, the Klein hyperbolic Voronoi diagram is equivalent to a clipped power diagram:

VorρK(P)=VorDPD(S)D, (143)

where

DPD(σ,x):=xc2w, (144)

denotes the power “distance” between a point x (and more generally a weighted point [80] when the weight can be negative) to a sphere σ=(c,w), and S={σ1=(c1,w1),,σn=(cn,wn)} is the equivalent set of weighted points. The power distance is a signed distance since we have the following property: DPD(σ,x)<0 iff xint(σ), i.e., the point x falls inside the sphere σ={x:xc22=w}. The power bisector is a hyperplane of equation

BiPD(σi,σj)=xRd:2x(cjci)+wiwj=0 (145)

Notice that by shifting all weights by a predefined constant a, we obtain the same power bisector since (wi+a)(wj+a)=wiwj is kept invariant. Thus, we may consider without loss of generality that all weights are non-negative, and that the weighted points correspond to spheres with non-negative radius ri2=wi.

By identifying Equation (142) with Equation (145), we get the following equivalent spheres σi=(ci,wi) [25] for the points in the Klein disk:

ci=pi21pi2, (146)
wi=pi2241pi2211pi22. (147)

We can then shift all weights by the constant a=mini{1,,n}wi so that wi=wi+a0.

Thus, the Klein hyperbolic Voronoi diagram is a power diagram clipped to the unit ball D [80,81,82]. In computational geometry [4], the power diagram can be calculated from the intersection of n halfspaces by lifting the spheres σi to corresponding halfspaces Hi+ of Rd+1 as follows: Let F={(x,z)Rd+1:zi=1dxi2} be the epigraph of the paraboloid function, and F denotes its boundary. We lift a point xRd to F using the upper arrow operator x=(x,z=i=1dxi2), and we project orthogonally a point (x,z) of the potential function F by dropping its last z-coordinate so that we have (x)=x. Now, when we lift a sphere σ=(c,w) to F, the set of lifted points σ all belong to a hyperplane Hσ, called the polar hyperplane of equation:

Hσ:z=2cxcc+w. (148)

Let Hσ+ denote the upper halfspace with bounding hyperplane Hσ: Hσ+:z2cxcc+w. Then one can show [4] that VorDPD(S) is obtained as the vertical projection ↓ of the intersection of all these polar halfspaces Hi with F:

VorDPD(S)=i=1nHi+F. (149)

Transforming back and forth non-vertical (d+1)-dimensional hyperplanes to corresponding d-dimensional spheres allows one to design various efficient algorithms, e.g., computing the intersection or the union of spheres [4], useful primitives for molecular chemistry [1].

Let HD denote the lower halfspace (containing the origin (x=0,z=0)) supported by the polar hyperplane associated with the boundary sphere of the disk domain D. Computing the clipped power diagram VorDPD(S)D can be done equivalently as follows:

VorDPD(S)D=i=1nHi+FHD, (150)
=i=1nHi+HDF, (151)

using the commutative property of the set intersection.

The advantage of the method of Equation (150) is that we begin to clip the power diagram using HD before explicitly calculating it. Indeed, we first compute the intersection polytope of n+1 hyperplanes PK:=i=1nHi+HD. Then we project down orthogonally the intersection of PK with F to get the clipped power diagram equivalent to the hyperbolic Klein Voronoi diagram:

VorρK(P)=PKF. (152)

By doing so, we potentially reduce the algorithmic complexity by avoiding to compute some of the vertices of PPD:=i=1nHi+ whose orthogonal projection fall outside the domain D.

More generally, a Bregman Voronoi diagram [15] can be calculated equivalently as a power diagram (and intersection of d+1-dimensional halfspaces) using an arbitrary smooth and strictly convex potential function F instead of the the paraboloid potential function of Euclidean geometry [25]. The non-empty intersection of halfspaces can in turn be calculated as an equivalent convex hull [4]. Thus, we can compute in practice the hyperbolic Voronoi diagram in the Klein model using the Quickhull algorithm [83].

7. Symbolic Calculations with a Computer Algebra System

We use the open source computer algebra system Maxima(can be freely downloaded at http://maxima.sourceforge.net/) to calculate the gradient (partial derivatives) and Hessian of the deformed log-normalizer, and some definite integrals based on the Cauchy location-scale densities.

/* Written in Maxima */

assume(s>0);

CauchyStd(x) := (1/(%pi*(x**2+1)));

Cauchy(x,l,s) := (s/(%pi*((x-l)**2+s**2)));

/* check that we get a probability density (=1) */

integrate(Cauchy(x,l,s),x,-inf,inf);

/* calculate the the deformed log-normalizer */

logC(u):=1-(1/u);

logC(Cauchy(x,l,s));

ratsimp(%);

/* calculate partial derivatives of the deformed log-normalizer */

theta(l,s):=[2*%pi*l/s,-%pi/s];

F(theta):=(-%pi**2/theta[2])-(theta[1]**2/(4*theta[2]))-1;

derivative(F(theta),theta[1],1);

derivative(F(theta),theta[2],1);

/* calculated definite integrals */

assume(s1>0);

assume(s2>0);

integrate(Cauchy(x,l2,s2)**2,x,-inf,inf);

integrate(Cauchy(x,l2,s2)**2/Cauchy(x,l1,s1),x,-inf,inf);

We calculate the function θ(η) by solving the following system of equations:

solve([-t1/(2*t2)=e1, (%pi/t2)**2+ (t1/t2)**2/4=e2],[t1, t2]);

The Hessian metrics of the dual potential functions F and F* (denoted by G in the code) can be calculated as follows:

F(theta):=(-%pi**2/theta[2])-(theta[1]**2/(4*theta[2]))-1;

hessian(F(theta),[theta[1], theta[2]]);

G(eta):=1-2*%pi*sqrt(eta[2]-eta[1]**2);

hessian(G(eta),[eta[1], eta[2]]);

The plot of the Fisher-Rao to the square root KL divergence can be plotted using the following commands:

t(u):=sqrt(log((1/2)+(1/2)*cosh(sqrt(2)*u)));

plot2d(t(u)/u,[u,0,10]);

Symbolic calculations for the α-Chernoff coefficient between two Cauchy distributions prove that the α-Chernoff coefficient is symmetric for α=3 and α=4 as exemplified by the Maxima code below:

assume(s1>0);

assume(s2>0);

assume(s>0);

CauchyStd(x) := (1/(%pi*(x**2+1)));

Cauchy(x,l,s) := (s/(%pi*((x-l)**2+s**2)));

/* closed-form */

a: 3;

integrate((Cauchy(x,l2,s2)**a) * (Cauchy(x,l1,s1)**(1-a)),x,-inf,inf);

term1(l1,s1,l2,s2):=ratsimp(%);

integrate((Cauchy(x,l2,s2)**(1-a)) * (Cauchy(x,l1,s1)**(a)),x,-inf,inf);

term2(l1,s1,l2,s2):=ratsimp(%);

/* Is the a-divergence symmetric? */

term1(l1,s1,l2,s2)-term2(l1,s1,l2,s2);

ratsimp(%);

Funding

This research received no external funding.

Conflicts of Interest

The author declares no conflict of interest.

References

  • 1.Okabe A., Boots B., Sugihara K., Chiu S.N. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Volume 501 John Wiley & Sons; Hoboken, NJ, USA: 2009. [Google Scholar]
  • 2.Aurenhammer F. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv. (CSUR) 1991;23:345–405. doi: 10.1145/116873.116880. [DOI] [Google Scholar]
  • 3.Cheng S.W., Dey T.K., Shewchuk J. Delaunay Mesh Generation. CRC Press; Boca Raton, FL, USA: 2012. [Google Scholar]
  • 4.Boissonnat J.D., Yvinec M. Algorithmic Geometry. Cambridge University Press; Cambridge, UK: 1998. [Google Scholar]
  • 5.Bogdanov M., Devillers O., Teillaud M. Hyperbolic Delaunay complexes and Voronoi diagrams made practical; Proceedings of the twenty-ninth Annual Symposium on Computational Geometry; Rio de Janeiro, Brazil. 17–20 June 2013; pp. 67–76. [Google Scholar]
  • 6.Zhang J. Divergence function, duality, and convex analysis. Neural Comput. 2004;16:159–195. doi: 10.1162/08997660460734047. [DOI] [PubMed] [Google Scholar]
  • 7.Amari S.i. Information Geometry and Its Applications. Volume 194 Springer; Berlin, Germany: 2016. [Google Scholar]
  • 8.Boissonnat J.D., Wormser C., Yvinec M. Effective Computational Geometry for Curves and Surfaces. Springer; Berlin, Germany: 2006. Curved Voronoi diagrams; pp. 67–116. [Google Scholar]
  • 9.Bregman L.M. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 1967;7:200–217. doi: 10.1016/0041-5553(67)90040-7. [DOI] [Google Scholar]
  • 10.Calin O., Udrişte C. Geometric Modeling in Probability and Statistics. Springer; Berlin, Germany: 2014. [Google Scholar]
  • 11.Nielsen F. An elementary introduction to information geometry. arXiv. 2018 doi: 10.3390/e22101100.1808.08271 [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 12.Cover T.M., Thomas J.A. Elements of Information Theory. John Wiley & Sons; Hoboken, NJ, USA: 2012. [Google Scholar]
  • 13.Eguchi S. Geometry of minimum contrast. Hiroshima Math. J. 1992;22:631–647. doi: 10.32917/hmj/1206128508. [DOI] [Google Scholar]
  • 14.Nielsen F., Hadjeres G. Monte Carlo information geometry: The dually flat case. arXiv. 20181803.07225 [Google Scholar]
  • 15.Boissonnat J.D., Nielsen F., Nock R. Bregman Voronoi diagrams. Discrete Comput. Geom. 2010;44:281–307. doi: 10.1007/s00454-010-9256-1. [DOI] [Google Scholar]
  • 16.Nielsen F., Boissonnat J.D., Nock R. Visualizing Bregman voronoi diagrams; Proceedings of the twenty-third annual symposium on Computational geometry (SoCG); Gyeongju, Korea. 6–8 June 2007; pp. 121–122. [Google Scholar]
  • 17.Rao C.R. Information and the Accuracy Attainable in the Estimation of Statistical Parameters. Bull. Cal. Math. Soc. 1945;37:81–91. [Google Scholar]
  • 18.Atkinson C., Mitchell A.F. Rao’s distance measure. Sankhyā The Indian J. Stat. Series A. 1981;43:345–365. [Google Scholar]
  • 19.Pinele J., Strapasson J.E., Costa S.I. The Fisher-Rao Distance between Multivariate Normal Distributions: Special Cases, Bounds and Applications. Entropy. 2020;22:404. doi: 10.3390/e22040404. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 20.Nielsen F., Nock R. On the chi square and higher-order chi distances for approximating f-divergences. IEEE Signal Process. Lett. 2013;21:10–13. doi: 10.1109/LSP.2013.2288355. [DOI] [Google Scholar]
  • 21.Naudts J. The q-exponential family in statistical physics. Cent. Eur. J. Phys. 2009;7:405–413. doi: 10.2478/s11534-008-0150-x. [DOI] [Google Scholar]
  • 22.Matsuzoe H., Henmi M. Geometric Theory of Information. Springer; Berlin, Germany: 2014. Hessian structures and divergence functions on deformed exponential families; pp. 57–80. [Google Scholar]
  • 23.Tsallis C. Possible generalization of Boltzmann-Gibbs statistics. J. Stat. Phys. 1988;52:479–487. doi: 10.1007/BF01016429. [DOI] [Google Scholar]
  • 24.Tsallis C. Introduction to Nonextensive Statistical Mechanics: Approaching a Complex World. Springer Science & Business Media; Berlin, Germany: 2009. [Google Scholar]
  • 25.Nielsen F., Nock R. Hyperbolic Voronoi diagrams made easy; Proceedings of the 2010 International Conference on Computational Science and Its Applications; Fukuoka, Japan. 23–26 March 2010; pp. 74–80. [Google Scholar]
  • 26.Nielsen F., Nock R. Visualizing hyperbolic Voronoi diagrams; Proceedings of the thirtieth annual symposium on Computational geometry; Kyoto, Japan. 8–11 June 2014; pp. 90–91. [Google Scholar]
  • 27.Murray M.K., Rice J.W. Differential Geometry and Statistics. Volume 48 CRC Press; Boca Raton, FL, USA: 1993. [Google Scholar]
  • 28.Mitchell A.F. Statistical manifolds of univariate elliptic distributions. Int. Stat. Rev. 1988;56:1–16. doi: 10.2307/1403358. [DOI] [Google Scholar]
  • 29.Hotelling H. Spaces of statistical parameters. Bull. Am. Math. Soc. 1930;36:191. [Google Scholar]
  • 30.Anderson J.W. Hyperbolic Geometry. Springer Science & Business Media; Berlin, Germany: 2006. [Google Scholar]
  • 31.Nielsen F., Nock R. Total Jensen divergences: Definition, properties and k-means++ clustering. arXiv. 20131309.7109 [Google Scholar]
  • 32.Nielsen F., Nock R. Total Jensen divergences: Definition, properties and clustering; Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP); Queensland, Australia. 19–24 April 2015; pp. 2016–2020. [Google Scholar]
  • 33.Nock R., Nielsen F., Amari S.i. On conformal divergences and their population minimizers. IEEE Trans. Inf. Theory. 2015;62:527–538. doi: 10.1109/TIT.2015.2448072. [DOI] [Google Scholar]
  • 34.Chen B.Y. Differential Geometry of Warped Product Manifolds And Submanifolds. World Scientific Singapore; Singapore: 2017. [Google Scholar]
  • 35.Said S., Bombrun L., Berthoumieu Y. Geometric Structures of Information. Springer; Berlin, Germany: 2019. Warped Riemannian metrics for location-scale models; pp. 251–296. [Google Scholar]
  • 36.Li W., Zhao J. Wasserstein information matrix. arXiv. 20191910.11248 [Google Scholar]
  • 37.Takatsu A. Wasserstein geometry of Gaussian measures. Osaka J. Math. 2011;48:1005–1026. [Google Scholar]
  • 38.Lauritzen S.L. Statistical manifolds. Differ. Geom. Stat. Inference. 1987;10:163–216. [Google Scholar]
  • 39.Shima H. The Geometry of Hessian Structures. World Scientific; Singapore: 2007. [Google Scholar]
  • 40.Nielsen F., Nock R. On the smallest enclosing information disk. Inf. Process. Lett. 2008;105:93–97. doi: 10.1016/j.ipl.2007.08.007. [DOI] [Google Scholar]
  • 41.Matumoto T. Any statistical manifold has a contrast function—on the C3-functions taking the minimum at the diagonal of the product manifold. Hiroshima Math. J. 1993;23:327–332. doi: 10.32917/hmj/1206128255. [DOI] [Google Scholar]
  • 42.Naudts J. Generalised Thermostatistics. Springer Science & Business Media; Berlin, Germany: 2011. [Google Scholar]
  • 43.Vigelis R.F., Cavalcante C.C. On φ-families of probability distributions. J. Theor. Probab. 2013;26:870–884. doi: 10.1007/s10959-011-0400-5. [DOI] [Google Scholar]
  • 44.Tanaya D., Tanaka M., Matsuzoe H. Recent Progress in Differential Geometry and Its Related Fields. World Scientific; Singapore: 2012. Notes on geometry of q-normal distributions; pp. 137–149. [Google Scholar]
  • 45.Amari S.i., Ohara A., Matsuzoe H. Geometry of deformed exponential families: Invariant, dually-flat and conformal geometries. Physi. A Stat. Mech. Its Appl. 2012;391:4308–4319. doi: 10.1016/j.physa.2012.04.016. [DOI] [Google Scholar]
  • 46.Onicescu O. Théorie de l’information énergie informationelle. Comptes rendus de l’Academie des Sci. Series AB. 1966;263:841–842. [Google Scholar]
  • 47.Nielsen F. A note on Onicescu’s informational energy and correlation coefficient in exponential families. arXiv. 20202003.13199 [Google Scholar]
  • 48.Crouzeix J.P. A relationship between the second derivatives of a convex function and of its conjugate. Math. Program. 1977;13:364–365. doi: 10.1007/BF01584350. [DOI] [Google Scholar]
  • 49.Ohara A. Geometric Structures of Information. Springer; Berlin, Germany: 2019. Conformal Flattening on the Probability Simplex and Its Applications to Voronoi Partitions and Centroids; pp. 51–68. [Google Scholar]
  • 50.Zhang J. A note on curvature of α-connections of a statistical manifold. Ann. Inst. Stat. Math. 2007;59:161–170. doi: 10.1007/s10463-006-0105-1. [DOI] [Google Scholar]
  • 51.Amari S.i., Cichocki A. Information geometry of divergence functions. Bull. Pol. Acad. Sci. Tech. Sci. 2010;58:183–195. doi: 10.2478/v10175-010-0019-1. [DOI] [Google Scholar]
  • 52.Matsuzoe H. Hessian structures on deformed exponential families and their conformal structures. Differ. Geom. Its Appl. 2014;35:323–333. doi: 10.1016/j.difgeo.2014.06.003. [DOI] [Google Scholar]
  • 53.Csiszár I. Information-type measures of difference of probability distributions and indirect observation. Studia Sci. Math. Hungar. 1967;2:229–318. [Google Scholar]
  • 54.Schwander O., Nielsen F. Non-flat clustering with alpha-divergences; Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP); Prague, Czech Republic. 22–27 May 2011; pp. 2100–2103. [Google Scholar]
  • 55.Nielsen F., Sun K. Combinatorial bounds on the α-divergence of univariate mixture models; Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP); New Orleans, LA, USA. 5–9 March 2017; pp. 4476–4480. [Google Scholar]
  • 56.Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 1952;23:493–507. doi: 10.1214/aoms/1177729330. [DOI] [Google Scholar]
  • 57.Nielsen F. An information-geometric characterization of Chernoff information. IEEE Signal Process. Lett. 2013;20:269–272. doi: 10.1109/LSP.2013.2243726. [DOI] [Google Scholar]
  • 58.Chyzak F., Nielsen F. A closed-form formula for the Kullback–Leibler divergence between Cauchy distributions. arXiv. 20191905.10965 [Google Scholar]
  • 59.Uhlmann J.K. Metric trees. Appl. Math. Lett. 1991;4:61–62. doi: 10.1016/0893-9659(91)90146-M. [DOI] [Google Scholar]
  • 60.Yianilos P.N. Data structures and algorithms for nearest neighbor seach in general metric spaces; Proceedings of the Symposium on Discrete Algorithms (SODA); Austin, TX, USA. 25–27 January 1993; pp. 311–321. [Google Scholar]
  • 61.Nielsen F., Piro P., Barlaud M. Bregman vantage point trees for efficient nearest neighbor queries; Proceedings of the IEEE International Conference on Multimedia and Expo; Cancun, Mexico. 28 June–3 July 2009; pp. 878–881. [Google Scholar]
  • 62.Fuglede B., Topsoe F. Jensen-Shannon divergence and Hilbert space embedding; Proceedings of the International Symposium on Information Theory (ISIT); Chicago, IL, USA. 27 June–2 July 2004; p. 31. [Google Scholar]
  • 63.Kafka P., Österreicher F., Vincze I. On powers of f-divergences defining a distance. Studia Sci. Math. Hungar. 1991;26:415–422. [Google Scholar]
  • 64.Vajda I. On metric divergences of probability measures. Kybernetika. 2009;45:885–900. [Google Scholar]
  • 65.Duin R.P.W., Elzbieta P. Dissimilarity Representation for Pattern Recognition: The Foundations and Applications. Volume 64 World Scientific; Singapore: 2005. [Google Scholar]
  • 66.Acharyya S., Banerjee A., Boley D. Bregman divergences and triangle inequality; Proceedings of the SIAM International Conference on Data Mining; San Diego, CA, USA. 8–12 July 2013; pp. 476–484. [Google Scholar]
  • 67.Nielsen F., Boltz S. The Burbea-Rao and Bhattacharyya centroids. IEEE Trans. Inf. Theory. 2011;57:5455–5466. doi: 10.1109/TIT.2011.2159046. [DOI] [Google Scholar]
  • 68.Chen P., Chen Y., Rao M. Metrics defined by Bregman divergences: Part 2. Commun. Math. Sci. 2008;6:927–948. doi: 10.4310/CMS.2008.v6.n4.a7. [DOI] [Google Scholar]
  • 69.Sra S. Positive definite matrices and the S-divergence. Proc. Am. Math. Soc. 2016;144:2787–2797. doi: 10.1090/proc/12953. [DOI] [Google Scholar]
  • 70.Nielsen F., Yvinec M. An output-sensitive convex hull algorithm for planar objects. Int. J. Comput. Geom. Appl. 1998;8:39–65. doi: 10.1142/S0218195998000047. [DOI] [Google Scholar]
  • 71.Tanuma T., Imai H., Moriyama S. Transactions on Computational Science XIV. Springer; Berlin, Germany: 2011. Revisiting hyperbolic Voronoi diagrams in two and higher dimensions from theoretical, applied and generalized viewpoints; pp. 1–30. [Google Scholar]
  • 72.DeBlois J. The Delaunay tessellation in hyperbolic space. Math. Proc. Camb. Philos. Soc. 2018;164:15–46. doi: 10.1017/S0305004116000827. [DOI] [Google Scholar]
  • 73.Sarkar R. International Symposium on Graph Drawing. Springer; Berlin, Germany: 2011. Low distortion Delaunay embedding of trees in hyperbolic plane; pp. 355–366. [Google Scholar]
  • 74.Nickel M., Kiela D. Poincaré embeddings for learning hierarchical representations; Proceedings of the Advances in Neural Information Processing Systems; Long Beach, CA, USA. 4–9 December 2017; pp. 6338–6347. [Google Scholar]
  • 75.Haas G., Bain L., Antle C. Inferences for the Cauchy distribution based on maximum likelihood estimators. Biometrika. 1970;57:403–408. [Google Scholar]
  • 76.Giménez P., López J.N., Guarracino L. Geodesic Hypothesis Testing for Comparing Location Parameters in Elliptical Populations. Sankhya A. 2016;78:19–42. doi: 10.1007/s13171-015-0068-5. [DOI] [Google Scholar]
  • 77.Delaunay B. Sur la sphère vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk. 1934;7:1–2. [Google Scholar]
  • 78.Risch R.H. The solution of the problem of integration in finite terms. Bull. Am. Math. Soc. 1970;76:605–608. doi: 10.1090/S0002-9904-1970-12454-5. [DOI] [Google Scholar]
  • 79.Komaki F. Bayesian prediction based on a class of shrinkage priors for location-scale models. Ann. Inst. Stat. Math. 2007;59:135–146. doi: 10.1007/s10463-006-0102-4. [DOI] [Google Scholar]
  • 80.Boissonnat J.D., Delage C. European Symposium on Algorithms. Springer; Berlin, Germany: 2005. Convex hull and Voronoi diagram of additively weighted points; pp. 367–378. [Google Scholar]
  • 81.Nielsen F. Japanese Conference on Discrete and Computational Geometry. Springer; Berlin, Germany: 1998. Grouping and querying: A paradigm to get output-sensitive algorithms; pp. 250–257. [Google Scholar]
  • 82.Yan D.M., Wang W., LéVy B., Liu Y. Efficient computation of clipped Voronoi diagram for mesh generation. Comput.-Aided Des. 2013;45:843–852. doi: 10.1016/j.cad.2011.09.004. [DOI] [Google Scholar]
  • 83.Barber C.B., Dobkin D.P., Huhdanpaa H. The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. (TOMS) 1996;22:469–483. doi: 10.1145/235815.235821. [DOI] [Google Scholar]

Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES