No Arabic abstract
We prove the law of large numbers for the drift of random walks on the two-dimensional lamplighter group, under the assumption that the random walk has finite $(2+epsilon)$-moment. This result is in contrast with classical examples of abelian groups, where the displacement after $n$ steps, normalised by its mean, does not concentrate, and the limiting distribution of the normalised $n$-step displacement admits a density whose support is $[0,infty)$. We study further examples of groups, some with random walks satisfying LLN for drift and other examples where such concentration phenomenon does not hold, and study relation of this property with asymptotic geometry of groups.
Let $X$ be the branching particle diffusion corresponding to the operator $Lu+beta (u^{2}-u)$ on $Dsubseteq mathbb{R}^{d}$ (where $beta geq 0$ and $beta otequiv 0$). Let $lambda_{c}$ denote the generalized principal eigenvalue for the operator $L+beta $ on $D$ and assume that it is finite. When $lambda_{c}>0$ and $L+beta-lambda_{c}$ satisfies certain spectral theoretical conditions, we prove that the random measure $exp {-lambda_{c}t}X_{t}$ converges almost surely in the vague topology as $t$ tends to infinity. This result is motivated by a cluster of articles due to Asmussen and Hering dating from the mid-seventies as well as the more recent work concerning analogous results for superdiffusions of cite{ET,EW}. We extend significantly the results in cite{AH76,AH77} and include some key examples of the branching process literature. As far as the proofs are concerned, we appeal to modern techniques concerning martingales and `spine decompositions or `immortal particle pictures.
We consider a totally monotone capacity on a Polish space and a sequence of bounded p.i.i.d. random variables. We show that, on a full set, any cluster point of empirical averages lies between the lower and the upper Choquet integrals of the random variables, provided either the random variables or the capacity are continuous.
This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in service. Under mild assumptions on the service time distribution, as the number of servers goes to infinity, a law of large numbers (or fluid) limit is established for this pair of processes. The limit is characterised as the unique solution to a coupled pair of integral equations, which admits a fairly explicit representation. As a corollary, the fluid limits of several other functionals of interest, such as the waiting time, are also obtained. Furthermore, in the time-homogeneous setting, the fluid limit is shown to converge to its equilibrium. Along the way, some results of independent interest are obtained, including a continuous mapping result and a maximality property of the fluid limit. A motivation for studying these systems is that they arise as models of computer data systems and call centers.
A many-server queue operating under the earliest deadline first discipline, where the distributions of service time and deadline are generic, is studied at the law of large numbers scale. Fluid model equations, formulated in terms of the many-server transport equation and the recently introduced measure-valued Skorohod map, are proposed as a means of characterizing the limit. The main results are the uniqueness of solutions to these equations, and the law of large numbers scale convergence to the solutions.