Narrow your search
Listing 1 - 9 of 9
Sort by

Book
The maximum entropy formalism : a conference held at the Massachusetts Institute of Technology on May 2-4, 1978
Authors: --- --- ---
ISBN: 0262120801 9780262120807 Year: 1979 Publisher: Cambridge, Mass. : MIT Press,

Data analysis : a Bayesian tutorial
Authors: ---
ISBN: 128134138X 0191546704 9780191546709 9786611341381 6611341382 9780198568315 0198568312 0198568320 9780198568322 1383029814 Year: 2023 Publisher: Oxford : Oxford University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Focusing on Bayesian methods and maximum entropy, this book shows how a few fundamental rules can be used to tackle a variety of problems in data analysis. Topics covered include reliability analysis, multivariate optimisation, least-squares and maximum likelihood, and more.


Book
Non-Extensive Entropy Econometrics for Low Frequency Series : National Accounts-Based Inverse Problems
Author:
ISBN: 3110550768 311055044X 3110550431 Year: 2017 Publisher: De Gruyter

Loading...
Export citation

Choose an application

Bookmark

Abstract

Non-extensive Entropy Econometrics for Low Frequency Series provides a new and robust power-law-based, non-extensive entropy econometrics approach to the economic modelling of ill-behaved inverse problems. Particular attention is paid to national account-based general equilibrium models known for their relative complexity.In theoretical terms, the approach generalizes Gibbs-Shannon-Golan entropy models, which are useful for describing ergodic phenomena. In essence, this entropy econometrics approach constitutes a junction of two distinct concepts: Jayne's maximum entropy principle and the Bayesian generalized method of moments. Rival econometric techniques are not conceptually adapted to solving complex inverse problems or are seriously limited when it comes to practical implementation. Recent literature showed that amplitude and frequency of macroeconomic fluctuations do not substantially diverge from many other extreme events, natural or human-related, once they are explained in the same time (or space) scale. Non-extensive entropy is a precious device for econometric modelling even in the case of low frequency series, since outputs evolving within the Gaussian attractor correspond to the Tsallis entropy limiting case of Tsallis q-parameter around unity. This book introduces a sub-discipline called Non-extensive Entropy Econometrics or, using a recent expression, Superstar Generalised Econometrics. It demonstrates, using national accounts-based models, that this approach facilitates solving nonlinear, complex inverse problems, previously considered intractable, such as the constant elasticity of substitution class of functions. This new proposed approach could extend the frontier of theoretical and applied econometrics.


Book
Maximum-Entropy Networks : Pattern Detection, Network Reconstruction and Graph Combinatorics
Authors: ---
ISBN: 3319694383 3319694367 Year: 2017 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Listing 1 - 9 of 9
Sort by