Diversity (mathematics)

From testwiki
Revision as of 21:28, 8 January 2025 by imported>Mgkrupa (Added {{Metric spaces}})
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Multiple issues

In mathematics, a diversity is a generalization of the concept of metric space. The concept was introduced in 2012 by Bryant and Tupper,[1] who call diversities "a form of multi-way metric".[2] The concept finds application in nonlinear analysis.[3]

Given a set X, let fin(X) be the set of finite subsets of X. A diversity is a pair (X,δ) consisting of a set X and a function δ:fin(X) satisfying

(D1) δ(A)0, with δ(A)=0 if and only if |A|1

and

(D2) if B then δ(AC)δ(AB)+δ(BC).

Bryant and Tupper observe that these axioms imply monotonicity; that is, if AB, then δ(A)δ(B). They state that the term "diversity" comes from the appearance of a special case of their definition in work on phylogenetic and ecological diversities. They give the following examples:

Diameter diversity

Let (X,d) be a metric space. Setting δ(A)=maxa,bAd(a,b)=diam(A) for all Afin(X) defines a diversity.

LTemplate:Sub diversity

For all finite An if we define δ(A)=imaxa,b{|aibi|:a,bA} then (n,δ) is a diversity.

Phylogenetic diversity

If T is a phylogenetic tree with taxon set X. For each finite AX, define δ(A) as the length of the smallest subtree of T connecting taxa in A. Then (X,δ) is a (phylogenetic) diversity.

Steiner diversity

Let (X,d) be a metric space. For each finite AX, let δ(A) denote the minimum length of a Steiner tree within X connecting elements in A. Then (X,δ) is a diversity.

Truncated diversity

Let (X,δ) be a diversity. For all Afin(X) define δ(k)(A)=max{δ(B):|B|k,BA}. Then if k2, (X,δ(k)) is a diversity.

Clique diversity

If (X,E) is a graph, and δ(A) is defined for any finite A as the largest clique of A, then (X,δ) is a diversity.

References

Template:Reflist

Template:Metric spaces Template:Metric-geometry-stub