Related papers: Brownian local minima and other random dense count…
A.Olevskii and A.Ulanovskii obtained a scale of density results, which correspond to how well an exponential system approximates a uniformly minimal system over a compact set. We extend their result in several directions. First, we show…
In this paper we develop a very general class of bivariate discrete distributions. The basic idea is very simple. The marginals are obtained by taking the random geometric sum of a baseline distribution function. The proposed class of…
Let X be a locally compact Abelian group. We consider linear forms of independent random variables with values in X. In doing so, one of the coefficients of the linear forms is a random variable with a Bernoulli distribution. For some…
We continue in this paper the study of locally minimal groups started in \cite{LocMin}. The minimality criterion for dense subgroups of compact groups is extended to local minimality. Using this criterion we characterize the compact abelian…
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…
There have been controversies among statisticians on (i) what to model and (ii) how to make inferences from models with unobservables. One such controversy concerns the difference between estimation methods for the marginal means not…
We study two models consisting of reflecting one-dimensional Brownian "particles" of positive radius. We show that the stationary empirical distributions for the particle systems do not converge to the harmonic function for the generator of…
We introduce a model of self-propelled particles carrying out a Brownian motion with a diffusion coefficient which depends on the local density of particles within a certain finite radius. Numerical simulations show that in a range of…
We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…
We present distributions of countable models and correspondent structural characteristics of complete theories with continuum many types: for prime models over finite sets relative to Rudin-Keisler preorders, for limit models over types and…
Given any 1-random set $X$ and any $r\in(0,1)$, we construct a set of intrinsic density $r$ which is computable from $r\oplus X$. For almost all $r$, this set will be the first known example of an intrinsic density $r$ set which cannot…
We generate random functions locally via a novel generalization of Dyson Brownian motion, such that the functions are in a desired differentiability class, while ensuring that the Hessian is a member of the Gaussian orthogonal ensemble…
The distribution of the sum of independent identically distributed uniform random variables is well-known. However, it is sometimes necessary to analyze data which have been drawn from different uniform distributions. By inverting the…
A new definition of random sets is proposed. It is based on the distance in measurable space and uses negative definite kernels for continuation from initial space to that of random sets. This approach has no connection to Hausdorff…
The paper introduces the concept of a cluster structure to define a joint distribution of the sample size and its exchangeable random partitions. The cluster structure allows the probability distribution of the random partitions of a subset…
Boolean formulae compactly encode huge, constrained search spaces. Thus, variability-intensive systems are often encoded with Boolean formulae. The search space of a variability-intensive system is usually too large to explore without…
We develop a theory of `non-uniformly local' tent spaces on metric measure spaces. As our main result, we give a remarkably simple proof of the atomic decomposition.
A construction of $p$-parameter Brownian sheet on the hypercube $C=[0,1]^p$ as a sum of $2^p$ independent Gaussian processes is obtained. The terms are closely related to Brownian pillows, and the probability laws of their $L^2(C)$ squared…