CENTRAL LIBRARY

Welcome to Online Public Access Catalogue (OPAC)

Amazon cover image
Image from Amazon.com

Advances in network complexity / edited by Matthias Dehmer, Abbe Mowshowitz, and Frank Emmert-Streib.

Contributor(s): Material type: TextTextSeries: Quantitative and network biology ; v. 4.Publication details: Weinheim, Germany : Wiley-Blackwell, [2013]Description: 1 online resource (xiv, 293 pages .)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783527670475
  • 3527670475
  • 1299701469
  • 9781299701465
  • 9783527670499
  • 3527670491
  • 9783527670468
  • 3527670467
  • 352733291X
  • 9783527332915
Subject(s): Genre/Form: Additional physical formats: Print version:: No titleDDC classification:
  • 574.028 23
LOC classification:
  • QH324
Online resources:
Contents:
1. Functional complexity based on topology -- 2. Connections between artificial intelligence and conputational complexity and the complexity of graphs -- 3. Selection-based estimates of complexity unravel some mechanisms and selective pressures underlying the evolution of complexity in artificial networks -- 4. Three types of network complexity pyramid -- 5. Computational complexity of graphs -- 6. The linear complexity of a graph -- 7. Kirchhoff's matrix-tree theorem revisited: counting spanning trees with the quantum relative entropy -- 8. Dimension measure for complex networks -- 9. Information-based complexity of networks -- 10. Thermodynamic depth in undirected and directed networks -- 11. Circumscribed complexity in ecological networks -- 12. Metros as biological systems complexity in small real-life networks.
Summary: A well-balanced overview of mathematical approaches to describe complex systems, ranging from chemical reactions to gene regulation networks, from ecological systems to examples from social sciences. Matthias Dehmer and Abbe Mowshowitz, a well-known pioneer in the field, co-edit this volume and are careful to include not only classical but also non-classical approaches so as to ensure topicality. Overall, a valuable addition to the literature and a must-have for anyone dealing with complex systems.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Includes bibliographical references and index.

Online resource; title from PDF title page (Wiley, viewed July 24, 2013).

A well-balanced overview of mathematical approaches to describe complex systems, ranging from chemical reactions to gene regulation networks, from ecological systems to examples from social sciences. Matthias Dehmer and Abbe Mowshowitz, a well-known pioneer in the field, co-edit this volume and are careful to include not only classical but also non-classical approaches so as to ensure topicality. Overall, a valuable addition to the literature and a must-have for anyone dealing with complex systems.

1. Functional complexity based on topology -- 2. Connections between artificial intelligence and conputational complexity and the complexity of graphs -- 3. Selection-based estimates of complexity unravel some mechanisms and selective pressures underlying the evolution of complexity in artificial networks -- 4. Three types of network complexity pyramid -- 5. Computational complexity of graphs -- 6. The linear complexity of a graph -- 7. Kirchhoff's matrix-tree theorem revisited: counting spanning trees with the quantum relative entropy -- 8. Dimension measure for complex networks -- 9. Information-based complexity of networks -- 10. Thermodynamic depth in undirected and directed networks -- 11. Circumscribed complexity in ecological networks -- 12. Metros as biological systems complexity in small real-life networks.

There are no comments on this title.

to post a comment.

Khulna University of Engineering & Technology

Funded by: HEQEP, UGC, Bangladesh