Related papers: Combinatorial games on multi-type Galton-Watson tr…
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
We explore the evolutionary dynamics of two games - the Prisoner's Dilemma and the Snowdrift Game - played within distinct networks (layers) of interdependent networks. In these networks imitation and interaction between individuals of…
We propose a game-theoretic dynamics of a population of replicating individuals. It consists of two parts: the standard replicator one and a migration between two different habitats. We consider symmetric two-player games with two…
We consider the problem of estimating `preference' or `strength' parameters in three-way comparison experiments, each composed of a series of paired comparisons, but where only the single `preferred' or `strongest' candidate is known in…
In this note, we introduce a unified analytic framework that connects simple varieties of trees, Bienayme-Galton-Watson processes and Khinchin families. Using Lagrange's inversion formula, we derive new coefficient-based expressions for…
Take a continuous-time Galton-Watson tree and pick $k$ distinct particles uniformly from those alive at a time $T$. What does their genealogical tree look like? The case $k=2$ has been studied by several authors, and the near-critical…
Intransitivity is a property of connected, oriented graphs representing species interactions that may drive their coexistence even in the presence of competition, the standard example being the three species Rock-Paper-Scissors game. We…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree `shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each…
This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from a fixed vertex, players take turns to move a token along…
We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…
We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…
Iterated games are a fundamental component of economic and evolutionary game theory. They describe situations where two players interact repeatedly and have the possibility to use conditional strategies that depend on the outcome of…
Parrondo's paradox is about a paradoxical game and gambling where two probabilistic losing games can be combined to form a winning game. While the counter intuitive game is interesting in itself, it can be thought of a discrete version of…
We consider here multitype Bienaym\'e--Galton--Watson trees, under the conditioning that the numbers of vertices of given type satisfy some linear relations. We prove that, under some smoothness conditions on the offspring distribution…
We consider a Galton-Watson process $\mathbf{Z}% (n)=(Z_{1}(n),Z_{2}(n))$ with two types of particles. Particles of type 2 may produce offspring of both types while particles of type 1 may produce particles of their own type only. Let…
In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to a forbidden graph F loses. A symmetric strategy of the…
We study the complexity of computing equilibria in binary public goods games on undirected graphs. In such a game, players correspond to vertices in a graph and face a binary choice of performing an action, or not. Each player's decision…
We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its…