arXiv subjects

Laurent Decreusefond

Publications and source records attributed to Laurent Decreusefond.

66 records · Page 4Linked to original sources

arXiv2012

Robust methods for LTE and WiMAX dimensioning

This paper proposes an analytic model for dimensioning OFDMA based networks like WiMAX and LTE systems. In such a system, users require a number of subchannels which depends on their \SNR, hence of their position and the shadowing they experience. The system is overloaded when the number of required subchannels is greater than the number of available subchannels. We give an exact though not closed expression of the loss probability and then give an algorithmic method to derive the number of subchannels which guarantees a loss probability less than a given threshold. We show that Gaussian approximation lead to optimistic values and are thus unusable. We then introduce Edgeworth expansions with error bounds and show that by choosing the right order of the expansion, one can have an approximate dimensioning value easy to compute but with guaranteed performance. As the values obtained are highly dependent from the parameters of the system, which turned to be rather undetermined, we provide a procedure based on concentration inequality for Poisson functionals, which yields to conservative dimensioning. This paper relies on recent results on concentration inequalities and establish new results on Edgeworth expansions.

cs.RO↗

arXiv2010

On noise limited cellular networks

This paper introduces a general theoretical framework to analyze noise limited networks. More precisely, we consider two homogenous Poisson point processes of base stations and users. General model of radio signal propagation and effect of fading are also considered. The main difference of our model with respect to other existing models is that a user connects to his best servers but not necessarily the closest one. We provide general formula for the outage probability. We study functionals related to the SNR as well as the sum of these functionals over all users per cell. For the latter, the expectation and bounds on the variance are obtained.

math.PR↗

arXiv2010

An analytical model for evaluating outage and handover probability of cellular wireless networks

We consider stochastic cellular networks where base stations locations form a homogenous Poisson point process and each mobile is attached to the base station that provides the best mean signal power. The mobile is in outage if the SINR falls below some threshold. The handover decision has to be made if the mobile is in outage for some time slots. The outage probability and the handover probability is evaluated in taking into account the effect of path loss, shadowing, Rayleigh fast fading, frequency factor reuse and conventional beamforming. The main assumption is that the Rayleigh fast fading changes each time slot while other network components remain static during the period of study.

math.PR↗

arXiv2010

On the One dimensional Poisson Random Geometric Graph

Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given threshold. We compute explicitly the distribution of the number of connected components of this graph. The proof relies on inverting some Laplace transforms.

math.PR↗

arXiv2010

Upper bounds on Rubinstein distances on configuration spaces and applications

In this paper, we provide upper bounds on several Rubinstein-type distances on the configuration space equipped with the Poisson measure. Our inequalities involve the two well-known gradients, in the sense of Malliavin calculus, which can be defined on this space. Actually, we show that depending on the distance between configurations which is considered, it is one gradient or the other which is the most effective. Some applications to distance estimates between Poisson and other more sophisticated processes are also provided, and an application of our results to tail and isoperimetric estimates completes this work.

math.PR↗

arXiv2010

A Markov model for the spread of Hepatitis C

We propose a Markov model for the spread of Hepatitis C virus (HCV) among drug users who use injections. We then proceed to an asymptotic analysis (large initial population) and show that the Markov process is close to the solution of a non linear autonomous differential system. We prove both a law of large numbers and functional central limit theorem to precise the speed of convergence towards the limiting system. The deterministic system itself converges, as time goes to infinity, to an equilibrium point. This corroborates the empirical observations about the prevalence of HCV.

math.PR↗

arXiv2009

Quasi-invariance and integration by parts for determinantal and permanental processes

Determinantal and permanental processes are point processes with a correlation function given by a determinant or a permanent. Their atoms exhibit mutual attraction of repulsion, thus these processes are very far from the uncorrelated situation encountered in Poisson models. We establish a quasi-invariance result : we show that if atoms locations are perturbed along a vector field, the resulting process is still a determinantal (respectively permanental) process, the law of which is absolutely continuous with respect to the original distribution. Based on this formula, following Bismut approach of Malliavin calculus, we then give an integration by parts formula.

math.PR↗

arXiv2009

A functional central limit theorem for the M/GI/$\infty$ queue

In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/$\infty$. The system is represented by a point-measure valued process keeping track of the remaining processing times of the customers in service. The convergence in law of a sequence of such processes after rescaling is proved by compactness-uniqueness methods, and the deterministic fluid limit is the solution of an integrated equation in the space $\mathcal{S}^{\prime}$ of tempered distributions. We then establish the corresponding central limit theorem, that is, the approximation of the normalized error process by a $\mathcal{S}^{\prime}$-valued diffusion. We apply these results to provide fluid limits and diffusion approximations for some performance processes.

math.PR↗

arXiv2007

Hitting times for Gaussian processes

We establish a general formula for the Laplace transform of the hitting times of a Gaussian process. Some consequences are derived, and particular cases like the fractional Brownian motion are discussed.

math.PR↗

arXiv2007

Upper bound of loss probability in an OFDMA system with randomly located users

For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the positions of receiving users in the system as well as the number of sub-channels dedicated to each one. We use recent results of the theory of point processes which reduce our calculations to the first and second moments of the total required number of sub-carriers.

math.PR↗

arXiv2007

Rubinstein distance on configurations spaces

By a method inspired of the Stein's method, we derive an upper-bound of the Rubinstein distance between two absolutely continuous probability measures on configurations space. As an application, we show that the best way to approximate a Modulated Poisson Process (see below for the definition) by a Poisson process is to equate their intensity.

math.PR↗

arXiv2006

Fluid limit of a heavily loaded EDF queue with impatient customers

In this paper we present the fluid limit of an heavily loaded Earliest Deadline First queue with impatient customers, represented by a measure-valued process keeping track of residual time-credits of lost and waiting customers. This fluid limit is the solution of an integrated transport equation. We then use this fluid limit to derive fluid approximations of the processes counting the number of waiting and already lost customers.

math.PR↗