Related papers: A characterization of the set of fixed points of t…

The limiting distribution of the normalized number of comparisons used by Quicksort to sort an array of n numbers is known to be the unique fixed point with zero mean of a certain distributional transformation S. We study the convergence to…

The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect…

The number of comparisons X_n used by Quicksort to sort an array of n distinct numbers has mean mu_n of order n log n and standard deviation of order n. Using different methods, Regnier and Roesler each showed that the normalized variate…

At each time $n\in\mathbb{N}$, let $\bar{Y}^{(n)}=(y_{1}^{(n)},y_{2}^{(n)},\cdots)$ be a random sequence of non-negative numbers that are ultimately zero in a random environment $\xi=(\xi_{n})_{n\in\mathbb{N}}$ in time, which satisfies for…

Most previous studies of the sorting algorithm QuickSort have used the number of key comparisons as a measure of the cost of executing the algorithm. Here we suppose that the n independent and identically distributed (i.i.d.) keys are each…

We consider the inhomogeneous version of the fixed-point equation of the smoothing transformation, that is, the equation $X \stackrel{d}{=} C + \sum_{i \geq 1} T_i X_i$, where $\stackrel{d}{=}$ means equality in distribution,…

Given a sequence $(C_1,\ldots,C_d,T_1,T_2,\ldots)$ of real-valued random variables with $N := \#\{j \geq 1: T_j \not = 0\} < \infty$ almost surely, there is an associated smoothing transformation which maps a distribution $P$ on…

The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of $n$ data, permuted uniformly at random, the appropriately normalized complexity $Y_n$ is…

Sampling bias is a foundational concept in statistics; associated bias transforms, such as size bias, have come to play important roles in probability theory of late. The first author and G. Reinert introduced zero bias, a transform whose…

Given a sequence $(C,T) = (C,T_1,T_2,...)$ of real-valued random variables with $T_j \geq 0$ for all $j \geq 1$ and almost surely finite $N = \sup\{j \geq 1: T_j > 0\}$, the smoothing transform associated with $(C,T)$, defined on the set…

With the inflation of the data, clustering analysis, as a branch of unsupervised learning, lacks unified understanding and application of its mathematical law. Based on the view of fixed point, this paper restates the model-based clustering…

The branching random walk (BRW) smoothing transform $T$ is defined as $T:\text{distr}(U_{1})\mapsto \text{distr} (\sum_{i=1}^{L}X_{i}U_{i})$, where given realizations $\{X_{i}\}_{i=1}^{L}$ of a point process, $U_{1},U_{2},...$ are…

An atomic random complex measure defined on the unit disk with Normally distributed moments is considered. An approximation to the distribution of the zeros of its Cauchy transform is computed. Implications of this result for solving…

The blocking probability of a finite-source bufferless queue is a fixed point of the Engset formula, for which we prove existence and uniqueness. Numerically, the literature suggests a fixed point iteration. We show that such an iteration…

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

For a given random sequence $(C,T_{1},T_{2},\ldots)$ with nonzero $C$ and a.s. finite number of nonzero $T_{k}$, the nonhomogeneous smoothing transform $\mathcal{S}$ maps the law of a real random variable $X$ to the law of $\sum_{k\ge…

We determine the limit distributions of sums of deterministic chaotic variables in unimodal maps assisted by a novel renormalization group (RG) framework associated to the operation of increment of summands and rescaling. In this framework…

Given a sequence $(T_1, T_2, ...)$ of random $d \times d$ matrices with nonnegative entries, suppose there is a random vector $X$ with nonnegative entries, such that $ \sum_{i \ge 1} T_i X_i $ has the same law as $X$, where $(X_1, X_2,…

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

For every nonempty compact convex subset $K$ of a normed linear space a (unique) point $c_K \in K$, called the generalized Chebyshev center, is distinguished. It is shown that $c_K$ is a common fixed point for the isometry group of the…