Motif-based tests for bipartite networks

Sarah Ouadah; Pierre Latouche; Stéphane Robin

doi:10.1214/21-ejs1944

journal article Jan 01, 2022

Motif-based tests for bipartite networks

Sarah Ouadah Pierre Latouche Stéphane Robin

Electronic Journal of Statistics Vol. 16 No. 1 · Institute of Mathematical Statistics

View at Publisher Save 10.1214/21-ejs1944

Topics

No keywords indexed for this article. Browse by subject →

References

26

[1]

J. Bascompte. Mutualistic networks. Frontiers in Ecology and the Environment, 7(8):429–436, 2009. 10.1890/080026

[2]

J. Bascompte and Pedro J. The structure of plant-animal mutualistic networks. Ecological networks: linking structure to dynamics in food webs. Oxford University Press, Oxford, UK, pages 143–159, 2006. 10.1093/oso/9780195188165.003.0005

[3]

F. Chung and L. Lu. Connected components in random graphs with given expected degree sequences. Annals of combinatorics, 6(2):125–145, 2002. 10.1007/pl00012580

[4]

E. D’Bastiani, K. M. Campião, W. A. Boeger, and S. B. L Araújo. The role of ecological opportunity in shaping host–parasite networks. Parasitology, 147(13):1452–1460, 2020. 10.1017/s003118202000133x

[5]

P. Diaconis and S. Janson. Graph limits and exchangeable random graphs. Rend. Mat. Appl., 7(28):33–61, 2008.

[6]

M. Doré, C. Fontaine, and E. Thébault. Relative effects of anthropogenic pressures, climate, and sampling design on the structure of pollination networks at the global scale. Global Change Biology, 2020. 10.1111/gcb.15474

[7]

C. Gao and J. Lafferty. Testing network structure using relations between small subgraph probabilities. Technical Report 1704.06742, arXiv, 2017a.

[8]

C. Gao and J. Lafferty. Testing for global network structure using small subgraph statistics. Technical Report 1710.00862, arXiv, 2017b.

[9]

G. Govaert and M. Nadif. Block clustering with bernoulli mixture models: Comparison of different approaches. Computational Statistics & Data Analysis, 52(6):3233–3245, 2008. 10.1016/j.csda.2007.09.007

[10]

P. Hall and C. C Heyde. Martingale limit theory and its application. Academic press, 2014.

[11]

J. Jin, Z. Ke, and S. Luo. Network global testing by counting graphlets. In International Conference on Machine Learning, pages 2333–2341. PMLR, 2018.

[12]

L. Lovász and B. Szegedy. Limits of dense graph sequences. Journal of Combinatorial Theory, Series B, 96(6):933 – 957, 2006. ISSN 0095-8956. 10.1016/j.jctb.2006.05.002

[13]

Network Motifs: Simple Building Blocks of Complex Networks

R. Milo, S. Shen-Orr, S. Itzkovitz et al.

Science 10.1126/science.298.5594.824

[14]

The Structure and Function of Complex Networks

M. E. J. Newman

SIAM Review 10.1137/s003614450342480

[15]

K. Nowicki and J. C Wierman. Subgraph counts in random graphs using incomplete u-statistics methods. Discrete Mathematics, 72(1-3):299–310, 1988. 10.1016/0012-365x(88)90220-8

[16]

F. Picard, J.-J. Daudin, M. Koskas, S. Schbath, and S. Robin. Assessing the exceptionality of network motifs,. J. Comp. Biol., 15(1):1–20, 2008. 10.1089/cmb.2007.0137

[17]

C. Robertson. Flowers and insects: lists of visitors to four hundred and fifty-three flowers. carlinville, il, usa, c. robertson. National Center for Ecological Analysis and Synthesis Interaction Web Database, 456, 1929. 10.5962/bhl.title.11538

[18]

F. Saracco, R. Di Clemente, A. Gabrielli, and T. Squartini. Detecting early signs of the 2007–2008 crisis in the world trade. Scientific reports, 6(1):1–11, 2016. 10.1038/srep30286

[19]

WR Silva. Patterns of fruit-frugivore interactions in two atlantic forest bird communities of south-eastern brazil: implications for conservation. Seed dispersal and frugivory: ecology, evolution and conservation, pages 423–435, 2002. 10.1079/9780851995250.0423

[20]

B. I. Simmons, M. JM. Sweering, M. Schillinger, L. V. Dicks, W. J. Sutherland, and R. Di Clemente. bmotif: A package for motif analyses of bipartite networks. Methods in Ecology and Evolution, 10(5):695–701, 2019a. 10.1111/2041-210x.13149

[21]

B.I. Simmons, A. Cirtwill, N. Baker, L.V. Dicks, D.B. Stouffer, and W.J. Sutherland. Motifs in bipartite ecological networks: uncovering indirect interactions. Oikos, 128(2):154–170, 2019b. 10.1111/oik.05670

[22]

D. Stark. Compound poisson approximations of subgraph counts in random graphs. Random Structures & Algorithms, 18(1):39–60, 2001. 10.1002/1098-2418(200101)18:1<39::aid-rsa4>3.0.co;2-b

[23]

M. Thomas, N. Verzelen, P. Barbillon, O. T. Coomes, S. Caillon, D. McKey, M. Elias, E. Garine, C. Raimond, E. Dounias, et al. A network-based method to detect patterns of local crop biodiversity: validation at the species and infra-species levels. In Advances in Ecological Research, volume 53, pages 259–320. Elsevier, 2015. 10.1016/bs.aecr.2015.10.002

[24]

C. Vacher, D. Piou, and M. L. Desprez-Loustau. Architecture of an antagonistic tree/fungus network: the asymmetric influence of past evolutionary history. PloS one, 3(3):e1740, 2008. 10.1371/journal.pone.0001740

[25]

A. W. van der Vaart. Asymptotic statistics, volume 3. Cambridge university press, 2000.

[26]

D.P Vázquez and M.A Aizen. Asymmetric specialization: a pervasive feature of plant–pollinator interactions. Ecology, 85(5):1251–1257, 2004. 10.1890/03-3112

Metrics

6

Citations

26

References

Details

Published: Jan 01, 2022
Vol/Issue: 16(1)

Authors

S

Sarah Ouadah

UMR MIA-Paris, AgroParisTech, INRAE, Université Paris-Saclay, 75005 Paris, France MAP5, UMR CNRS 8145, Université de Paris, 75006 Paris, France

P

Pierre Latouche

MAP5, UMR CNRS 8145, Université de Paris, 75006 Paris, France

S

Stéphane Robin

UMR MIA-Paris, AgroParisTech, INRAE, Université Paris-Saclay, 75005 Paris, France CESCO, UMR 7204, MNHN - CNRS - UPMC, Paris, France

Cite This Article

Sarah Ouadah, Pierre Latouche, Stéphane Robin (2022). Motif-based tests for bipartite networks. Electronic Journal of Statistics, 16(1). https://doi.org/10.1214/21-ejs1944

Motif-based tests for bipartite networks

You May Also Like