Motif-based tests for bipartite networks

Bipartite networks are a natural representation of the interactions between entities from two different types. The organization (or topology) of such networks gives insight to understand the systems they describe as a whole. Here, we rely on motifs which provide a meso-scale description of the topology. Moreover, we consider the bipartite expected degree distribution (B-EDD) model which accounts for both the density of the network and possible imbalances between the degrees of the nodes. Under the B-EDD model, we prove the asymptotic normality of the count of any given motif, considering sparsity conditions. We also provide close-form expressions for the mean and the variance of this count. This allows to avoid computationally prohibitive resampling procedures. Based on these results, we define a goodness-of-fit test for the B-EDD model and propose a family of tests for network comparisons. We assess the asymptotic normality of the test statistics and the power of the proposed tests on synthetic experiments and illustrate their use on ecological data sets.

[1]  Chao Gao,et al.  Testing for Global Network Structure Using Small Subgraph Statistics , 2017, ArXiv.

[2]  Gérard Govaert,et al.  Block clustering with Bernoulli mixture models: Comparison of different approaches , 2008, Comput. Stat. Data Anal..

[3]  Dudley Stark,et al.  Compound Poisson approximations of subgraph counts in random graphs , 2001, Random Struct. Algorithms.

[4]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[5]  Wesley Rodrigues Silva,et al.  Patterns of fruit-frugivore interactions in two Atlantic Forest bird communities of South-eastern Brazil: implications for conservation. , 2002 .

[6]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[7]  Riccardo Di Clemente,et al.  bmotif: a package for motif analyses of bipartite networks , 2018, bioRxiv.

[8]  John C. Wierman,et al.  Subgraph counts in random graphs using incomplete u-statistics methods , 1988, Discret. Math..

[9]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[10]  William J. Sutherland,et al.  Motifs in bipartite ecological networks: uncovering indirect interactions , 2018, Oikos.

[11]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[12]  Pham Hung Cuong,et al.  A network-based method to detect patterns of local crop biodiversity: Validation at the species and infra-species levels , 2015 .

[13]  Fabio Saracco,et al.  Detecting early signs of the 2007–2008 crisis in the world trade , 2015, Scientific Reports.

[14]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[15]  Corinne Vacher,et al.  Architecture of an Antagonistic Tree/Fungus Network: The Asymmetric Influence of Past Evolutionary History , 2008, PloS one.

[16]  Franck Picard,et al.  Assessing the Exceptionality of Network Motifs , 2007, J. Comput. Biol..

[17]  W. Boeger,et al.  The role of ecological opportunity in shaping host–parasite networks , 2020, Parasitology.

[18]  P. Hall,et al.  Martingale Limit Theory and Its Application , 1980 .

[19]  P. Diaconis,et al.  Graph limits and exchangeable random graphs , 2007, 0712.2749.

[20]  É. Thébault,et al.  Relative effects of anthropogenic pressures, climate, and sampling design on the structure of pollination networks at the global scale , 2020, Global change biology.