18 citations · 85 across the 18 of their papers we have counts for
18 papers
Improved Community Detection using Stochastic Block Models
Minhyuk Park, Daniel Wang Feng, Siya Digra +4
Identifying edge-dense communities that are also well-connected is an important aspect of understanding community structure. Prior work has shown that community detection methods c…
Synthetic Networks That Preserve Edge Connectivity
Lahari Anne, The-Anh Vu-Le, Minhyuk Park +2
Since true communities within real-world networks are rarely known, synthetic networks with planted ground truths are valuable for evaluating the performance of community detection…
Improved Community Detection using Stochastic Block Models
Minhyuk Park, Daniel Wang Feng, Siya Digra +3
Community detection approaches resolve complex networks into smaller groups (communities) that are expected to be relatively edge-dense and well-connected. The stochastic block mod…
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…