Get 40% off select Statistics books or choose from thousands of Archive eBooks at 9.99 each!

SpringerBriefs in Complexity

Maximum-Entropy Networks

Pattern Detection, Network Reconstruction and Graph Combinatorics

Authors: Squartini, Tiziano, Garlaschelli, Diego

Free Preview
  • A complete self-consistent introduction to a general methodology to study complex networks
  • Emphasizes the connections between pattern detection, network reconstruction and graph combinatorics
Show all benefits

Buy this book

eBook 44,02 €
price for Spain (gross)
  • ISBN 978-3-319-69438-2
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 57,19 €
price for Spain (gross)
  • ISBN 978-3-319-69436-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

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.

Table of contents (6 chapters)

Table of contents (6 chapters)

Buy this book

eBook 44,02 €
price for Spain (gross)
  • ISBN 978-3-319-69438-2
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 57,19 €
price for Spain (gross)
  • ISBN 978-3-319-69436-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Maximum-Entropy Networks
Book Subtitle
Pattern Detection, Network Reconstruction and Graph Combinatorics
Authors
Series Title
SpringerBriefs in Complexity
Copyright
2017
Publisher
Springer International Publishing
Copyright Holder
The Author(s)
eBook ISBN
978-3-319-69438-2
DOI
10.1007/978-3-319-69438-2
Softcover ISBN
978-3-319-69436-8
Series ISSN
2191-5326
Edition Number
1
Number of Pages
XII, 116
Number of Illustrations
3 b/w illustrations, 31 illustrations in colour
Topics