Related papers: Induced Random $\beta$-transformation

A central problem related to transformers can be stated as follows: given two $n \times d$ matrices $Q$ and $K$, and a non-negative function $f$, define the matrix $A$ as follows: (1) apply the function $f$ to each entry of the $n \times n$…

We prove a generalised Yuan--Hunt--Ma\~n\'e Conjecture: if $\mathcal{F}$ is the Banach space of $\alpha$-H\"older functions, and $\mathcal{T}$ is either a space of Lipschitz expanding maps, or of Anosov diffeomorphisms, or the family of…

We consider random iteration of exponential entire functions, i.e. of the form ${\mathbb C}\ni z\mapsto f_\lambda(z):=\lambda e^z\in\mathbb C$, $\lambda\in{\mathbb C}\setminus \{0\}$. Assuming that $\lambda$ is in a bounded closed interval…

Let $I=[0,1)$, $b\in \{2,3,\ldots\}$ and $f:I\to I$ be an injective piecewise $\frac{1}{b}$-affine map, that is, assume that there exists a partition of $I$ into intervals $I_1,\ldots,I_n$ such that $\vert f(x)-f(y)\vert\le\frac1b \vert…

(First-order) transductions are a basic notion capturing graph modifications that can be described in first-order logic. In this work, we propose an efficient algorithmic method to approximately reverse the application of a transduction,…

In this paper, we consider the one-to-one correspondence between a 2-adic integer and its parity sequence under iteration of the so-called "3x+1" map. First, we prove a new formula for the inverse transform. Next, we briefly review what is…

We consider a family $\mathcal F$ of maps with two branches and a common neutral fixed point $0$ such that the order of tangency at $0$ belongs to some interval $[\alpha_0, \alpha_1]\subset (0, 1)$. Maps in $\mathcal F$ do not necessarily…

Several phase transitions for excited random walks on the integers are known to be characterized by a certain drift parameter delta. For recurrence/transience the critical threshold is |delta|=1, for ballisticity it is |delta|=2 and for…

We consider a family of strongly-asymmetric unimodal maps $\{f_t\}_{t\in [0,1]}$ of the form $f_t=t\cdot f$ where $f\colon [0,1]\to [0,1]$ is unimodal, $f(0)=f(1)=0$, $f(c)=1$ is of the form and $$f(x)=\left\{ \begin{array}{ll}…

In this paper, our main focus is expressing real numbers on the non-integer bases. We denote those bases as $\beta$'s, which is also a real number and $\beta \in (1,2)$. This project has 3 main parts. The study of expansions of real numbers…

It is known that the class $\mathcal{U}_{\beta}$, of generalized s-selfdecom-posable probability distributions, can be viewed as an image via random integral mapping $\mathcal{J}^{\beta}$ of the class $ID$ of all infinitely divisible…

A perturbed family of interval exchange maps (FIEMs) provides a natural two-\linebreak{}dimensional area-preserving extension of interval exchange maps, with each IEM parameterized by an action variable $y$. Such families arise, for…

In this paper, we consider a randomized greedy algorithm for independent sets in $r$-uniform $d$-regular hypergraphs $G$ on $n$ vertices with girth $g$. By analyzing the expected size of the independent sets generated by this algorithm, we…

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…

We introduce a three-parameter random walk with reinforcement, called the $(\theta,\alpha,\beta)$ scheme, which generalizes the linearly edge reinforced random walk to uncountable spaces. The parameter $\beta$ smoothly tunes the…

We propose a probabilistic interpretation of transformers as unrolled inference steps assuming a probabilistic Laplacian Eigenmaps model from the ProbDR framework. Our derivation shows that at initialisation, transformers perform "linear"…

With the attention mechanism, transformers achieve significant empirical successes. Despite the intuitive understanding that transformers perform relational inference over long sequences to produce desirable representations, we lack a…

We study a general transition operator, generated by a random walk on a graph $X$; in particular we give necessary and sufficient condition on the matrix coefficient (1-step transition probablilities) to be a bounded operator from…

A formula of Doetsch ({\em Math. Zeitschr.} {\bf 42}, 263 (1937)) is generalized and used to numerically invert the one-sided Laplace transform ${\hat C}(\beta)$. The necessary input is only the values of ${\hat C}(\beta)$ on the positive…