Skip to main content

Structure Comparison of Binary and Weighted Niche-Overlap Graphs

  • Conference paper
Complex Networks V

Part of the book series: Studies in Computational Intelligence ((SCI,volume 549))

  • 1219 Accesses

Abstract

In ecological networks, niche-overlap graphs are considered as complex systems. They represent the competition between two predators that share common resources. The purpose of this paper is to investigate the structural properties of these graphs considered as weighted networks and compare their measures with the ones calculated for the binary networks. To conduct this study, we select four classical network measures : the degree of nodes, the clustering coefficient, the assortativity, and the betweenness centrality. These measures were used to analyse different type of networks such as social networks, biological networks, world wide web, etc. Interestingly, we identify significant differences between the structure of the binary and the weighted niche-overlap graphs. This study indicates that weight information reveals different features that may provide other implications on the dynamics of these networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1), 47 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Newman, M.E.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Newman, M.E.: Fast algorithm for detecting community structure in networks. Physical Review E 69(6), 066133 (2004)

    Google Scholar 

  4. Little, J., Shepley, D., Wert, D.: Robustness of a gene regulatory circuit. The EMBO Journal 18(15), 4299–4307 (1999)

    Article  Google Scholar 

  5. Dunne, J.A., Williams, R.J., Martinez, N.D.: Network structure and biodiversity loss in food webs: robustness increases with connectance. Ecology Letters 5(4), 558–567 (2002)

    Article  Google Scholar 

  6. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Watts, D.J.: Small worlds: the dynamics of networks between order and randomness. Princeton University Press (1999)

    Google Scholar 

  8. Dunne, J.A., Williams, R.J., Martinez, N.D.: Small networks but not small worlds: unique aspects of food web structure. Proc. Nat. Acad. Sci. (2002)

    Google Scholar 

  9. Sokhn, N., Baltensperger, R., Hennebert, J., Ultes-Nitsche, U., Bersier, L.F.: Structure analysis of niche-overlap graphs. In: NetSci 2013 (2013)

    Google Scholar 

  10. Barabási, A.L., Albert, R., Jeong, H.: Scale-free characteristics of random networks: the topology of the world-wide web. Physica A: Statistical Mechanics and its Applications 281(1), 69–77 (2000)

    Article  Google Scholar 

  11. Ioannis, A., Eleni, T.: Statistical analysis of weighted networks. arXiv preprint arXiv:0704.0686 (2007)

    Google Scholar 

  12. Newman, M.E.: Analysis of weighted networks. Physical Review E 70(5), 056131 (2004)

    Google Scholar 

  13. Barrat, A., Barthelemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America 101(11), 3747–3752 (2004)

    Article  Google Scholar 

  14. Jaccard, P.: Distribution de la flore alpine dans la bassin de dranses et dans quelques regions voisines. Bulletin de la Societe Vaudoise des Sciences Naturelles 37, 241–272 (1901)

    Google Scholar 

  15. Newman, M.E.: Assortative mixing in networks. Physical Review Letters 89(20), 208701 (2002)

    Google Scholar 

  16. Adamic, L.A.: The small world web. In: Abiteboul, S., Vercoustre, A.-M. (eds.) ECDL 1999. LNCS, vol. 1696, pp. 443–452. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Freeman, L.C.: Centrality in social networks conceptual clarification. Social Networks 1(3), 215–239 (1979)

    Article  Google Scholar 

  18. Zhang, B., Horvath, S., et al.: A general framework for weighted gene co-expression network analysis. Statistical Applications in Genetics and Molecular Biology 4(1), 1128 (2005)

    Article  MathSciNet  Google Scholar 

  19. Kalna, G., Higham, D.J.: Clustering coefficients for weighted networks. In: Symposium on Network Analysis in Natural Sciences and Engineering, p. 45 (2006)

    Google Scholar 

  20. Lopez-Fernandez, L., Robles, G., Gonzalez-B, J.M.: Applying social network analysis to the information in cvs repositories (2004)

    Google Scholar 

  21. Onnela, J.P., Saramäki, J., Kertész, J., Kaski, K.: Intensity and coherence of motifs in weighted complex networks. Physical Review E 71(6), 065103 (2005)

    Google Scholar 

  22. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: Structure and dynamics. Physics Reports 424(4), 175–308 (2006)

    Article  MathSciNet  Google Scholar 

  23. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry, 35–41 (1977)

    Google Scholar 

  24. Grassi, R., Scapellato, R., Stefani, S., Torriero, A.: Betweenness centrality: extremal values and structural properties. In: Networks, Topology and Dynamics, pp. 161–175. Springer (2009)

    Google Scholar 

  25. Leung, C.C., Chau, H.F.: Weighted assortative and disassortative networks model. Physica A: Statistical Mechanics and its Applications 378(2), 591–602 (2007)

    Article  Google Scholar 

  26. Barthélemy, M., Barrat, A., Pastor-Satorras, R., Vespignani, A.: Characterization and modeling of weighted networks. Physica A: Statistical Mechanics and its Applications 346(1), 34–43 (2005)

    Article  Google Scholar 

  27. Saramäki, J., Kivelä, M., Onnela, J.P., Kaski, K., Kertesz, J.: Generalizations of the clustering coefficient to weighted complex networks. Physical Review E 75(2), 027105 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sokhn, N., Baltensperger, R., Bersier, LF., Ultes-Nitsche, U., Hennebert, J. (2014). Structure Comparison of Binary and Weighted Niche-Overlap Graphs. In: Contucci, P., Menezes, R., Omicini, A., Poncela-Casasnovas, J. (eds) Complex Networks V. Studies in Computational Intelligence, vol 549. Springer, Cham. https://doi.org/10.1007/978-3-319-05401-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05401-8_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05400-1

  • Online ISBN: 978-3-319-05401-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics