SearcharxivSearch

arXiv · 1908.07375

Percolation phase transitions for the SIR model with random powers

Abstract

This thesis considers three models which describe a multihop ad-hoc telecommunication system. These systems consist of users sending messages, which can jump to other users to reach the target user. The first two models have already been examined extensively, whereas it is the first time the third model is studied. In all these models our goal is to understand under which conditions users situated far away from each other can communicate. This is the fundamental question of continuum percolation, which was introduced by Gilbert (1961), who established the Boolean model for Poisson point processes. In the first part of this thesis we introduce this model and prove the existence of a phase transition between a subcritical phase, where no infinite connected component of users exists, and a supercritical phase, where such a component exists. We also consider the case of random connection radii, following Meester and Roy (1996). In the second part we study the SINR model for Cox point processes in two or higher dimensions, following T\'obi\'as (2019). He proved that there exists a phase transition under certain stabilization and connectedness conditions on the intensity measure. The SINR model for homogeneous Poisson point processes in $\mathbb R^2$ was introduced by Dousse et al. (2005). In the third part we study percolation in the SINR model with random powers for Poisson point processes in $\mathbb R^d$, $d \geq 2$. This model was studied by Kong and Yeh (2007) for $d=2$ under strong boundedness conditions on the random power. In this thesis we weaken these conditions and only assume that the random power is nonnegative, integrable and not a.s. zero. We show that there exists a subcritical phase if the path-loss function decays fast enough. Further, we prove that a supercritical phase exists if random power has a large enough essential supremum and some exponential moments.

Explore related subjects

Keep this discovery

BibTeXRIS

Regine Löffler. 2019-08-12. Percolation phase transitions for the SIR model with random powers. https://arxiv.org/abs/1908.07375

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