C Matias, S Robin - ESAIM: Proceedings and Surveys, 2014 - esaim-proc.org
Modeling heterogeneity in random graphs through latent space models: a selective review\* Page 1 ESAIM: PROCEEDINGS AND SURVEYS, December 2014, Vol. 47, p. 55-74 F …
Discovering and characterizing the large-scale topological features in empirical networks are crucial steps in understanding how complex systems function. However, most existing …
PN Krivitsky - Electronic journal of statistics, 2012 - ncbi.nlm.nih.gov
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for …
Species are linked to each other by a myriad of positive and negative interactions. This complex spectrum of interactions constitutes a network of links that mediates ecological …
We present asymptotic and finite-sample results on the use of stochastic blockmodels for the analysis of network data. We show that the fraction of misclassified network nodes …
We present an efficient algorithm for the inference of stochastic block models in large networks. The algorithm can be used as an optimized Markov chain Monte Carlo (MCMC) …
The stochastic block model (SBM) is a probabilistic model designed to describe heterogeneous directed and undirected graphs. In this paper, we address the asymptotic …
Many network systems are composed of interdependent but distinct types of interactions, which cannot be fully understood in isolation. These different types of interactions are often …