Maximum Entropy in Actio

The book describes a useful tool for solving linear inverse problems subject to convex constraints. The method of maximum entropy in the mean automatically takes care of the constraints. It consists of a technique for transforming a large dimensional inverse problem into a small dimensional non-linear variational problem.
A variety of mathematical aspects of the maximum entropy method are explored as well.

This volume has its origin in the Fifth, Sixth and Seventh Workshops on and Bayesian Methods in Applied Statistics", held at "Maximum-Entropy the University of Wyoming, August 5-8, 1985, and at Seattle University, August 5-8, 1986, and August 4-7, 1987.

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

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.

The last two decades have witnessed an enormous growth with regard to ap­ plications of information theoretic framework in areas of physical, biological, engineering and even social sciences. In particular, growth has been spectac­ ular in the field of information technology,soft computing,nonlinear systems and molecular biology. Claude Shannon in 1948 laid the foundation of the field of information theory in the context of communication theory. It is in­ deed remarkable that his framework is as relevant today as was when he 1 proposed it. Shannon died on Feb 24, 2001. Arun Netravali observes "As if assuming that inexpensive, high-speed processing would come to pass, Shan­ non figured out the upper limits on communication rates.