activity
20052026
most citedInferring the origin of an epidemic with a dynamic message-passing algorithm

327 citations · 1.2k across the 57 of their papers we have counts for

collaborators
Showing cs.SIShow all

5 papers · 1 filter

cs.SI2023

Learning of networked spreading models from noisy and incomplete data

Mateusz Wilinski, Andrey Y. Lokhov

Recent years have seen a lot of progress in algorithms for learning parameters of spreading dynamics from both full and partial data. Some of the remaining challenges include model…

cs.SI2020★ 1 cited

Prediction-Centric Learning of Independent Cascade Dynamics from Partial Observations

Mateusz Wilinski, Andrey Y. Lokhov

Spreading processes play an increasingly important role in modeling for diffusion networks, information propagation, marketing and opinion setting. We address the problem of learni…

cs.SI2019★ 11 cited

Scalable Influence Estimation Without Sampling

Andrey Y. Lokhov, David Saad

In a diffusion process on a network, how many nodes are expected to be influenced by a set of initial spreaders? This natural problem, often referred to as influence estimation, bo…

cs.SI2016★ 13 cited

Reconstructing parameters of spreading models from partial observations

Andrey Y. Lokhov

Spreading processes are often modelled as a stochastic dynamics occurring on top of a given network with edge weights corresponding to the transmission probabilities. Knowledge of…

cs.SI2016★ 79 cited

Optimal Deployment of Resources for Maximizing Impact in Spreading Processes

Andrey Y. Lokhov, David Saad

The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of "influential…