Drawing with distance
From MaRDI portal
Cites work
- A probability monad as the colimit of spaces of finite samples
- A Short Simple Proof of Closedness of Convex Cones and Farkas’ Lemma
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Distances between states and between predicates
- Drawing from an urn is isometric
- Drawing with distance
- Elements of Information Theory
- Foundations of modern probability. In 2 volumes
- scientific article; zbMATH DE number 3134565 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 1049043 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 1432028 (Why is no real title available?)
- scientific article; zbMATH DE number 3277086 (Why is no real title available?)
- Metrics for labelled Markov processes
- Optimal Transport
- Overdrawing urns using categories of signed probabilities
- Partitions and Ewens distributions in element-free probability theory
- Pólya-like urns and the Ewens' sampling formula
- Remarks on the Monge-Kantorovich problem in the discrete setting
- The earth mover's distance as a metric for image retrieval
- The Kantorovich metric in computer science: a brief survey
- The Poisson-Dirichlet distribution and related topics. Models and asymptotic behaviors
- Understanding and using linear programming
- Urns & Tubes
This page was built for publication: Drawing with distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987755)