Probabilistic embedding of discrete sets as continuous metric spaces

DOI10.1080/17442500902917326MaRDI QIDQ3396067zbMATH OpenOpenAlexFDO

Authors

Publication date 16 September 2009

Published in Stochastics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0804.4434

zbMATH Keywords

Euclidean spaceprobabilistic analoguerandom walk

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

Abstract: Any symmetric affinity function $w:VimesVomathbb{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.

Recommendations

• Representation of graphs by means of generalized metrics
• scientific article; zbMATH DE number 510758
• Metric Transforms and Euclidean Embeddings
• Probabilistic properties of topologies of minimal fillings of finite metric spaces
• Local embeddings of metric spaces

Cites work

• A course in metric geometry
• scientific article; zbMATH DE number 3737983 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• Lower bounds for covering times for reversible Markov chains and random walks on graphs

Cited in

(1)

• Flux through a Markov chain

This page was built for publication: Probabilistic embedding of discrete sets as continuous metric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396067)