10 research outputs found
Formal Groups and -Entropies
We shall prove that the celebrated R\'enyi entropy is the first example of a
new family of infinitely many multi-parametric entropies. We shall call them
the -entropies. Each of them, under suitable hypotheses, generalizes the
celebrated entropies of Boltzmann and R\'enyi.
A crucial aspect is that every -entropy is composable [1]. This property
means that the entropy of a system which is composed of two or more independent
systems depends, in all the associated probability space, on the choice of the
two systems only. Further properties are also required, to describe the
composition process in terms of a group law.
The composability axiom, introduced as a generalization of the fourth
Shannon-Khinchin axiom (postulating additivity), is a highly non-trivial
requirement. Indeed, in the trace-form class, the Boltzmann entropy and Tsallis
entropy are the only known composable cases. However, in the non-trace form
class, the -entropies arise as new entropic functions possessing the
mathematical properties necessary for information-theoretical applications, in
both classical and quantum contexts.
From a mathematical point of view, composability is intimately related to
formal group theory of algebraic topology. The underlying group-theoretical
structure determines crucially the statistical properties of the corresponding
entropies.Comment: 20 pages, no figure
Entropy modulo a prime
Building on work of Kontsevich, we introduce a definition of the entropy of a
finite probability distribution in which the "probabilities" are integers
modulo a prime p. The entropy, too, is an integer mod p. Entropy mod p is shown
to be uniquely characterized by a functional equation identical to the one that
characterizes ordinary Shannon entropy. We also establish a sense in which
certain real entropies have residues mod p, connecting the concepts of entropy
over R and over Z/pZ. Finally, entropy mod p is expressed as a polynomial which
is shown to satisfy several identities, linking into work of Cathelineau,
Elbaz-Vincent and Gangl on polylogarithms.Comment: 28 pages. v2: minor corrections and rewordings. v3: minor edits and
rewriting. To appear in Communications in Number Theory and Physic
Inference and experimental design for percolation and random graph models.
The problem of optimal arrangement of nodes of a random weighted graph is
studied in this thesis. The nodes of graphs under study are fixed, but their edges
are random and established according to the so called edge-probability function.
This function is assumed to depend on the weights attributed to the pairs of graph
nodes (or distances between them) and a statistical parameter. It is the purpose
of experimentation to make inference on the statistical parameter and thus to
extract as much information about it as possible. We also distinguish between two
different experimentation scenarios: progressive and instructive designs.
We adopt a utility-based Bayesian framework to tackle the optimal design
problem for random graphs of this kind. Simulation based optimisation methods,
mainly Monte Carlo and Markov Chain Monte Carlo, are used to obtain
the solution. We study optimal design problem for the inference based on partial
observations of random graphs by employing data augmentation technique.
We prove that the infinitely growing or diminishing node configurations asymptotically
represent the worst node arrangements. We also obtain the exact solution
to the optimal design problem for proximity graphs (geometric graphs) and numerical
solution for graphs with threshold edge-probability functions.
We consider inference and optimal design problems for finite clusters from bond
percolation on the integer lattice Zd and derive a range of both numerical and
analytical results for these graphs. We introduce inner-outer plots by deleting
some of the lattice nodes and show that the ‘mostly populated’ designs are not
necessarily optimal in the case of incomplete observations under both progressive
and instructive design scenarios.
Finally, we formulate a problem of approximating finite point sets with lattice
nodes and describe a solution to this problem
Statistical Physics of Design
Modern life increasingly relies on complex products that perform a variety of functions. The key difficulty of creating such products lies not in the manufacturing process, but in the design process. However, design problems are typically driven by multiple contradictory objectives and different stakeholders, have no obvious stopping criteria, and frequently prevent construction of prototypes or experiments. Such ill-defined, or "wicked" problems cannot be "solved" in the traditional sense with optimization methods. Instead, modern design techniques are focused on generating knowledge about the alternative solutions in the design space.
In order to facilitate such knowledge generation, in this dissertation I develop the "Systems Physics" framework that treats the emergent structures within the design space as physical objects that interact via quantifiable forces. Mathematically, Systems Physics is based on maximal entropy statistical mechanics, which allows both drawing conceptual analogies between design problems and collective phenomena and performing numerical calculations to gain quantitative understanding. Systems Physics operates via a Model-Compute-Learn loop, with each step refining our thinking of design problems.
I demonstrate the capabilities of Systems Physics in two very distinct case studies: Naval Engineering and self-assembly. For the Naval Engineering case, I focus on an established problem of arranging shipboard systems within the available hull space. I demonstrate the essential trade-off between minimizing the routing cost and maximizing the design flexibility, which can lead to abrupt phase transitions. I show how the design space can break into several locally optimal architecture classes that have very different robustness to external couplings. I illustrate how the topology of the shipboard functional network enters a tight interplay with the spatial constraints on placement. For the self-assembly problem, I show that the topology of self-assembled structures can be reliably encoded in the properties of the building blocks so that the structure and the blocks can be jointly designed.
The work presented here provides both conceptual and quantitative advancements. In order to properly port the language and the formalism of statistical mechanics to the design domain, I critically re-examine such foundational ideas as system-bath coupling, coarse graining, particle distinguishability, and direct and emergent interactions. I show that the design space can be packed into a special information structure, a tensor network, which allows seamless transition from graphical visualization to sophisticated numerical calculations.
This dissertation provides the first quantitative treatment of the design problem that is not reduced to the narrow goals of mathematical optimization. Using statistical mechanics perspective allows me to move beyond the dichotomy of "forward" and "inverse" design and frame design as a knowledge generation process instead. Such framing opens the way to further studies of the design space structures and the time- and path-dependent phenomena in design. The present work also benefits from, and contributes to the philosophical interpretations of statistical mechanics developed by the soft matter community in the past 20 years. The discussion goes far beyond physics and engages with literature from materials science, naval engineering, optimization problems, design theory, network theory, and economic complexity.PHDPhysicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/163133/1/aklishin_1.pd
Social work with airports passengers
Social work at the airport is in to offer to passengers social services. The main
methodological position is that people are under stress, which characterized by a
particular set of characteristics in appearance and behavior. In such circumstances
passenger attracts in his actions some attention. Only person whom he trusts can help him
with the documents or psychologically