In this paper we propose methodology for inference of binary-valued adjacency matrices from various measures of the strength of association between pairs of network nodes, or more generally pairs of variables. This strength of association can be quantified by sample covariance and cor- relation matrices, and more generally by test-statistics and hypothesis test p-values from arbitrary distributions. Community detection methods such as block modelling typically require binary-valued adjacency matrices as a starting point. Hence, a main motivation for the methodology we propose is to obtain binary-valued adjacency matrices from such pairwise measures of strength of association between variables. The proposed methodology is applicable t...
A challenging problem in the study of complex systems is that of resolving, without prior informatio...
Identifying communities within networks is a crucial and challenging problem with practical implicat...
[[abstract]]Based on Newman's fast algorithm, in this paper we develop a general probabilistic frame...
Community detection is an important problem when processing network data. Traditionally, this is don...
Networks with node covariates offer two advantages to community detection methods, namely, (i) explo...
Community detection or clustering is a fundamental task in the analysis of network data. Most networ...
International audienceCommunities are an important type of structure in networks. Graph filters, suc...
Recent advances in computing and measurement technologies have led to an explosion in the amount of ...
Community detection is an exploratory method of grouping strongly connected nodes in a network, in m...
Networks have been widely used to describe interactions among objects in diverse fields. Given the i...
Community detection or clustering is a fundamental task in the analysis of network data. Many real n...
This paper introduces the notion of comodularity, to cocluster observations of bipartite networks in...
In this work we describe a novel method to integrate graph theoretic and stochastic block models by ...
Network data has arisen as one of the most common forms of information collection. This is due to th...
International audienceCommunity detection in networks consists in finding groups of individuals such...
A challenging problem in the study of complex systems is that of resolving, without prior informatio...
Identifying communities within networks is a crucial and challenging problem with practical implicat...
[[abstract]]Based on Newman's fast algorithm, in this paper we develop a general probabilistic frame...
Community detection is an important problem when processing network data. Traditionally, this is don...
Networks with node covariates offer two advantages to community detection methods, namely, (i) explo...
Community detection or clustering is a fundamental task in the analysis of network data. Most networ...
International audienceCommunities are an important type of structure in networks. Graph filters, suc...
Recent advances in computing and measurement technologies have led to an explosion in the amount of ...
Community detection is an exploratory method of grouping strongly connected nodes in a network, in m...
Networks have been widely used to describe interactions among objects in diverse fields. Given the i...
Community detection or clustering is a fundamental task in the analysis of network data. Many real n...
This paper introduces the notion of comodularity, to cocluster observations of bipartite networks in...
In this work we describe a novel method to integrate graph theoretic and stochastic block models by ...
Network data has arisen as one of the most common forms of information collection. This is due to th...
International audienceCommunity detection in networks consists in finding groups of individuals such...
A challenging problem in the study of complex systems is that of resolving, without prior informatio...
Identifying communities within networks is a crucial and challenging problem with practical implicat...
[[abstract]]Based on Newman's fast algorithm, in this paper we develop a general probabilistic frame...