Related papers: Small counts in nested Karlin's occupancy scheme g…
The occupation time of an age-dependent branching particle system in $\Rd$ is considered, where the initial population is a Poisson random field and the particles are subject to symmetric $\alpha$-stable migration, critical binary branching…
In this paper, we study a Galton-Watson process $(Z_n)$ with infinitely many types in a random ergodic environment $\bar{\xi}=(\xi_n)_{n\geq 0}$. We focus on the supercritical regime of the process, where the quenched average of the size of…
We consider the evolution of populations under the joint action of mutation and differential reproduction, or selection. The population is modelled as a finite-type Markov branching process in continuous time, and the associated…
In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…
We consider N single server infinite buffer queues with service rate \beta. Customers arrive at rate N\alpha, choose L queues uniformly, and join the shortest. We study the processes R^N for large N, where R^N_t(k) is the fraction of queues…
We study a discrete time multitype branching random walk on a finite space with finite set of types. Particles follow a Markov chain on the spatial space whereas offspring distributions are given by a random field that is fixed throughout…
In a large-momentum nucleon state, the matrix element of a gauge-invariant Euclidean Wilson line operator accessible from lattice QCD can be related to the standard light-cone parton distribution function through the large-momentum…
We study emergent dynamics of the discrete Cucker-Smale (in short, DCS) model with randomly switching network topologies. For this, we provide a sufficient framework leading to the stochastic flocking with probability one. Our sufficient…
We propose a practical finite volume method on cut cells using state redistribution. Our algorithm is provably monotone, total variation diminishing, and GKS stable in many situations, and shuts off continuously as the cut cell size…
A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…
A discrete time branching process where the offspring distribution is generation-dependent, and the number of reproductive individuals is controlled by a random mechanism is considered. This model is a Markov chain but, in general, the…
Let $(\xi_k, \eta_k)_{k\geq 1}$be independent identically distributed random vectors with arbitrarily dependent positive components and $T_k:=\xi_1+\ldots+\xi_{k-1}+\eta_k$for $k\in\mathbb{N}$. We call the random sequence {T_k, k=1,2...} a…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
We study the infinite urn scheme when the balls are sequentially distributed over an infinite number of urns labelled 1,2,... so that the urn $j$ at every draw gets a ball with probability $p_j$, $\sum_j p_j=1$. We prove functional central…
In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We…
We consider a trait-structured population subject to mutation, birth and competition of logistic type, where the number of coexisting types may fluctuate. Applying a limit of rare mutations to this population while keeping the population…
Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a new box-covering algorithm that is a modified version of the original…
Joint distribution function of N eigenvalues of U(N) invariant random-matrix ensemble can be interpreted as a probability density to find N fictitious non-interacting fermions to be confined in a one-dimensional space. Within this picture a…
Recently observed empirical scaling laws describe the performance of foundation-type models as three independent key quantities -- dataset size, compute, and model parameters -- are modified. Extracting these scaling laws informs the…
Every exchangeable Feller process taking values in a suitably nice combinatorial state space can be constructed by a system of iterated random Lipschitz functions. In discrete time, the construction proceeds by iterated application of…