1 citations · 1 across the 8 of their papers we have counts for
5 papers · 1 filter
Twinning Complex Networked Systems: Data-Driven Calibration of the mABCD Synthetic Graph Generator
Piotr Bródka, Michał Czuba, Bogumił Kamiński +4
The increasing availability of relational data has contributed to a growing reliance on network-based representations of complex systems. Over time, these models have evolved to ca…
The Needle is a Thread: Finding Planted Paths in Noisy Process Trees
Maya Le, Paweł Prałat, Aaron Smith +1
Motivated by applications in cybersecurity such as finding meaningful sequences of malware-related events buried inside large amounts of computer log data, we introduce the "plante…
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…