SearcharxivSearch

arXiv · 2108.11820

Large Large deviations for spatial telecommunication systems: The boolean model

Abstract

Spatial telecommunication systems have evolved along the years, leading to some concerns that telecommunication companies are facing today. The main inquietude is the ability to provide quality service to customers or users in a dense regime. Therefore, questions such as : what is the best possible configurations of base stations and users that maximizes quality service? Is it possible to estimate and control the probability of bad service, which may be seen as a rare event? and many more arise. These questions often involve estimating the tail distribution of events, which falls under the scope of large deviation principles. In this article, we associate with the Boolean model, the empirical marked measure which will serve as a statistic for the intensity measure of the Marked Poisson Point Process of devices or users and the empirical connectivity measure which will serve as a statistic for coverage probability density of the spatial telecommunication area. For these empirical measures, prove large deviation principle (LDP) for well-defined empirical measures.

Explore related subjects

Keep this discovery

BibTeXRIS

A. K. Boahen, T. Katsekpor, K. Doku-Amponsah. 2021-08-26. Large Large deviations for spatial telecommunication systems: The boolean model. https://arxiv.org/abs/2108.11820

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR