Probabilistic Embedding Of Discrete Sets As Continuous Metric Spaces
classification
🧮 math-ph
math.MP
keywords
affinitydiscretemetricprobabilisticspaceadjacencycalculatedchain
read the original abstract
Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a metric topological space. We have calculated the visual representations of the probabilistic locus for a chain, a polyhedron, and a finite 2-dimensional lattice.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.