English
Related papers

Related papers: Unbounded fast escaping wandering domains

200 papers

A Baker omitted value, in short \textit{bov} of a transcendental meromorphic function $f$ is an omitted value such that there is a disk $D$ centered at the bov for which each component of the boundary of $f^{-1}(D)$ is bounded. Assuming all…

Dynamical Systems · Mathematics 2021-01-07 Subhasis Ghora , Tarakanta Nayak

We consider the problem of chasing convex functions, where functions arrive over time. The player takes actions after seeing the function, and the goal is to achieve a small function cost for these actions, as well as a small cost for…

Data Structures and Algorithms · Computer Science 2020-05-29 C. J. Argue , Anupam Gupta , Guru Guruganesh

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

Probability · Mathematics 2017-05-12 Eviatar B. Procaccia , Yuan Zhang

We investigate Newton's method applied to any odd or any even elliptic function with an arbitrary period lattice. For any function of this type whose set of poles coincides with its period lattice, we show that the Julia set of its Newton…

Dynamical Systems · Mathematics 2026-01-30 Adrián Esparza-Amador , Mónica Moreno Rocha

We consider three related problems of robot movement in arbitrary dimensions: coverage, search, and navigation. For each problem, a spherical robot is asked to accomplish a motion-related task in an unknown environment whose geometry is…

Computational Geometry · Computer Science 2011-10-13 Joshua Brown Kramer , Lucas Sabalka

In this note we prove convergence of Green functions with Neumann boundary conditions for the random walk to their continuous counterparts. Also a few Beurling type hitting estimates are obtained for the random walk on discretizations of…

Probability · Mathematics 2015-09-01 Shirshendu Ganguly , Yuval Peres

We provide new insights on eluder dimension, a complexity measure that has been extensively used to bound the regret of algorithms for online bandits and reinforcement learning with function approximation. First, we study the relationship…

Machine Learning · Computer Science 2022-10-06 Gene Li , Pritish Kamath , Dylan J. Foster , Nathan Srebro

A transcendental entire function is called criniferous if every point in its escaping set can eventually be connected to infinity by a curve of escaping points. Many transcendental entire functions with bounded singular set have this…

Dynamical Systems · Mathematics 2020-10-21 Leticia Pardo-Simón

Determining the reachable set for a given nonlinear system is critically important for autonomous trajectory planning for reach-avoid applications and safety critical scenarios. Providing the reachable set is generally impossible when the…

Systems and Control · Electrical Eng. & Systems 2024-12-30 Taha Shafa , Melkior Ornik

We prove a functional limit theorem for Markov chains that, in each step, move up or down by a possibly state dependent constant with probability $1/2$, respectively. The theorem entails that the law of every one-dimensional regular…

Probability · Mathematics 2020-05-13 Stefan Ankirchner , Thomas Kruse , Mikhail Urusov

Consider the entire function $f(z)=\cosh(z)$. We show that the escaping set of this function - that is, the set of points whose orbits tend to infinity under iteration - has a structure known as a "spider's web". This disproves a conjecture…

Dynamical Systems · Mathematics 2025-05-13 Lasse Rempe

We present theoretical and practical results on the order theory of lattices of functions, focusing on Galois connections that abstract (sets of) functions - a topic known as higher-order abstract interpretation. We are motivated by the…

Programming Languages · Computer Science 2025-08-01 Louis Rustenholz , Pedro Lopez-Garcia , Manuel V. Hermenegildo

We present a new perspective on the celebrated Sinkhorn algorithm by showing that is a special case of incremental/stochastic mirror descent. In order to see this, one should simply plug Kullback-Leibler divergence in both mirror map and…

Machine Learning · Computer Science 2019-09-17 Konstantin Mishchenko

We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…

Dynamical Systems · Mathematics 2011-01-21 Manfred Einsiedler , Lior Fishman , Uri Shapira

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

Probability · Mathematics 2007-09-01 Martin T. Barlow , Antal A. Jarai , Takashi Kumagai , Gordon Slade

Let $\{\xi(k), k \in \mathbb{Z} \}$ be a stationary sequence of random variables with conditions of type $D(u_n)$ and $D'(u_n)$. Let $\{S_n, n \in \mathbb{N} \}$ be a transient random walk in the domain of attraction of a stable law. We…

Probability · Mathematics 2019-10-11 Nicolas Chenavier , Ahmad Darwiche

In a recent paper, Basu, Hildebrand, and Molinaro established that the set of continuous minimal functions for the 1-dimensional Gomory-Johnson infinite group relaxation possesses a dense subset of extreme functions. The $n$-dimensional…

Optimization and Control · Mathematics 2017-08-16 Teresa M. Lebair , Amitabh Basu

In this paper we examine the problem of inference in Bayesian Networks with discrete random variables that have very large or even unbounded domains. For example, in a domain where we are trying to identify a person, we may have variables…

Artificial Intelligence · Computer Science 2012-12-12 Rita Sharma , David L Poole

We analyze the boundaries of multiply connected Fatou components of transcendental maps by means of universal covering maps and associated inner functions. A unified approach is presented, which includes invariant Fatou components (of any…

Dynamical Systems · Mathematics 2025-10-13 Gustavo R. Ferreira , Anna Jové

We show that for any transcendental meromorphic function $f$ there is a point $z$ in the Julia set of $f$ such that the iterates $f^n(z)$ escape, that is, tend to $\infty$, arbitrarily slowly. The proof uses new covering results for…

Dynamical Systems · Mathematics 2008-12-15 P. J. Rippon , G. M. Stallard