中文
相关论文

相关论文: Iterating random functions on a finite set

200 篇论文

For a family of continuous functions $f_1,f_2,\dots \colon I \to \mathbb{R}$ ($I$ is a fixed interval) with $f_1\le f_2\le \dots$ define a set $$ I_f:=\big\{x \in I \colon \lim_{n \to \infty} f_n(x)=+\infty\big\}.$$ We study the properties…

经典分析与常微分方程 · 数学 2024-03-29 Karol Gryszka , Paweł Pasteczka

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

数论 · 数学 2010-11-19 Andreas Weingartner

A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…

概率论 · 数学 2020-03-24 Nicolas Broutin , Luc Devroye , Nicolas Fraiman

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

概率论 · 数学 2013-02-21 Omer Friedland , Ohad Giladi

Let's fix a reasonable subsystem $T$ of arithmetic; why are natural extensions of $T$ pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. The goal of this work was to classify the recursive…

逻辑 · 数学 2022-09-21 James Walsh

Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle…

组合数学 · 数学 2025-12-16 Ljuben Mutafchiev , Steven Finch

For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical…

概率论 · 数学 2014-08-18 Sean O'Rourke , Alexander Soshnikov

We consider random holomorphic dynamical systems on the Riemann sphere whose choices of maps are related to Markov chains. Our motivation is to generalize the facts which hold in i.i.d. random holomorphic dynamical systems. In particular,…

动力系统 · 数学 2019-09-24 Hiroki Sumi , Takayuki Watanabe

The randomization of a complete first order theory $T$ is the complete continuous theory $T^R$ with two sorts, a sort for random elements of models of $T$, and a sort for events in an underlying probability space. We study various notions…

逻辑 · 数学 2014-09-05 Uri Andrews , Isaac Goldbring , H. Jerome Keisler

We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…

概率论 · 数学 2024-05-07 Alexey V. Lebedev

Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process in which the coefficients are regularly varying and innovations are independent and identically distributed and belong to the domain of attraction of an $\alpha$-stable law…

概率论 · 数学 2023-09-22 Hui Liu , Yudan Xiong , Fangjun Xu

This paper establishes a strict mathematical relationship between an arbitrary continuous function on a compact set and its global minima, like the well-known first order optimality condition for convex and differentiable functions. By…

最优化与控制 · 数学 2019-05-27 Xiaopeng Luo

The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…

逻辑 · 数学 2013-05-01 Uri Andrews , Isaac Goldbring , H. Jerome Keisler

Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.

数值分析 · 数学 2022-09-01 Qusay Muzaffar , Nira Dyn , David Levin

We prove singularity of some distributions of random continued fractions that correspond to iterated function systems with overlap and a parabolic point. These arose while studying the conductance of Galton-Watson trees.

概率论 · 数学 2007-05-23 Russell Lyons

For $f$ a Steinhaus random multiplicative function, we prove convergence in distribution of the appropriately normalised partial sums \[ \frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum_{\substack{n \leq x \\ P(n) > \sqrt{x}}} f(n), \] where…

数论 · 数学 2025-03-11 Seth Hardy

Wilf posed the following problem: determine asymptotically as $n\to\infty$ the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m. One solution of this problem was given by Hitczenko and…

组合数学 · 数学 2015-06-26 Pawel Hitczenko , Cecil C. Rousseau , Carla D. Savage

This thesis is concerned with the behavior of random analytic functions. In particular, we are interested in the value distribution of Taylor series with independent random coefficients. We begin with a study of the properties of Fourier…

复变函数 · 数学 2014-01-29 Alon Nishry

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

数值分析 · 数学 2012-01-18 Massimo Fornasier , Karin Schnass , Jan Vybiral

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

数论 · 数学 2024-06-07 Ofir Gorodetsky , Mo Dick Wong