Search Results for author:
Found 3 papers, 0 papers with code
Random walks on simplicial complexes
Whereas the Laplacian of a graph has a simple probabilistic interpretation as the generator of a continuous time Markov chain on the graph, things are not so direct when considering simplicial complexes.
Guarantees in Wasserstein Distance for the Langevin Monte Carlo Algorithm
We also look into variations of the Langevin Monte Carlo algorithm using other discretization schemes.
A Fuzzy Clustering Algorithm for the Mode Seeking Framework
In this paper, we propose a new fuzzy clustering algorithm based on the mode-seeking framework.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
