SearcharxivSearch

arXiv · 2608.19976

Random valuations

Abstract

A valuation is a finitely additive function on the family of compact convex sets in $\mathbb{R}^d$. We study non-negative infinitely divisible random valuations, with particular emphasis on monotone, $\sigma$-continuous models with independent increments along nested families. After separating the deterministic part, we show that the L\'evy measure of such a valuation is generated by pairs $(F,r)$, where $F$ is a non-empty closed convex set and $r>0$, with each pair contributing $r\mathbf{1}_{F\cap K=\emptyset}$. This yields a Poisson representation and an equivalent formulation through a pure-jump completely random measure on the space of closed convex sets. For stationary valuations, we derive a cylinder-Grassmannian representation of the L\'evy measure. In the stationary isotropic case, we obtain a McMullen-type decomposition, at the level of one-dimensional distributions, into independent components stable under dilation of the argument.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrii Ilienko, Ilya Molchanov. 2026-08-20. Random valuations. https://arxiv.org/abs/2608.19976

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