Search arXivSearch

arXiv · 2009.10503

Orthogonal Dice

Abstract

In this paper, we introduce a family of discrete rectangular uniform distributions on the natural numbers-referred to as orthogonal dice-characterized by the property that their means equal their variances. These distributions arise naturally in statistics and applied mathematics. We show that the orthogonal dice correspond to solutions of a quadratic Diophantine equation on the naturals, exhibiting divisibility properties tied to their dimensions, generating coprime arithmetic progressions, yielding disjoint partitions of the naturals, and displaying self-similarity. Their associated random counting measures (mixed binomial processes) exhibit interesting structural properties, including orthogonal splitting and convergence to Poisson limits. As a result, the orthogonal dice define canonical stochastic processes that that may be used to construct Brownian and geometric Brownian motions. More broadly, they serve as Poisson-like building blocks-natural substrates for modeling systems with bounded counts. Furthermore, they induce a trichotomy within the broader class of such distributions, partitioning them into three infinite subfamilies-negative, orthogonal, and positive-according to their mean-variance relationships.

Explore related subjects

Keep this discovery

BibTeXRIS

Caleb Deen Bastian, Herschel Rabitz, Grzegorz A Rempala. 2020-09-20. Orthogonal Dice. https://arxiv.org/abs/2009.10503

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