SearcharxivSearch

arXiv · 2109.11472

The longest edge in discrete and continuous long-range percolation

Abstract

We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at least one endpoint within some finite observation window, as the volume of this window tends to infinity. We show that the length of the latter, after normalizing by some appropriate centering and scaling sequences, asymptotically behaves like one of each of the three extreme value distributions, depending on choices of the probability $g(r)$. We prove our results by giving a formal construction of the model by means of a marked Poisson point process and a Poisson coupling argument adapted to this construction. In addition, we study a discrete variant of the model. We obtain parameter regimes with varying behavior in our findings and an unexpected singularity.

Explore related subjects

Keep this discovery

BibTeXRIS

Arnaud Rousselle, Ercan Sönmez. 2021-09-23. The longest edge in discrete and continuous long-range percolation. https://doi.org/10.1007/s10687-024-00488-y

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