6 citations · 6 across the 5 of their papers we have counts for
6 papers
Transport based embeddings with topological guarantees
Erik Carlsson, John Carlsson
Point clouds arising in image collections, samples from Markov chain Monte Carlo, or states of a random walk, often have a simple underlying geometry which is obscured by noise, hi…
Alpha shapes in kernel density estimation
Erik Carlsson, John Carlsson
For every Gaussian kernel density estimator associated to a point cloud , we def…
A new construction for sublevel set persistence
Erik Carlsson, John Carlsson
We construct a filtered simplicial complex associated to a subset , a function with compactly supported sublevel sets…
Minimum size generating partitions and their application to demand fulfillment optimization problems
Bo Jones, John Gunnar Carlsson
For and integers we introduce the notion of some partition of being able to generate another partition of . We solve the problem of finding the minimum size partitio…
On the continuous Fermat-Weber problem for a convex polygon using Euclidean distance
Thomas T. C. K. Zhang, John Gunnar Carlsson
We consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expr…
Dynamic Network Models
Benjamin Armbruster, John Gunnar Carlsson
We analyze random networks that change over time. First we analyze a dynamic Erdos-Renyi model, whose edges change over time. We describe its stationary distribution, its convergen…