83 citations · 346 across the 78 of their papers we have counts for
11 papers · 1 filter
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…
Linear Colouring of Binomial Random Graphs
Austin Eide, Paweł Prałat
We investigate the linear chromatic number of the binomial random graph on vertices in which each edge appears independently with probability…
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than Rounds
Alan Frieze, Pu Gao, Calum MacRury +2
The semi-random graph process is an adaptive random graph process in which an online algorithm is initially presented an empty graph on vertices. In each round, a vertex is…
Predicting Properties of Nodes via Community-Aware Features
Bogumił Kamiński, Paweł Prałat, François Théberge +1
This paper shows how information about the network's community structure can be used to define node features with high predictive power for classification tasks. To do so, we defin…
Asynchronous Majority Dynamics on Binomial Random Graphs
Divyarthi Mohan, Pawel Pralat
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "corr…
The Fagnano Triangle Patrolling Problem
Konstantinos Georgiou, Somnath Kundu, Pawel Pralat
We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize the maximum (1-gap) id…
Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs
Ashkan Dehghan, Kinga Siuta, Agata Skorupka +4
An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, no…
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
David Gamarnik, Mihyun Kang, Pawel Pralat
The semi-random graph process is a single player game in which the player is initially presented an empty graph on vertices. In each round, a vertex is presented to the pla…
Power of Choices in the Semi-Random Graph Process
Paweł Prałat, Harjas Singh
The semi-random graph process is a single player game in which the player is initially presented an empty graph on vertices. In each round, a vertex is presented to the pla…
Label propagation on binomial random graphs
Marcos Kiwi, Lyuben Lichev, Dieter Mitsche +1
We study the behavior of a label propagation algorithm (LPA) on the Erdős-Rényi random graph . Initially, given a network, each vertex starts with a random label…
Artificial Benchmark for Community Detection with Outliers (ABCD+o)
Bogumił Kamiński, Paweł Prałat, François Théberge
The Artificial Benchmark for Community Detection graph (ABCD) is a random graph model with community structure and power-law distribution for both degrees and community sizes. The…