A global construction of homogeneous random planar tessellations that are stable under iteration

Homogeneous (i.e. spatially stationary) random tessellations of the Euclidean plane are constructed which have the characteristic property to be stable under the operation of iteration (or nesting), STIT for short. It is based on a Poisson point process on the space of lines that are endowed with a time of birth. A new approach is presented that describes the tessellation in the whole plane. So far, an explicit geometrical construction for those tessellations was only known within bounded windows.     

Length distributions of edges in planar stationary and isotropic STIT tessellations

Stationary and isotropic random tessellations of the euclidean plane are studied which have the characteristic property to be stable with respect to iteration (or nesting), STIT for short. Since their cells are not in a face-to-face position, three different types of linear segments appear. For all the types the distribution of the length of the typical segment is given. The text was submitted by the authors in English.     

Degree distribution of a typical vertex in a general random intersection graph

For a general random intersection graph, we show an approximation of the vertex degree distribution by a Poisson mixture. Research supported by Lithuanian State Science and Studies Foundation Grant T-07149.     

The expected length of a random line segment in a rectangle

We calculate the expected length of a random line segment in a rectangle, using a line making a random angle with the horizontal axis and having a random distance to a corner of the rectangle. Our result differs from previous calculations based upon two randomly placed points, and can be viewed as extending Bertrand's paradox to an important problem in geometric probability.     

Joint measurability and the one-way Fubini property for a continuum of independent random variables

As is well known, a continuous parameter process with mutually independent random variables is not jointly measurable in the usual sense. This paper proposes an extension of the usual product measure-theoretic framework, using a natural ``one-way Fubini' property. When the random variables are independent even in a very weak sense, this property guarantees joint measurability and defines a unique measure on a suitable minimal -algebra. However, a further extension to satisfy the usual (two-way) Fubini property, as in the case of Loeb product measures, may not be possible in general. Some applications are also given.

     

Convergence of complex martingale for a branching random walk in an independent and identically distributed environment

We consider anR^d-valued discrete time branching random walk in an independent and identically distributed environment indexed by time n∈N.Let W_n(z)(z∈C^d)be the natural complex martingale of the process.We show necessary and sufficient conditions for the L^α-convergence of W_n(z)forα>1,as well as its uniform convergence region.     

Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon

We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. This result is a first step for giving a nonparametric test for identifying the degree function of a large random graph. Replacing the indicator function in the empirical CDF by a smoother function, we get general asymptotic results for functionals of homomorphism densities for partially labeled graphs. This general setting allows to recover recent results on asymptotics for homomorphism densities of sampled graphon.     

General theorems on rates of convergence in distribution of random variables II. Applications to the stable limit laws and weak law of large numbers

This part is concerned with the applications of the general limit theorems with rates of Part I, achieved by specializing the limiting r.v. X. This leads to new convergence theorems with higher order rates in the one- and multi-dimensional case for the stable limit law, for the central limit theorem, and the weak law of large numbers.     

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers

A set A of non‐negative integers is called a Sidon set if all the sums , with and a₁, , are distinct. A well‐known problem on Sidon sets is the determination of the maximum possible size F(n) of a Sidon subset of . Results of Chowla, Erd?s, Singer and Turán from the 1940s give that . We study Sidon subsets of sparse random sets of integers, replacing the ‘dense environment’ by a sparse, random subset R of , and ask how large a subset can be, if we require that S should be a Sidon set. Let be a random subset of of cardinality , with all the subsets of equiprobable. We investigate the random variable , where the maximum is taken over all Sidon subsets , and obtain quite precise information on for the whole range of m, as illustrated by the following abridged version of our results. Let be a fixed constant and suppose . We show that there is a constant such that, almost surely, we have . As it turns out, the function is a continuous, piecewise linear function of a that is non‐differentiable at two ‘critical’ points: a = 1/3 and a = 2/3. Somewhat surprisingly, between those two points, the function is constant. Our approach is based on estimating the number of Sidon sets of a given cardinality contained in [n]. Our estimates also directly address a problem raised by Cameron and Erd?s (On the number of sets of integers with various properties, Number theory (Banff, AB, 1988), de Gruyter, Berlin, 1990, pp. 61–79). © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 1–25, 2015