On the probability that finite spaces with random distances are metric spaces (Q2570110): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Omega / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067616646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Finite Topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Partial Orders on a Finite Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for MacMahon's partition analysis / rank
 
Normal rank

Latest revision as of 17:58, 10 June 2024

scientific article
Language Label Description Also known as
English
On the probability that finite spaces with random distances are metric spaces
scientific article

    Statements

    On the probability that finite spaces with random distances are metric spaces (English)
    0 references
    0 references
    26 October 2005
    0 references
    The purpose of this paper is to start an investigation of the problem: what is the probability that a randomly chosen function on the set of all pairs of elements of a finite set is a metric? The author starts by computing this probability in the case when the set contains \(3\) and \(4\) points and `distances' are chosen independently and uniformly from the set \(\{1,2,\dots, n\}\). The corresponding results for random real distances uniformly distributed over \([0,1]\) follow easily. The complexity of computation for \(4\) points shows that exact computation for \(n\geq 5\) could be extremely difficult. The last result of the paper provides an estimate of the probability for the case of an \(M\)-point set with `distances' distributed independently and uniformly over \([0,1]\).
    0 references
    0 references
    0 references
    0 references
    0 references
    finite metric space
    0 references
    triangle inequality
    0 references
    random distance
    0 references
    0 references