{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":26,"n_cols":5,"rows_kept":26,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[17,2,17,3],[18,2,18,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910131281503321"]
[null,null,"Autore",null,"Kumar P.R"]
[null,null,"Titolo",null,"Mathematical Foundations of Complex Networked Information Systems : Politecnico di Torino, Verrès, Italy 2009 / / by P.R. Kumar, Martin J. Wainwright, Riccardo Zecchina ; edited by Fabio Fagnani, Sophie M. Fosson, Chiara Ravazzi"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015"]
[null,null,"ISBN",null,"3-319-16967-X"]
[null,null,"Edizione",null,"[1st ed. 2015.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VII, 135 p. 34 illus., 24 illus. in color.)"]
[null,null,"Collana",null,"C.I.M.E. Foundation Subseries ; ; 2141"]
[null,null,"Disciplina",null,"511.5"]
[null,null,"Soggetti",null,"System theory"]
[{"$nulls":4},"Graph theory"]
[{"$nulls":4},"Mathematical physics"]
[{"$nulls":4},"Physics"]
[{"$nulls":4},"Complex Systems"]
[{"$nulls":4},"Graph Theory"]
[{"$nulls":4},"Mathematical Applications in the Physical Sciences"]
[{"$nulls":4},"Applications of Graph Theory and Complex Networks"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Intro -- Preface -- Contents -- Some Introductory Notes on Random Graphs -- 1 Introduction -- 2 Generalities on Graphs -- 2.1 Basic Definitions and Notation -- 2.2 Large Scale Networks -- 3 Erdős-Rényi Model -- 3.1 Connectivity and Giant Component -- 3.2 Branching Processes -- 3.3 Behavior at the Giant Component Threshold -- 4 Configuration Model -- 4.1 Connectivity and Giant Component -- 5 Random Geometric Graph -- 5.1 Connectivity -- 5.2 Giant Component -- References -- Statistical Physics and Network Optimization Problems -- 1 Statistical Physics and Optimization -- 2 Elements of Statistical Physics -- 3 Statistical Physics Approach to Percolation in Random Graphs -- 3.1 The Potts Model Representation -- 3.1.1 Symmetric Saddle-Point -- 3.1.2 Symmetry Broken Saddle-Point -- 4 Statistical Physics Methods for More Complex Problems -- 5 Bethe Approximation and Message Passing Algorithms -- 5.1 Belief Propagation -- 5.1.1 Marginals -- 5.1.2 Free Energy -- 5.1.3 Graphs with Loops -- 5.2 The β→∞ Limit: Minsum Algorithm -- 5.3 Finding a Solution: Decimation "]
[{"$nulls":4},"and Reinforcement Algorithms -- 5.3.1 Decimation -- 5.3.2 Reinforcement -- 5.4 Replica Symmetry Breaking and Higher Levels of BP -- References -- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures -- 1 Introduction -- 2 Probability Distributions and Graphical Structure -- 2.1 Directed Graphical Models -- 2.1.1 Conditional Independence Properties for Directed Graphs -- 2.1.2 Equivalence of Representations -- 2.2 Undirected Graphical Models -- 2.2.1 Factorization for Undirected Models -- 2.2.2 Markov Property for Undirected Models -- 2.2.3 Hammersley-Clifford Equivalence -- 2.2.4 Factor Graphs -- 3 Exact Algorithms for Marginals, Likelihoods and Modes -- 3.1 Elimination Algorithm -- 3.1.1 Graph-Theoretic Versus Analytical Elimination -- 3.1.2 Complexity of Elimination."]
[{"$nulls":4},"3.2 Message-Passing Algorithms on Trees -- 3.2.1 Sum-Product Algorithm -- 3.2.2 Sum-Product on General Factor Trees -- 3.2.3 Max-Product Algorithm -- 4 Junction Tree Framework -- 4.1 Clique Trees and Running Intersection -- 4.2 Triangulation and Junction Trees -- 4.3 Constructing the Junction Tree -- 5 Basics of Graph Estimation -- 5.1 Parameter Estimation for Directed Graphs -- 5.2 Parameter Estimation for Undirected Graphs -- 5.2.1 Maximum Likelihood for Undirected Trees -- 5.2.2 Maximum Likelihood on General Undirected Graphs -- 5.2.3 Iterative Proportional Scaling -- 5.3 Tree Selection and the Chow-Liu Algorithm -- 6 Bibliographic Details and Remarks -- Appendix: Triangulation and Equivalent Graph-Theoretic Properties -- References -- Bridging the Gap Between Information Theory and WirelessNetworking -- 1 Introduction -- 2 Shannon's Point to Point Results -- 3 The Multiple-Access and Gaussian Broadcast Channels -- 4 A Spatial Model of a Wireless Network -- 5 Multi-Hop Transport -- 6 The Transport Capacity -- 7 Best Case Transport Capacity and Scaling Laws -- 8 An Upper Bound on Transport Capacity -- 9 Implication of Square-Root Law for Transport Capacity -- 10 The Need for an Information-Theoretic Analysis -- 11 Wireless Network Information Theory -- 12 Information-Theoretic Definition of Transport Capacity -- 13 Information-Theoretic Bounds -- 14 Implication of Information-Theoretic Scaling Law -- 15 Extensions -- References -- Lecture Notes in Math ematics."]
[null,null,null,"Sommario/riassunto","Introducing the reader to the mathematics beyond complex networked systems, these lecture notes investigate graph theory, graphical models, and methods from statistical physics. Complex networked systems play a fundamental role in our society, both in everyday life and in scientific research, with applications ranging from physics and biology to economics and finance. The book is self-contained, and requires only an undergraduate mathematical background."]