Tiziano Squartini – författare
Visar alla böcker från författaren Tiziano Squartini. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
232 kr
Skickas inom 7-10 vardagar
Complex networks datasets often come with the problem of missing information: interactions data that have not been measured or discovered, may be affected by errors, or are simply hidden because of privacy issues. This Element provides an overview of the ideas, methods and techniques to deal with this problem and that together define the field of network reconstruction. Given the extent of the subject, the authors focus on the inference methods rooted in statistical physics and information theory. The discussion is organized according to the different scales of the reconstruction task, that is, whether the goal is to reconstruct the macroscopic structure of the network, to infer its mesoscale properties, or to predict the individual microscopic connections.
Del 11054 - Lecture Notes in Computer Science
ECML PKDD 2018 Workshops
MIDAS 2018 and PAP 2018, Dublin, Ireland, September 10-14, 2018, Proceedings
Häftad, Engelska, 2019
555 kr
Skickas inom 10-15 vardagar
This book constitutes revised selected papers from two workshops held at the 18th European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2018, in Dublin, Ireland, in September 2018, namely:MIDAS 2018 – Third Workshop on Mining Data for Financial Applications andPAP 2018 – Second International Workshop on Personal Analytics and Privacy.The 12 papers presented in this volume were carefully reviewed and selected from a total of 17 submissions.
Maximum-Entropy Networks
Pattern Detection, Network Reconstruction and Graph Combinatorics
Häftad, Engelska, 2017
699 kr
Skickas inom 10-15 vardagar
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.