Skip to main content

Quantification of Regulation in Networks with Positive and Negative Interaction Weights

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms
  • 42 Accesses

Years and Authors of Summarized Original Work

  • 2011; Campbell, Thakar, Albert

Problem Definition

A network representation of a complex system comprises nodes, which represent system elements, and edges, which represent interactions between the elements. Networks may be described in terms of their topology; for instance, some nodes may be connected to an atypically large number of other nodes, and some may act as bridge nodes that participate in paths between many other pairs of nodes (Fig. 1). For a review of topological network measures, see [1–3].

Quantification of Regulation in Networks with Positive and Negative Interaction Weights, Fig. 1
figure 171 figure 171

Common network measures applied to a sample 9-node network with symmetric interactions. Darker nodes have higher betweenness centrality (i.e., they tend to act as a bridge between other pairs of nodes); note that even nodes with low degree (i.e., few connections) may have high betweenness centrality. Highlighted edges show a shortest path (length...

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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

Recommended Reading

  1. Albert R, BarabĂ¡si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97. doi:10.1103/RevModPhys.74.47

    Article  MathSciNet  MATH  Google Scholar 

  2. Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford/New York

    Book  MATH  Google Scholar 

  3. Newman MEJ (2012) Communities, modules and large-scale structure in networks. Nat Phys 8:25–31. doi:10.1038/nphys2162

    Article  Google Scholar 

  4. Wang R-S, Saadatpour A, Albert R (2012) Boolean modeling in systems biology: an overview of methodology and applications. Phys Biol 9:055001. doi:10.1088/1478-3975/9/5/055001

    Article  Google Scholar 

  5. Campbell C, Yang S, Albert R, Shea K (2011) A network model for plant–pollinator community assembly. Proc Natl Acad Sci 108:197–202. doi:10.1073/pnas.1008204108

    Article  Google Scholar 

  6. Estrada E, Hatano N, Benzi M (2012) The physics of communicability in complex networks. Phys Rep 514:89–119. doi:10.1016/j.physrep.2012.01.006

    Article  MathSciNet  Google Scholar 

  7. Campbell C, Thakar J, Albert R (2011) Network analysis reveals cross-links of the immune pathways activated by bacteria and allergen. Phys Rev E 84:031929. doi:10.1103/PhysRevE.84.031929

    Article  Google Scholar 

  8. Zañudo JGT, Albert R (2013) An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks. Chaos Interdiscip J Nonlinear Sci 23:025111. doi:10.1063/1.4809777

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Campbell, C., Albert, R. (2016). Quantification of Regulation in Networks with Positive and Negative Interaction Weights. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_598

Download citation

Publish with us

Policies and ethics