Markov Random Walk Representations with Continuous Distributions

10/19/2012
by   Chen-Hsiang Yeang, et al.
0

Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a diffusion equation with a diffusion coefficient that inversely depends on the data density. We relate this diffusion equation to a path integral and derive the corresponding path probability measure. The framework is useful for incorporating continuous data densities and prior knowledge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2023

Diffusion on the Probability Simplex

Diffusion models learn to reverse the progressive noising of a data dist...
research
03/06/2020

Sensitivity of Uncertainty Propagation for the Elliptic Diffusion Equation

For elliptic diffusion equations with random coefficient and source term...
research
05/09/2018

Diffusion Based Network Embedding

In network embedding, random walks play a fundamental role in preserving...
research
09/27/2017

The Elephant Quantum Walk

We explore the impact of long-range memory on the properties of a family...
research
01/10/2023

Discrete mixture representations of spherical distributions

We obtain discrete mixture representations for parametric families of pr...
research
07/15/2020

Network navigation using Page Rank random walks

We introduce a formalism based on a continuous time approximation, to st...
research
09/06/2022

Three Distributions in the Extended Occupancy Problem

The classical and extended occupancy distributions are useful for examin...

Please sign up or login with your details

Forgot password? Click here to reset