Related papers: Buffer occupancy asymptotics in rate proportional …
This paper proposes efficient multiple-access schemes for large wireless networks based on the transmitters' buffer state information and their transceivers' duplex transmission capability. First, we investigate the case of half-duplex…
This paper provides a statistical characterization of the individual achievable rates in bits/s/Hz and the spatial throughput of bipolar Poisson wireless networks in bits/s/Hz/m$^2$. We assume that all transmitters have a cognitive ability…
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by…
In this paper, we consider the number of both arrivals and departures seen by a tagged customer while in service in a classical $M/M/1$ processor sharing queue. By exploiting the underlying orthogonal structure of this queuing system…
In join the shortest queue networks, incoming jobs are assigned to the shortest queue from among a randomly chosen subset of $D$ queues, in a system of $N$ queues; after completion of service at its queue, a job leaves the network. We also…
This paper aims to propose and theoretically analyze a new distributed scheme for sparse linear regression and feature selection. The primary goal is to learn the few causal features of a high-dimensional dataset based on noisy observations…
We consider a spatial stochastic model of wireless cellular networks, where the base stations (BSs) are deployed according to a simple and stationary point process on $\mathbb{R}^d$, $d\ge2$. In this model, we investigate tail asymptotics…
Networks play a central role in modern data analysis, enabling us to reason about systems by studying the relationships between their parts. Most often in network analysis, the edges are given. However, in many systems it is difficult or…
We present a process-level Poisson-approximation result for the degree-k vertices in a high-density weighted random connection model with preferential-attachment kernel in the unit volume. Our main focus lies on the impact of the left tails…
In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…
Consider $n$ players whose "scores" are independent and identically distributed values $\{X_i\}_{i=1}^n$ from some discrete distribution $F$. We pay special attention to the cases where (i) $F$ is geometric with parameter $p\to0$ and (ii)…
The $(d,\alpha,\beta,\gamma)$-branching particle system consists of particles moving in $R^d$ according to a symmetric $\alpha$-stable L\'evy process $(0<\alpha\leq 2)$, splitting with a critical $(1+\beta)$-branching law $(0<\beta\leq 1)$,…
This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…
Analyzing the underlying structure of multiple time-sequences provides insights into the understanding of social networks and human activities. In this work, we present the \emph{Bayesian nonparametric Poisson process allocation} (BaNPPA),…
We derive the probability distribution of the link outage duration at a typical receiver in a wireless network with Poisson distributed interferers sending messages with slotted random access over a Rayleigh fading channel. This result is…
The paper deals with non-linear Poisson neuron network models with bounded memory dynamics, that can include both Hebbian learning mechanisms and refractory periods. The state of a network is described by the times elapsed since its neurons…
Long-range dependence induced by heavy tails is a widely reported feature of internet traffic. Long-range dependence can be defined as the regular variation of the variance of the integrated process, and half the index of regular variation…
The Join-the-Shortest-Queue-d routing policy is considered for a large system with $n$ servers. Moderate deviation principles (MDP) for the occupancy process and the empirical queue length process are established as $n\to \infty$. Each MDP…
We study the optimal sequencing of a batch of tasks on a machine subject to random disruptions driven by a non-homogeneous Poisson process (NHPP), such that every disruption requires the interrupted task to be re-processed from scratch, and…
In this paper, we analyse a single server polling model with two queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues with generally distributed service…