International audienceW-graph refers to a general class of random graph models that can be seen as a random graph limit. It is characterized by both its graphon function and its motif frequencies. In this paper, relying on an existing variational Bayes algorithm for the stochastic block models along with the corresponding weights for model averaging, we derive an estimate of the graphon function as an average of stochastic block models with increasing number of blocks. In the same framework, we derive the variational posterior frequency of any motif. A simulation study and an illustration on a social network complete our work
Learning the structure of a graphical model is a fundamental problem and it is used extensively to i...
We present a model for random simple graphs with power law (i.e., heavy-tailed) degree distributions...
It is now widely accepted that knowledge can be acquired from networks by clustering their vertices ...
International audienceW-graph refers to a general class of random graph models that can be seen as a...
W-graph refers to a general class of random graph models that can be seen as a random graph limit. I...
W-graph refers to a general class of random graph models that can be seen as a random graph limit. I...
International audienceNetworks have been widely used in many scientific fiels, and in particular in ...
We propose a nonparametric framework for the analysis of networks, based on a natural limit object t...
Graph is a natural representation of network data. Over the decades many researches have been conduc...
Inference for the stochastic blockmodel is currently of burgeoning interest in the statistical commu...
The most promising class of statistical models for expressing structural properties of social networ...
Stochastic blockmodels have been widely proposed as a probabilistic random graph model for the analy...
Abstract The Erdös–Rényi model of a network is simple and possesses many explicit expressions for av...
Learning the structure of a graphical model is a fundamental problem and it is used extensively to i...
We present a model for random simple graphs with power law (i.e., heavy-tailed) degree distributions...
It is now widely accepted that knowledge can be acquired from networks by clustering their vertices ...
International audienceW-graph refers to a general class of random graph models that can be seen as a...
W-graph refers to a general class of random graph models that can be seen as a random graph limit. I...
W-graph refers to a general class of random graph models that can be seen as a random graph limit. I...
International audienceNetworks have been widely used in many scientific fiels, and in particular in ...
We propose a nonparametric framework for the analysis of networks, based on a natural limit object t...
Graph is a natural representation of network data. Over the decades many researches have been conduc...
Inference for the stochastic blockmodel is currently of burgeoning interest in the statistical commu...
The most promising class of statistical models for expressing structural properties of social networ...
Stochastic blockmodels have been widely proposed as a probabilistic random graph model for the analy...
Abstract The Erdös–Rényi model of a network is simple and possesses many explicit expressions for av...
Learning the structure of a graphical model is a fundamental problem and it is used extensively to i...
We present a model for random simple graphs with power law (i.e., heavy-tailed) degree distributions...
It is now widely accepted that knowledge can be acquired from networks by clustering their vertices ...