Balance between quantum Markov semigroups

The concept of balance between two state preserving quantum Markov semigroups on von Neumann algebras is introduced and studied as an extension of conditions appearing in the theory of quantum detailed balance. This is partly motivated by the theory of joinings. Balance is defined in terms of certain correlated states (couplings), with entangled states as a specific case. Basic properties of balance are derived and the connection to correspondences in the sense of Connes is discussed. Some applications and possible applications, including to non-equilibrium statistical mechanics, are briefly explored.Comment: v1: 40 pages. v2: Corrections and small additions made, 41 page

Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space

Creating a swarm of mobile computing entities frequently called robots, agents or sensor nodes, with self-organization ability is a contemporary challenge in distributed computing. Motivated by this, we investigate the plane formation problem that requires a swarm of robots moving in the three dimensional Euclidean space to land on a common plane. The robots are fully synchronous and endowed with visual perception. But they do not have identifiers, nor access to the global coordinate system, nor any means of explicit communication with each other. Though there are plenty of results on the agreement problem for robots in the two dimensional plane, for example, the point formation problem, the pattern formation problem, and so on, this is the first result for robots in the three dimensional space. This paper presents a necessary and sufficient condition for fully-synchronous robots to solve the plane formation problem that does not depend on obliviousness i.e., the availability of local memory at robots. An implication of the result is somewhat counter-intuitive: The robots cannot form a plane from most of the semi-regular polyhedra, while they can form a plane from every regular polyhedron (except a regular icosahedron), whose symmetry is usually considered to be higher than any semi-regular polyhedrdon

Comparison of random variables from a game-theoretic perspective

This work consists of four related parts, divided into eight chapters. A ¯rst part introduces the framework of cycle-transitivity, developed by De Baets et al. It is shown that this framework is ideally suited for describing and compar- ing forms of transitivity of probabilistic relations. Not only does it encompass most already known concepts of transitivity, it is also ideally suited to describe new types of transitivity that are encountered in this work (such as isostochas- tic transitivity and dice-transitivity). The author made many non-trivial and sometimes vital contributions to the development of this framework. A second part consists of the development and study of a new method to compare random variables. This method, which bears the name generalized dice model, was developed by De Meyer et al. and De Schuymer et al., and can be seen as a graded alternative to the well-known concept of ¯rst degree stochastic dominance. A third part involves the determination of the optimal strategies of three game variants that are closely related to the developed comparison scheme. The de¯nitions of these variants di®er from each other solely by the copula that is used to de¯ne the payo® matrix. It turns out however that the characterization of the optimal strategies, done by De Schuymer et al., is completely di®erent for each variant. A last part includes the study of some combinatorial problems that orig- inated from the investigation of the transitivity of probabilistic relations ob- tained by utilizing the developed method to compare random variables. The study, done by De Schuymer et al., includes the introduction of some new and interesting concepts in partition theory and combinatorics. A more thorough discussion, in which each section of this work is taken into account, can be found in the overview at the beginning of this manuscript. Although this work is oriented towards a mathematical audience, the intro- duced concepts are immediately applicable in practical situations. Firstly, the framework of cycle-transitivity provides an easy means to represent and compare obtained probabilistic relations. Secondly, the generalized dice model delivers a useful alternative to the concept of stochastic dominance for comparing random variables. Thirdly, the considered dice games can be viewed in an economical context in which competitors have the same resources and alternatives, and must choose how to distribute these resources over their alternatives. Finally, it must be noted that this work still leaves opportunities for future research. As immediate candidates we see, ¯rstly the investigation of the tran- sitivity of generalized dice models in which the random variables are pairwisely coupled by a di®erent copula. Secondly, the characterization of the transitivity of higher-dimensional dice models, starting with dimension 4. Thirdly, the study of the applicability of the introduced comparison schemes in areas such as mar- ket e±ciency, portfolio selection, risk estimation, capital budgeting, discounted cash °ow analysis, etc

Questions on transitivity

This handout (it isn’t a paper) presents phenomena and questions, rather than conclusions, related to the concept of transitivity. The idea is to return to these questions at the end of the Workshop to see if we can have a clearer consensus about the best general analysis of phenomena associated with transitivity. Section 2 presents alternative analyses of transitivity and questions about transitivity in three languages I have worked on. Section 3 discusses a few of the different conceptualisations of transitivity that might be relevant to our thinking about the questions related to these languages or that bring up further questions. Section 4 presents some general questions that might be asked of individual languages

Topics in social network analysis and network science

This chapter introduces statistical methods used in the analysis of social networks and in the rapidly evolving parallel-field of network science. Although several instances of social network analysis in health services research have appeared recently, the majority involve only the most basic methods and thus scratch the surface of what might be accomplished. Cutting-edge methods using relevant examples and illustrations in health services research are provided