Related papers: On nested infinite occupancy scheme in random envi…
In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
This article examines differentiability properties of the value function of positioning choice problems, a class of optimisation problems in finite-dimensional Euclidean spaces. We show that positioning choice problems' value function is…
Population structure induced by both spatial embedding and more general networks of interaction, such as model social networks, have been shown to have a fundamental effect on the dynamics and outcome of evolutionary games. These effects…
Let A(n) be a sequence of i.i.d. topical (i.e. isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n,x_0)=A(n)x(n-1,x_0)$. This can modelize a wide range of systems including, task graphs, train…
We consider the exchangeable fragmentation-coagulation (EFC) processes, where the coagulations are multiple and not simultaneous, as in a $\Lambda$-coalescent, and the fragmentations dislocate at finite rate an individual block into…
We examine a family of discrete probability distributions that describes the "spillage number" in the extended balls-in-bins model. The spillage number is defined as the number of balls that occupy their bins minus the total number of…
We study the distribution of several statistics of large non-crossing partitions. First, we prove the Gaussian limit theorem for the number of blocks of a given fixed size. In contrast to the properties of usual set partitions, we show that…
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some…
We introduce a new basic model for independent and identical distributed sequence on the canonical space $(\mathbb{R}^\mathbb{N},\mathcal{B}(\mathbb{R}^\mathbb{N}))$ via probability kernels with model uncertainty. Thanks to the well-defined…
A pair of lower and upper cumulative distribution functions, also called probability box or p-box, is among the most popular models used in imprecise probability theory. They arise naturally in expert elicitation, for instance in cases…
We prove distributional limit theorems and one-sided laws of the iterated logarithm for a class of positive, mixing, stationary, stochastic processes which contains those obtained from non-integrable observables over certain piecewise…
In the context of a large class of stochastic processes used to describe the dynamics of wealth growth, we prove a set of inequalities establishing necessary and sufficient conditions in order to avoid infinite wealth concentration. These…
Viewing stochastic processes through the lens of occupation measures has proved to be a powerful angle of attack for the theoretical and computational analysis of stochastic optimal control problems. We present a simple modification of the…
We consider a load balancing model where a Poisson stream of jobs arrive at a system of many servers whose service time distribution possesses a finite second moment. A small fraction of arrivals pass through the so called power-of-choice…
We investigate the random permutation matrices induced by the Chinese restaurant processes with $(\alpha,\theta)$-seating. When $\alpha=0,\theta>0$, the permutations are those following Ewens measures on symmetric groups, and have been…
We present a simple discrete model for the non-linear spatial interaction of different kinds of ``subpopulations'' composed of identical moving entities like particles, bacteria, individuals, etc. The model allows to mimic a variety of…
This paper introduces a systematic methodological framework to design and analyze distributed algorithms for optimization and games over networks. Starting from a centralized method, we identify an aggregation function involving all the…
This work describes the statistics for the occupation numbers of quantum levels in a large isolated quantum system, where all possible superpositions of eigenstates are allowed, provided all these superpositions have the same fixed energy.…
For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…