Search arXivSearch

arXiv · 1704.08333

Point-shifts of Point Processes on Topological Groups

Abstract

This paper focuses on flow-adapted point-shifts of point processes on topological groups, which map points of a point process to other points of the point process in a translation invariant way. Foliations and connected components generated by point-shifts are studied, and the cardinality classification of connected components, previously known on Euclidean space, is generalized to unimodular groups. An explicit counterexample is also given on a non-unimodular group. Isomodularity of a point-shift is defined and identified as a key component in generalizations of Mecke's invariance theorem in the unimodular and non-unimodular cases. Isomodularity is also the deciding factor of when the reciprocal and reverse of a point-map corresponding to a bijective point-shift are equal in distribution. Next, sufficient conditions for separating points of a point process are given. Finally, connections between point-shifts of point processes and vertex-shifts of unimodular networks are given that allude to a deeper connection between the theories.

Explore related subjects

Keep this discovery

BibTeXRIS

James T. Murphy III. 2017-04-26. Point-shifts of Point Processes on Topological Groups. https://arxiv.org/abs/1704.08333

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