SearcharxivSearch

arXiv · 1202.0225

Generating Functionals of Random Packing Point Processes: From Hard-Core to Carrier Sensing

Abstract

In this paper we study the generating functionals of several random packing processes: the classical Matérn hard-core model; its extensions, the $k$-Matérn models and the $\infty$-Matérn model, which is an example of random sequential packing process. We first give a sufficient condition for the $\infty$-Matérn model to be well-defined (unlike the other two, the latter may not be well-defined on unbounded spaces). Then the generating functional of the resulting point process is given for each of the three models as the solution of a differential equation. Series representations and bounds on the generating functional of the packing models are also derived. Last but not least, we obtain moment measures and Palm distributions of the considered packing models departing from their generating functionals.

Explore related subjects

Keep this discovery

BibTeXRIS

Nguyen Tien Viet, Francois Baccelli. 2012-04-22. Generating Functionals of Random Packing Point Processes: From Hard-Core to Carrier Sensing. https://arxiv.org/abs/1202.0225

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