1 citations · 2 across the 4 of their papers we have counts for
5 papers
Achievable Burning Densities of Growing Grids
Jordan Barrett, Karen Gunderson, JD Nir +1
Graph burning is a discrete-time process on graphs where vertices are sequentially activated and burning vertices cause their neighbours to burn over time. In this work, we focus o…
The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities (ABCD+)
Jordan Barrett, Ryan DeWolfe, Bogumił Kamiński +3
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The…
Improving community detection via community association strength scores
Jordan Barrett, Ryan DeWolfe, Bogumił Kamiński +3
Community detection methods play a central role in understanding complex networks by revealing highly connected subsets of entities. However, most community detection algorithms ge…
Counting simplicial pairs in hypergraphs
Jordan Barrett, Paweł Prałat, Aaron Smith +1
We present two ways to measure the simplicial nature of a hypergraph: the simplicial ratio and the simplicial matrix. We show that the simplicial ratio captures the frequency, as w…
Self-similarity of Communities of the ABCD Model
Jordan Barrett, Bogumil Kaminski, Pawel Pralat +1
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The…