Dalarna University's logo and link to the university's website

du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Modularity and anti-modularity in networks with arbitrary degree distribution
Keck Graduate Institute of Applied Life Sciences, Claremont, United States.ORCID iD: 0000-0002-4872-1961
2010 (English)In: Biology Direct, E-ISSN 1745-6150, Vol. 5, article id 32Article in journal (Refereed) Published
Abstract [en]

Background: Much work in systems biology, but also in the analysis of social network and communication and transport infrastructure, involves an in-depth analysis of local and global properties of those networks, and how these properties relate to the function of the network within the integrated system. Most often, systematic controls for such networks are difficult to obtain, because the features of the network under study are thought to be germane to that function. In most such cases, a surrogate network that carries any or all of the features under consideration, while created artificially and in the absence of any selective pressure relating to the function of the network being studied, would be of considerable interest.Results: Here, we present an algorithmic model for growing networks with a broad range of biologically and technologically relevant degree distributions using only a small set of parameters. Specifying network connectivity via an assortativity matrix allows us to grow networks with arbitrary degree distributions and arbitrary modularity. We show that the degree distribution is controlled mainly by the ratio of node to edge addition probabilities, and the probability for node duplication. We compare topological and functional modularity measures, study their dependence on the number and strength of modules, and introduce the concept of anti-modularity: a property of networks in which nodes from one functional group preferentially do not attach to other nodes of that group. We also investigate global properties of networks as a function of the network's growth parameters, such as smallest path length, correlation coefficient, small-world-ness, and the nature of the percolation phase transition. We search the space of networks for those that are most like some well-known biological examples, and analyze the biological significance of the parameters that gave rise to them.Conclusions: Growing networks with specified characters (degree distribution and modularity) provides the opportunity to create surrogates for biological and technological networks, and to test hypotheses about the processes that gave rise to them. We find that many celebrated network properties may be a consequence of the way in which these networks grew, rather than a necessary consequence of how they work or function.Reviewers: This article was reviewed by Erik van Nimwegen, Teresa Przytycka (nominated by Claus Wilke), and Leonid Mirny. For the full reviews, please go to the Reviewer's Comments section. © 2010 Hintze and Adami; licensee BioMed Central Ltd.

Place, publisher, year, edition, pages
2010. Vol. 5, article id 32
Keywords [en]
algorithm, article, biological model, biology, computer program, physiology, signal transduction, Algorithms, Computational Biology, Models, Biological, Software
National Category
Bioinformatics and Computational Biology
Identifiers
URN: urn:nbn:se:du-37201DOI: 10.1186/1745-6150-5-32Scopus ID: 2-s2.0-77951794467OAI: oai:DiVA.org:du-37201DiVA, id: diva2:1557619
Available from: 2021-05-26 Created: 2021-05-26 Last updated: 2025-10-09Bibliographically approved

Open Access in DiVA

fulltext(2316 kB)132 downloads
File information
File name FULLTEXT01.pdfFile size 2316 kBChecksum SHA-512
272c76c92df344a01dd5d9976f39ad8ae99386f660b8d34a13f9e1c9e268dc220a40df4e980049a44d9507c6ae3d43341de27b2c57756ae5f41e4ce9e89f4053
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Hintze, Arend

Search in DiVA

By author/editor
Hintze, Arend
In the same journal
Biology Direct
Bioinformatics and Computational Biology

Search outside of DiVA

GoogleGoogle Scholar
Total: 132 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 82 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf