Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus on identifying simple, but prominent, structural components, as such components are easier to understand, and, once identified, can be used as building blocks to succinctly describe the network. Results: In recent social network studies, exponential random graph models have been used extensively to model global social network structure as a function of their 'local features'. Starting from those studies, we describe the exponential random graph models and demonstrate their utility in modeling the architecture of biological networks as a function of the prominence of local features. We argue that the flexibility, in terms of the number of available local feature choices, and scalability, in terms of the network sizes, make this approach ideal for statistical modeling of biological networks. We illustrate the modeling on both genetic and metabolic networks and provide a novel way of classifying biological networks based on the prevalence of their local features. © The Author 2007. Published by Oxford University Press. All rights reserved.
CITATION STYLE
Saul, Z. M., & Filkov, V. (2007). Exploring biological network structure using exponential random graph models. Bioinformatics, 23(19), 2604–2611. https://doi.org/10.1093/bioinformatics/btm370
Mendeley helps you to discover research relevant for your work.