Related papers: Random sets of finite perimeter
We present a systematic study for the limit closure $(\underline{x})^{\lim}$ of a sequence of elements $\underline{x}$ (eg. a system of of parameters) in a local ring. Firstly, we answer the question which elements are always contained in…
We investigate explicit functions that can produce truly random numbers. We use the analytical properties of the explicit functions to show that certain class of autonomous dynamical systems can generate random dynamics. This dynamics…
This brief paper develops a probability density that models processes for which the physical mechanism is unknown. It has desirable properties which are not realized by densities derived from Gaussian process or other classic methods. In…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
We review elementary properties of random matrices and discuss widely used mathematical methods for both hermitian and nonhermitian random matrix ensembles. Applications to a wide range of physics problems are summarized. This paper…
Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
In the series of models with interacting particles in stochastic geometry, a new contribution presents the facet process which is defined in arbitrary Euclidean dimension. In 2D, 3D specially it is a process of interacting segments, flat…
A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…
For each $n, d \in \mathbb{N}$ and $0 < \alpha < 1$, we define a random subset of $\mathcal{A}^{\{1, 2, \dots, n\}^d}$ by independently including each element with probability $\alpha$ and excluding it with probability $1-\alpha$, and…
In this paper, we develop a general machinery for finding explicit uniform probability and moment bounds on sub-additive positive functionals of random processes. Using the developed general technique, we derive uniform bounds on the…
In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions…
We present a detailed analysis of random motions moving in higher spaces with a natural number of velocities. In the case of the so-called minimal random dynamics, under some wide assumptions, we show the joint distribution of the position…
We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…
We consider systems of stochastic fixed-point equations that arise in the asymptotic analysis of random recursive structures and algorithms such as Quicksort, generalized P\'olya urn processes and path lengths of random recursive trees and…
We consider Brownian motions with one-sided collisions, meaning that each particle is reflected at its right neighbour. For a finite number of particles a Sch\"{u}tz-type formula is derived for the transition probability. We investigate an…
We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting…
A stationary random sequence admits under some assumptions a representation as the sum of two others: one of them is a martingale difference sequence, and another is a so-called coboundary. Such a representation can be used for proving some…