3 citations · 3 across the 1 of their papers we have counts for
6 papers
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…
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…
An Unsupervised Framework for Comparing Graph Embeddings
Bogumil Kaminski, Pawel Pralat, Francois Theberge
Graph embedding is a transformation of vertices of a graph into set of vectors. Good embeddings should capture the graph topology, vertex-to-vertex relationship, and other relevant…
Clustering via Hypergraph Modularity
Bogumil Kaminski, Valerie Poulin, Pawel Pralat +2
Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs a…
Subtrees of a random tree
Bogumil Kaminski, Pawel Pralat
Let be a random tree taken uniformly at random from the family of labelled trees on vertices. In this note, we provide bounds for , the number of sub-trees of tha…
Clustering Properties of Spatial Preferential Attachment Model
Lenar Iskhakov, Bogumil Kaminski, Maksim Mironov +2
In this paper, we study the clustering properties of the Spatial Preferential Attachment (SPA) model introduced by Aiello et al. in 2009. This model naturally combines geometry and…