Parallel server systems in extended heavy traffic
The standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC)...
Mon compte
Pas encore inscrit ?
The standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC)...
Consider two binary trees whose leaves are labelled from 1 to n.
In Bernoulli bond percolation, each edge of some graph are chosen to be either deleted or retained independently at random with retention probability p.
We shall first recall the limits of large dense random networks, also called graphon, as well as the construction of (random) graphs sampled from graphon.
We prove the asymptotic rotational invariance of the critical FK-percolation model on the square lattice with any cluster-weight between 1 and 4.
We will consider a stochastic dynamic matching model, in which items of different classes arrive according to independent Poisson processes...
Local weak convergence of graphs, introduced by Itaï Benjamini and Oded Schramm in 2001, tries to understand the intern geometry of a typical vertex in large graphs...
We present some Poisson process approximation results for stabilizing functionals of Poisson (or Binomial) processes that arise in stochastic geometry.
A Hawkes process on the real line is a point process whose intensity function at time is a functional of its past activity before time.
We introduce spatial regulation properties for stationary spatial point processes and develop...
The work is motivated by car-sharing systems like Autolib’ in Paris (2011-2017) where, for charging, electric cars are parked in small capacity nodes.
We study approximation problems in reproducing kernel Hilbert spaces (RKHS) using random nodes.