8 citations · 11 across the 3 of their papers we have counts for
3 papers
Online Change Point Detection for Weighted and Directed Random Dot Product Graphs
Bernardo Marenco, Paola Bermolen, Marcelo Fiori +2
Given a sequence of random (directed and weighted) graphs, we address the problem of online monitoring and detection of changes in the underlying data distribution. Our idea is to…
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…
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…