Advertisement

Maximum-Entropy Networks

Pattern Detection, Network Reconstruction and Graph Combinatorics

  • Tiziano Squartini
  • Diego Garlaschelli

Part of the SpringerBriefs in Complexity book series (BRIEFSCOMPLEXITY)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Tiziano Squartini, Diego Garlaschelli
    Pages 1-6
  3. Tiziano Squartini, Diego Garlaschelli
    Pages 7-31
  4. Tiziano Squartini, Diego Garlaschelli
    Pages 33-62
  5. Tiziano Squartini, Diego Garlaschelli
    Pages 63-88
  6. Tiziano Squartini, Diego Garlaschelli
    Pages 89-108
  7. Tiziano Squartini, Diego Garlaschelli
    Pages 109-113
  8. Back Matter
    Pages 115-116

About this book

Introduction

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.

Keywords

Complex Networks Maximum-entropy Ensembles Maximum likelihood estimation Undirected networks Directed networks Weighted networks Binary networks Enhanced configuration model Bootstrap method degree-corrected gravity model triadic motifs Dyadic motifs

Authors and affiliations

  • Tiziano Squartini
    • 1
  • Diego Garlaschelli
    • 2
  1. 1.IMT School for Advanced Studies LuccaLuccaItaly
  2. 2.Lorentz Institute for Theoretical Physics, University of LeidenLeidenThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-69438-2
  • Copyright Information The Author(s) 2017
  • Publisher Name Springer, Cham
  • eBook Packages Physics and Astronomy
  • Print ISBN 978-3-319-69436-8
  • Online ISBN 978-3-319-69438-2
  • Series Print ISSN 2191-5326
  • Series Online ISSN 2191-5334
  • Buy this book on publisher's site