Related papers: Multitype $\Lambda$-coalescents
We study a model of a population with individuals sampled from different species. The Yule-$\Lambda$ nested coalescent describes the genealogy of the sample when each species merges with another randomly chosen species with a constant rate…
This article shows the asymptotics of distributions of various functionals of the Beta$(2-\alpha,\alpha)$ $n$-coalescent process with $1<\alpha<2$ when $n$ goes to infinity. This process is a Markov process taking {values} in the set of…
We present a law of large numbers and a central limit theorem for the time to absorption of $\Lambda$-coalescents, started from $n$ blocks, as $n \to \infty$. The proofs rely on an approximation of the logarithm of the block-counting…
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…
We modify the definition of Aldous' multiplicative coalescent process and introduce the multiplicative coalescent with linear deletion (MCLD). A state of this process is a square-summable decreasing sequence of cluster sizes. Pairs of…
Consider a continuous-state branching population constructed as a flow of nested subordinators. Inverting the subordinators and reversing time give rise to a flow of coalescing Markov processes (with negative jumps) which correspond to the…
We inquire about the possible coexistence of macroscopic and microstructured phases in random Q-block copolymers built of incompatible monomer types A and B with equal average concentrations. In our microscopic model, one block comprises M…
We construct an extension of the Lambda-coalescent to a spatial continuum and analyse its behaviour. Like the Lambda-coalescent, the individuals in our model can be separated into (i) a dust component and (ii) large blocks of coalesced…
A system of interacting multiclass finite-state jump processes is analyzed. The model under consideration consists of a block-structured network with dynamically changing multi-colors nodes. The interaction is local and described through…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…
We show that the total number of collisions in the exchangeable coalescent process driven by the beta $(1,b)$ measure converges in distribution to a 1-stable law, as the initial number of particles goes to infinity. The stable limit law is…
Polymers consisting of more than one type of monomer, known as copolymers, are vital to both living and synthetic systems. Copolymerisation has been studied theoretically in a number of contexts, often by considering a Markov process in…
We study coming down from infinity for coordinated particle systems. In a coordinated particle system, particles live on a set of sites $V$ and are able to coalesce, migrate, reproduce, and die. The dynamics of these events are coordinated…
The $\X$-coalescent processes were initially studied by M\"ohle and Sagitov (2001), and introduced by Schweinsberg (2000) in their full generality. They arise in the mathematical population genetics as the complete class of scaling limits…
The phase behavior of a cross-linked polymer blend made of two incompatible species, $A$ and $B$, of different chemical nature is analyzed. Besides a homogeneous phase, this system also exhibits two microphases and a phase of total…
The Cyclic Coloring Conjecture asserts that the vertices of every plane graph with maximum face size D can be colored using at most 3D/2 colors in such a way that no face is incident with two vertices of the same color. The Cyclic Coloring…
We consider a model of a discrete time "interacting particle system" on the integer line where infinitely many changes are allowed at each instance of time. We describe the model using chameleons of two different colours, {\it viz}., red…
We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…
This work exhibits a novel phase transition for the classical stochastic block model (SBM). In addition we study the SBM in the corresponding near-critical regime, and find the scaling limit for the component sizes. The two-parameter…
In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…