English
Related papers

Related papers: The random case of Conley's theorem

200 papers

This paper provides a unified framework connecting dynamical systems with tools from topological data analysis and geometric topology and inspires new interactions among dynamical systems, topology, and nonlinear analysis. To this end, we…

Dynamical Systems · Mathematics 2025-12-03 Tomoo Yokoyama

Let X be a connected open set in n-dimensional Euclidean space, partially ordered by a closed convex cone K with nonempty interior: y > x if and only if y-x is nonzero and in K. Theorem: If F is a monotone local flow in X whose periodic…

Dynamical Systems · Mathematics 2018-06-27 Morris W. Hirsch

Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in…

Molecular Networks · Quantitative Biology 2007-05-23 Björn Samuelsson , Carl Troein

For Milnor, statistical, and minimal attractors, we construct examples of smooth flows $\varphi$ on $S^2$ for which the attractor of the Cartesian square of $\varphi$ is smaller than the Cartesian square of the attractor of $\varphi$. In…

Dynamical Systems · Mathematics 2021-07-28 Stanislav Minkov , Ivan Shilin

Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…

Probability · Mathematics 2012-01-31 Serguei Popov , Marina Vachkovskaia

In this paper, we investigate the precise behavior of orbits inside attracting basins. Let $f$ be a holomorphic polynomial of degree $m\geq2$ in $\mathbb{C}$, $\mathcal {A}(p)$ be the basin of attraction of an attracting fixed point $p$ of…

Dynamical Systems · Mathematics 2022-08-02 Mi Hu

Algorithmic theories of randomness can be related to theories of probabilistic sequence prediction through the notion of a predictor, defined as a function which supplies lower bounds on initial-segment probabilities of infinite sequences.…

Information Theory · Computer Science 2024-01-25 Lenhart K. Schubert

This paper concerns the local connectedness of components of self-similar sets. Given an equal partition of the unit square into n*n small squares, we may choose arbitrarily two or more of them and form an iterated function system. The…

General Topology · Mathematics 2018-03-28 Jun Luo , Hui Rao , Ying Xiong

We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…

Probability · Mathematics 2021-09-16 Jonas Jalowy , Matthias Löwe

We show that in 1+1 dimensional conformal field theories, exciting a state with a local operator increases the Renyi entanglement entropies by a constant which is the same for every member of the conformal family. Hence, it is an intrinsic…

High Energy Physics - Theory · Physics 2015-09-23 Pawel Caputa , Alvaro Veliz-Osorio

This paper concerns maximal flows on $\mathbb{Z}^2$ traveling from a convex set to infinity, the flows being restricted by a random capacity. For every compact convex set $A$, we prove that the maximal flow $\Phi(nA)$ between $nA$ and…

Probability · Mathematics 2009-05-14 Olivier Garet

We show that (local) confluence of terminating locally constrained rewrite systems is undecidable, even when the underlying theory is decidable. Several confluence criteria for logically constrained rewrite systems are known. These were…

Logic in Computer Science · Computer Science 2024-07-02 Jonas Schöpf , Fabian Mitterwallner , Aart Middeldorp

We provide a counterexample to a conjecture by Thiagarajan (1996 and 2002) that regular event structures correspond exactly to event structures obtained as unfoldings of finite 1-safe Petri nets. The same counterexample is used to disprove…

Formal Languages and Automata Theory · Computer Science 2020-12-16 Jérémie Chalopin , Victor Chepoi

A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…

Probability · Mathematics 2012-04-20 Davide Gabrielli , Carla Valente

We study a two-parameter family of one-dimensional maps and related (a,b)-continued fractions suggested for consideration by Don Zagier. We prove that the associated natural extension maps have attractors with finite rectangular structure…

Dynamical Systems · Mathematics 2010-04-26 Svetlana Katok , Ilie Ugarcovici

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…

Combinatorics · Mathematics 2025-12-03 Cory H. Colbert

We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…

Dynamical Systems · Mathematics 2020-05-28 Edgar Matias , Eduardo Silva

Considering random noise in finite dimensional parameterized families of diffeomorphisms of a compact finite dimensional boundaryless manifold M, we show the existence of time averages for almost every orbit of each point of M, imposing…

Dynamical Systems · Mathematics 2007-05-23 Vitor Araujo

Given a dynamical system $(X,T)$ and a family $\mathsf{I}\subseteq \mathcal{P}(\omega)$ of "small" sets of nonnegative integers, a point $x \in X$ is said to be $\mathsf{I}$-strong universal if for each $y \in X$ there exists a subsequence…

Functional Analysis · Mathematics 2025-05-12 Paolo Leonetti

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Classical Analysis and ODEs · Mathematics 2018-03-08 José Ginés Espín Buendía , Víctor Jiménez López
‹ Prev 1 4 5 6 7 8 10 Next ›