3 citations · 10 across the 12 of their papers we have counts for
30 papers
Modularity of the ABCD Random Graph Model with Community Structure
Bogumil Kaminski, Bartosz Pankratz, 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…
Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids
Natalie C. Behague, Trent Marbach, Pawel Pralat
Zero forcing is a deterministic iterative graph colouring process in which vertices are coloured either blue or white, and in every round, any blue vertices that have a single whit…
The Unit Acquisition Number of Binomial Random Graphs
Konstantinos Georgiou, Somnath Kundu, Pawel Pralat
Let be a graph in which each vertex initially has weight 1. In each step, the unit weight from a vertex to a neighbouring vertex can be moved, provided that the weight…
Hamilton Cycles in the Semi-random Graph Process
Pu Gao, Bogumil Kaminski, Calum MacRury +1
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…
Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl
Alessia Antelmi, Gennaro Cordasco, Bogumił Kamiński +4
Real-world complex networks are usually being modeled as graphs. The concept of graphs assumes that the relations within the network are binary (for instance, between pairs of node…
On Broadcasting Time in the Model of Travelling Agents
Reaz Huq, Bogumil Kaminski, Atefeh Mashatan +2
Consider the following broadcasting process run on a connected graph . Suppose that agents start on vertices selected from uniformly and independently at ran…