SearcharxivSearch

arXiv · 2511.15893

On a Class of Dynamical Poisson-Voronoi Tessellations

Abstract

Consider a dynamical network model featuring mobile stations on the Euclidean plane. The initial locations of the stations are given by a homogeneous Poisson point process. The stations are all moving at a constant speed and in a random direction. Consider fixed users located in the Euclidean plane, which are served by the mobile stations. Each user stays connected to the nearest station at any given point of time. Since the stations are moving, a user disconnects and connects with different stations over time, by always selecting which ever station is the closest. This gives rise to a dynamical version of the Poisson-Voronoi tessellation. The focus of this paper is on the sequence of ``handover'' events of a typical user, which are the epochs when its association changes. This defines a point process on the time-axis, the ``handover point process''. We show that this point process is stationary and we determine its main properties, in particular its intensity and the joint distribution of its inter-event times. We also analyze the handover Palm distributions of several variables of practical interest. This includes the distance to the closest mobile stations and the point process of all other mobile stations at handover epochs. The analysis is conducted both in the single-speed and in the multi-speed scenarios. It leads to the identification of the three dimensional state variables that ``Markovize'' the association dynamics. The analysis is based on a specific system of non compact particles. The motivations are in the modeling of low or medium orbit satellite wireless communication networks. The model studied here is a planar ``caricature'' of this problem, which is initially defined on the sphere.

Explore related subjects

Keep this discovery

BibTeXRIS

François Baccelli, Sanjoy Kumar Jhawar. 2025-11-19. On a Class of Dynamical Poisson-Voronoi Tessellations. https://arxiv.org/abs/2511.15893

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