*Proceedings of the 31st International Conference on Machine Learning (ICML)*.

Networks play a central role in modern data analysis, enabling us to reason about systems by studying the relationships between their parts. Most often in network analysis, the edges are given. However, in many systems it is difficult or impossible to measure the network directly. Examples of latent networks include economic interactions linking financial instruments and patterns of reciprocity in gang violence. In these cases, we are limited to noisy observations of events associated with each node. To enable analysis of these implicit networks, we develop a probabilistic model that combines mutually-exciting point processes with random graph models. We show how the Poisson superposition principle enables an elegant auxiliary variable formulation and a fully-Bayesian, parallel inference algorithm. We evaluate this new model empirically on several datasets.

@conference{linderman2014networks, year = {2014}, author = {Linderman, Scott W. and Adams, Ryan P.}, title = {Discovering Latent Network Structure in Point Process Data}, booktitle = {Proceedings of the 31st International Conference on Machine Learning (ICML)}, keywords = {ICML, Hawkes process, time series, Bayesian methods}, note = {arXiv:1402.0914 [stat.ML]} }