9 papers
Going in Circles: Collaborative Multi-Robot Treasure Hunting
Bogumil Kaminski, Pawel Pralat, Maria Sadza
This paper investigates a multi-robot search-and-visit problem involving robots starting at the origin and unknown treasures hidden on the unit circle . The ro…
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…
A Pragmatic Method for Comparing Clusterings with Overlaps and Outliers
Ryan DeWolfe, PaweÅ PraÅat, François Théberge
Clustering algorithms are an essential part of the unsupervised data science ecosystem, and extrinsic evaluation of clustering algorithms requires a method for comparing the detect…
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…
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…