8 citations · 12 across the 4 of their papers we have counts for
4 papers
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes
Hassan Ashtiani, Shai Ben-David, Nick Harvey +3
We prove that samples are necessary and sufficient for learning a mixture of Gaussians in , up to error in total va…
Notes on Growing a Tree in a Graph
Luc Devroye, Vida Dujmović, Alan Frieze +3
We study the height of a spanning tree of a graph obtained by starting with a single vertex of and repeatedly selecting, uniformly at random, an edge of with exactl…
On the Longest Paths and the Diameter in Random Apollonian Networks
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao +4
We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at ran…
On the Maximum Density of Graphs with Good Edge-Labellings
Abbas Mehrabian, Dieter Mitsche, Paweł Prałat
A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasin…