Related papers: Iterating random functions on a finite set
We formulate and prove in this report some sufficient conditions for exponential tightness (ET) of a family of independent identical distributed (i.i.d.) random fields (r.f.) (processes) in the space of continuous functions defined on…
We define a function by refining Stern's diatomic sequence. We name it the {\it assembly function}. It is strictly increasing continuous. The first and the second main theorems are on an action to the function. The third theorem is on…
Let $I=[0,1]$ and consider disjoint closed regions $G_{1},....,G_{n}$ in $% I\times I$ and subintervals $I_{1},......,I_{n},$ such that $G_{i}$ projects onto $I_{i.}$ We define the lower and upper maps $\tau_{1},$ $\tau_{2}$ by the lower…
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…
We consider certain finite sets of circle-valued functions defined on intervals of real numbers and estimate how large the intervals must be for the values of these functions to be uniformly distributed in an approximate way. This is used…
We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…
This paper studies a general class of Iterated Function Systems (IFS). No contractivity assumptions are made, other than the existence of some compact attractor. The possibility of escape to infinity is considered. Our present approach is…
The probability P(alpha, N) that search algorithms for random Satisfiability problems successfully find a solution is studied as a function of the ratio alpha of constraints per variable and the number N of variables. P is shown to be…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We examine the extent to which random samplings from the values of a random set, determine the distribution of the random set itself. We also comment on how, given the statistics of the sampling, to detect the distribution. Several methods…
In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…
In this paper, we study uniqueness problems for an entire function that shares small functions of finite order with their difference operators. In particular, we give a generalization of results in [2,3,13].
For a sample of absolutely bounded i.i.d. random variables with a continuous density the cumulative distribution function of the sample variance is represented by a univariate integral over a Fourier series. If the density is a polynomial…
We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…
We deal with a sequence of integer-valued random variables $\{Z_N\}_{N=1}^{\infty}$ which is related to restricted partitions of positive integers. We observe that $Z_N=X_1+ \ldots + X_N$ for independent and bounded random variables…
Random matrices whose entries come from a stationary Gaussian process are studied. The limiting behavior of the eigenvalues as the size of the matrix goes to infinity is the main subject of interest in this work. It is shown that the…