We model messaging activities as a hierarchical doubly stochastic point process with three main levels and develop an iterative algorithm for inferring actors' relative latent positions from a stream of messaging activity data. Each of the message-exchanging actors is modeled as a process in a latent space. The actors' latent positions are assumed to be influenced by the distribution of a much larger population over the latent space. Each actor's movement in the latent space is modeled as being governed by two parameters that we call confidence and visibility, in addition to dependence on the population distribution. The messaging frequency between a pair of actors is assumed to be inversely proportional to the distance between their latent positions. Our inference algorithm is based on a projection approach to an online filtering problem. The algorithm associates each actor with a probability density-valued process, and each probability density is assumed to be a mixture of basis functions. For efficient numerical experiments, we further develop our algorithm for the case where the basis functions are obtained by translating and scaling a standard Gaussian density.


  1. social network
  2. multiple doubly stochastic processes
  3. classification
  4. clustering

MSC codes

  1. 62M0
  2. 60G35
  3. 60G55

Get full access to this article

View all available purchase options and get full access to this article.


L. Adamic and E. Adar (2005), How to search a social network, Social Networks, 27, pp. 187--203.
P. K. Andersen, O. Borgan, R. Gill, and N. Keiding (1995), Statistical Models Based on Counting Processes, Springer, New York.
A. Bain and D. Crisan (2009), Fundamentals of Stochastic Filtering, Springer, New York.
I. Borg and P. J. F. Groenen (2005), Modern Multidimensional Scaling: Theory and Applications, Springer, New York.
P. Bremaud (1981), Point Processes and Queues, Springer, New York.
D. Brigo, B. Hanzon, and F. Le Gland (1999), Approximate nonlinear filtering by projection on exponential manifolds, Bernoulli, 5 (1999), pp. 495--534.
E. C. Chi and T. G. Kolda (2012), On tensors, sparsity, and nonnegative factorizations, SIAM J. Matrix Anal. Appl., 33, pp. 1272--1299.
M. De Choudhury, W. Mason, J. Hofman, and D. Watts (2010), Inferring relevant social networks from interpersonal communication, in Proceedings of the 19th International Conference on World Wide Web, ACM, New York, pp. 301--310.
F. Comte (1999), Discrete and continuous time cointegration, J. Econometrics, 88, pp. 207--226.
C. Cortes, D. Pregibon, and C. Volinsky (2003), Computational methods for dynamic graphs, J. Comput. Graph. Statist., 12, pp. 950--970.
J.-P. Eckmann, E. Moses, and D. Sergi (2004), Entropy of dialogues creates coherent structure in e-mail traffic, Proc. Natl. Acad. Sci. USA, 101, pp. 14333--14337.
J. Gomez-Serrano, C. Graham, and J.-Y. Le Boudec (2012), The bounded confidence model of opinion dynamics, Math. Models Methods Appl. Sci., 22, 1150007.
J. Gunther, R. Beard, J. Wilson, T. Oliphant, and W. Stirling (1997), Fast nonlinear filtering via Galerkin's method, in Proceedings of the American Control Conference.
N. Heard, D. Weston, K. Platanioti, and D. Hand (2010), Bayesian anomaly detection methods for social networks, Ann. Appl. Stat., 4, pp. 645--662.
R. Horn and C. Johnson (1985), Matrix Analysis, Cambridge University Press, Cambridge, UK.
L. Hubert and P. Arabie (1985), Comparing partitions, J. Classification, 2, pp. 193--218.
H. Kunita (1997), Stochastic Flows and Stochastic Differential Equations, Cambridge University Press, Cambridge, UK.
J. D. Lee and M. Maggioni (2011), Multiscale analysis of time series of graphs, in Proceedings of the 9th International Conference on Sampling Theory and Applications, Singapore.
N. H. Lee and C. E. Priebe (2011), A latent process model for time series of attributed random graphs, Stat. Inference Stoch. Process., 14, pp. 231--253.
P. Perry and P. Wolfe (2013), Point process modelling for directed interaction networks, J. Roy. Statist. Soc. Ser. B, 75, to appear.
W. Rand (1971), Objective criteria for the evaluation of clustering methods, J. Amer. Statist. Assoc., 66, pp. 846--850.
J. Ranola, S. Ahn, M. Sehl, D. Smith, and K. Lange (2010), A Poisson model for random multigraphs, Bioinformatics, 26, pp. 2004--2011.
D. Snyder (1975), Random Point Processes, John Wiley & Sons, New York.
A. Stomakhin, M. Short, and A. Bertozzi (2011), Reconstruction of missing data in social networks based on temporal patterns of interactions, Inverse Problems, 27, 115013.
D. W. Stroock (2008), Partial Differential Equations for Probabilists, Cambridge University Press, Cambridge, UK.
M. Tang, Y. Park, N. H. Lee, and C. E. Priebe (2013), Attribute fusion in a latent process model for time series of graphs, IEEE Trans. Signal Process., 61, pp. 1721--1732.

Information & Authors


Published In

cover image Multiscale Modeling & Simulation
Multiscale Modeling & Simulation
Pages: 683 - 718
ISSN (online): 1540-3467


Submitted: 28 May 2012
Accepted: 24 April 2013
Published online: 11 July 2013


  1. social network
  2. multiple doubly stochastic processes
  3. classification
  4. clustering

MSC codes

  1. 62M0
  2. 60G35
  3. 60G55



Metrics & Citations



If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By







Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.