28 citations · 58 across the 11 of their papers we have counts for
6 papers · 1 filter
Scaling Laws for Maximum Coloring of Random Geometric Graphs
Sem Borst, Milan Bradonjić
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant…
Bootstrap Percolation on Periodic Trees
Milan Bradonjić, Iraj Saniee
We study bootstrap percolation with the threshold parameter and the initial probability on infinite periodic trees that are defined as follows. Each node of a tree ha…
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments
Milan Bradonjić, Michael Molloy, Guanhua Yan
Viral spread on large graphs has many real-life applications such as malware propagation in computer networks and rumor (or misinformation) spread in Twitter-like online social net…
On Sharp Thresholds in Random Geometric Graphs
Milan Bradonjić, Will Perkins
We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random geometric graph or hypergraph. As an application we show that a geometric model o…
Bootstrap Percolation on Random Geometric Graphs
Milan Bradonjić, Iraj Saniee
Bootstrap percolation has been used effectively to model phenomena as diverse as emergence of magnetism in materials, spread of infection, diffusion of software viruses in computer…
On the Mixing Time of Geographical Threshold Graphs
Andrew Beveridge, Milan Bradonjić
We study the mixing time of random graphs in the -dimensional toric unit cube generated by the geographical threshold graph (GTG) model, a generalization of random geo…