Related papers: Iterating random functions on a finite set

In this paper an iterated function system on the space of distribution functions is built. The inverse problem is introduced and studied by convex optimization problems. Some applications of this method to approximation of distribution…

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let $f$ be a Boolean function such that the variance of $f$ is $\Omega(1)$ and all its individual influences are bounded by…

We consider the problem of reconstructing a function given its values on a set of points with finite density. We prove that with probability one, the values of an almost periodic function on a random array of points (with finite density)…

We consider a system $\displaystyle \frac{dx}{dt}=r_1(t) G_1(x) \left[ \int_{h_1(t)}^t f_1(y(s))~d_s R_1 (t,s) - x(t) \right], \frac{dy}{dt}=r_2(t) G_2(y) \left[ \int_{h_2(t)}^t f_2(x(s))~d_s R_2 (t,s) - y(t)\right]$ with increasing…

This paper focuses on computing the frequency response and transfer functions for large self-similar networks under different circumstances. Modeling large scale systems is difficult due, typically, to the dimension of the problem, and…

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite…

We obtain results on the limiting distribution of the six-length of a random functional graph, also called a functional digraph or random mapping, with given in-degree sequence. The six-length of a vertex $v\in V$ is defined from the…

If two random variables X and A are functionally related via f(X)=A for some strictly monotone continuously differentiable function f:R->R, the distribution of X may easily be computed from the distribution of A.

Let $F=F_N$ be the distribution of a finite real population of size $N$. Let $\widehat{F}=F_N$ be the empirical distribution of a sample of size $n$ drawn from the population without replacement. We prove the following remarkable {\it…

For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b <…

In calculus, an indefinite integral of a function $f$ is a differentiable function $F$ whose derivative is equal to $f$. In present paper, we generalize this notion of the indefinite integral from the ring of real functions to any ring. The…

We present a simple algorithm that estimates the cardinality $n$ of a set $V$ when allowed to sample elements of $V$ uniformly and independently at random. Our algorithm with probability $(1-\delta)$ returns a $(1\pm\epsilon)-$approximation…

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…

We consider a set of probability measures on a finite event space $\Omega$. The mutual affinity is introduced in terms of the spectrum of the associated Gram matrix. We show that, for randomly chosen measures, the empirical eigenvalue…

We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…

We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…

We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition…