8 citations · 20 across the 8 of their papers we have counts for
Showing 2020 · math.PRShow all
2 papers · 2 filters
math.PR2020
Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs
Paola Bermolen, Matthieu Jonckheere, Federico Larroca +1
Computing the size of maximum independent sets is a NP-hard problem for fixed graphs. Characterizing and designing efficient algorithms to estimate this independence number for ran…
math.PR2020
Large Deviation Principle for the Greedy Exploration Algorithm over Erdös-Rényi Graphs
P. Bermolen, V. Goicoechea, M. Jonckheere +1
We prove a large deviation principle for a greedy exploration process on an Erdös-Rényi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the g…