0
Your cart

Your cart is empty

Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory

Buy Now

Maximum-Entropy Networks - Pattern Detection, Network Reconstruction and Graph Combinatorics (Paperback, 1st ed. 2017) Loot Price: R2,152
Discovery Miles 21 520
Maximum-Entropy Networks - Pattern Detection, Network Reconstruction and Graph Combinatorics (Paperback, 1st ed. 2017): Tiziano...

Maximum-Entropy Networks - Pattern Detection, Network Reconstruction and Graph Combinatorics (Paperback, 1st ed. 2017)

Tiziano Squartini, Diego Garlaschelli

Series: SpringerBriefs in Complexity

 (sign in to rate)
Loot Price R2,152 Discovery Miles 21 520 | Repayment Terms: R202 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications. Its original contribution is the reformulation of many seemingly different problems in the study of both real networks and graph theory within the unified framework of maximum entropy. Particular emphasis is put on the detection of structural patterns in real networks, on the reconstruction of the properties of networks from partial information, and on the enumeration and sampling of graphs with given properties. After a first introductory chapter explaining the motivation, focus, aim and message of the book, chapter 2 introduces the formal construction of maximum-entropy ensembles of graphs with local topological constraints. Chapter 3 focuses on the problem of pattern detection in real networks and provides a powerful way to disentangle nontrivial higher-order structural features from those that can be traced back to simpler local constraints. Chapter 4 focuses on the problem of network reconstruction and introduces various advanced techniques to reliably infer the topology of a network from partial local information. Chapter 5 is devoted to the reformulation of certain "hard" combinatorial operations, such as the enumeration and unbiased sampling of graphs with given constraints, within a "softened" maximum-entropy framework. A final chapter offers various overarching remarks and take-home messages.By requiring no prior knowledge of network theory, the book targets a broad audience ranging from PhD students approaching these topics for the first time to senior researchers interested in the application of advanced network techniques to their field.

General

Imprint: Springer International Publishing AG
Country of origin: Switzerland
Series: SpringerBriefs in Complexity
Release date: November 2017
First published: 2017
Authors: Tiziano Squartini • Diego Garlaschelli
Dimensions: 235 x 155mm (L x W)
Format: Paperback
Pages: 116
Edition: 1st ed. 2017
ISBN-13: 978-3-319-69436-8
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory
Books > Science & Mathematics > Mathematics > Applied mathematics > General
Books > Science & Mathematics > Physics > Thermodynamics & statistical physics > Statistical physics
LSN: 3-319-69436-7
Barcode: 9783319694368

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners