165 citations · 348 across the 18 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2021★ 11 cited
Mutually exciting point process graphs for modelling dynamic networks
Francesco Sanna Passino, Nicholas A. Heard
A new class of models for dynamic networks is proposed, called mutually exciting point process graphs (MEG). MEG is a scalable network-wide statistical model for point processes wi…
cs.SI2019★ 14 cited
Bayesian estimation of the latent dimension and communities in stochastic blockmodels
Francesco Sanna Passino, Nicholas A. Heard
Spectral embedding of adjacency or Laplacian matrices of undirected graphs is a common technique for representing a network in a lower dimensional latent space, with optimal theore…