Related papers: Iterating random functions on a finite set
We study in-network computation on general network topologies. Specifically, we are given the description of a function, and a network with distinct nodes at which the operands of the function are made available, and a designated sink where…
We consider the ensemble of $N\times N$ real random symmetric matrices $H_N^{(R)}$ obtained from the determinant form of the Ihara zeta function associated to random graphs $\Gamma_N^{(R)}$ of the long-range percolation radius model with…
We determine the distributions of lengths of runs in random sequences of elements from a totally ordered set (total order) or partially ordered set (partial order). In particular, we produce novel formulae for the expected value, variance,…
The problem of computing functions of values at the nodes in a network in a totally distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer,…
By using the matrix formulation of the two-step approach to the distributions of runs, a recursive relation and an explicit expression are derived for the generating function of the joint distribution of rises and falls for multivariate…
The Central Limit Theorem provides a foundation for inferential statistics and hypothesis testing. It describes how standardized statistics behave under repeated sampling from large populations. However, if the size of the sample (n)…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
Choose a random degree d poly f with coefficients in a finite field F. We estimate the ultimate period of f under compositional iteration. We also determine the joint distribution of the small cycle lengths in the graph with edges (x,f(x)),…
We mathematically model the supertask, introduced by Hansen, in which an infinity of gods together select a random natural number by each randomly removing a finite number of balls from an urn, leaving one final ball. We show that this…
We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…
For every $k \in \mathbb{N}$ let $f_k:[\frac{1}{k+1}, \frac{1}{k}] \to [0,1]$ be decreasing, linear functions such that $f_k(\frac{1}{k+1}) = 1$ and $f_k(\frac{1}{k}) = 0$, $k = 1, 2, \dots$. We define iterated function system (IFS) $S_n$…
The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and…
The analogue of the Riesz-Dunford functional calculus has been introduced and studied recently as well as the theory of semigroups and groups of linear quaternionic operators. In this paper we suppose that $T$ is the infinitesimal generator…
We construct `self-stabilizing' processes {Z(t), t $\in [t_0,t_1)$}. These are random processes which when `localized', that is scaled around t to a fine limit, have the distribution of an $\alpha$(Z(t))-stable process, where $\alpha$ is…
We study discrete expressions of the form $$ T_n(g)=\sum_{i=1}^n a_i g(S_i), \qquad S_i=\sum_{j=1}^i a_j, $$ where $a_i>0$ and $\sum_{i=1}^n a_i=1$. If $g:[0,1]\to\mathbb{R}$ is a decreasing integrable function, we have $$ \sum_{i=1}^n a_i…
Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
Let $\a$ be a real-valued random variable of mean zero and variance 1. Let $M_n(\a)$ denote the $n \times n$ random matrix whose entries are iid copies of $\a$ and $\sigma_n(M_n(\a))$ denote the least singular value of $M_n(\a)$.…
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…
Consider a finite renewal process in the sense that interrenewal times are positive i.i.d. variables and the total number of renewals is a random variable, independent of interrenewal times. A finite point process can be obtained by…