18 citations · 85 across the 18 of their papers we have counts for
3 papers · 1 filter
Axioms for Distanceless Graph Partitioning
James Willson, Tandy Warnow
In 2002, Kleinberg proposed three axioms for distance-based clustering, and proved that it was impossible for a clustering method to satisfy all three. While there has been much su…
Progress on Constructing Phylogenetic Networks for Languages
Tandy Warnow, Steven N. Evans, Luay Nakhleh
In 2006, Warnow, Evans, Ringe, and Nakhleh proposed a stochastic model (hereafter, the WERN 2006 model) of multi-state linguistic character evolution that allowed for homoplasy and…
Well-Connected Communities in Real-World and Synthetic Networks
Minhyuk Park, Yasamin Tabatabaee, Vikram Ramavarapu +7
Integral to the problem of detecting communities through graph clustering is the expectation that they are "well connected". In this respect, we examine five different community de…