On lions, impala, and bigraphs: modelling interactions in physical/virtual spaces

While HCI has a long tradition of formally modelling task-based interactions with graphical user interfaces, there has been less progress in modelling emerging ubiquitous computing systems due in large part to their highly contextual nature and dependence on unreliable sensing systems. We present an exploration of modelling an example ubiquitous system, the Savannah game, using the mathematical formalism of bigraphs, which are based on a universal process algebra that encapsulates both dynamic and spatial behaviour of autonomous agents that interact and move among each other, or within each other. We establish a modelling approach based on four perspectives on ubiquitous systems—Computational, Physical, Human, and Technology—and explore how these interact with one another. We show how our model explains observed inconsistencies in user trials of Savannah, and then, how formal analysis reveals an incompleteness in design and guides extensions of the model and/or possible system re-design to resolve this

An elementary approach to dessins d'enfants and the Grothendieck-Teichm\"uller group

We give an account of the theory of dessins d'enfants which is both elementary and self-contained. We describe the equivalence of many categories (graphs embedded nicely on surfaces, finite sets with certain permutations, certain field extensions, and some classes of algebraic curves), some of which are naturally endowed with an action of the absolute Galois group of the rational field. We prove that the action is faithful. Eventually we prove that this absolute Galois group embeds into the Grothendieck-Teichm\"uller group $GT_0$ introduced by Drinfel'd. There are explicit approximations of $GT_0$ by finite groups, and we hope to encourage computations in this area. Our treatment includes a result which has not appeared in the literature yet: the Galois action on the subset of regular dessins - that is, those exhibiting maximal symmetry -- is also faithful.Comment: 58 pages, about 30 figures. Corrected a few typos. This version should match the published paper in L'enseignement Mathematiqu

Counting Perfect Matchings and the Switch Chain

We examine the problem of exactly or approximately counting all perfect matchings in hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain of Diaconis, Graham, and Holmes. We determine the largest hereditary class for which the chain is ergodic, and define a large new hereditary class of graphs for which it is rapidly mixing. We go on to show that the chain has exponential mixing time for a slightly larger class. We also examine the question of ergodicity of the switch chain in an arbitrary graph. Finally, we give exact counting algorithms for three classes

Domain-Specific Modelling Languages in Bigraphs

Modelling is a ubiquitous activity in human endeavours, and the construction of informatic models of many kinds is the key to understanding and managing the complexity of an increasingly computational world. We advocate the use of domain-specific modelling languages, instantiated within a “tower ” of models, in order to improve the utility of the models we build, and to ease the process of model construction by moving the languages we use to express such models closer to their respective domains. This thesis is concerned with the study of bigraphical reactive systems as a host for domain-specific modelling languages. We present a number of novel technical developments, including a new complete meta-calculus presentation of bigraphical reactive systems, an abstract machine that instantiates to an abstract machine for any instance calculi, and a mechanism for defining declaratively sorting predicates that always give rise to wellbehaved sortings. We explore bigraphical refinement relations that permit formalisation of the relationship between different languages instantiate