8 citations · 20 across the 8 of their papers we have counts for
5 papers · 1 filter
Efficiency of Parallel and Restart Exploration Strategies in Model Free Stochastic Simulations
Ernesto Garcia, Paola Bermolen, Matthieu Jonckheere +1
We analyze the efficiency of parallelization and restart mechanisms for stochastic simulations in model-free settings, where the underlying system dynamics are unknown. Such settin…
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…
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…
Scaling Limits and Generic Bounds for Exploration Processes
Paola Bermolen, Matthieu Jonckheere, Jaron Sanders
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At ea…
Scaling limits for exploration algorithms
Paola Bermolen, Matthieu Jonckheere, Jaron Sanders
We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items growing to in…