English
Related papers

Related papers: Subsystems of transitive subshifts with linear com…

200 papers

We study dynamical systems which have bounded complexity with respect to three kinds metrics: the Bowen metric $d_n$, the max-mean metric $\hat{d}_n$ and the mean metric $\bar{d}_n$, both in topological dynamics and ergodic theory. It is…

Dynamical Systems · Mathematics 2020-11-25 Wen Huang , Jian Li , Jean-Paul Thouvenot , Leiye Xu , Xiangdong Ye

We use noncommutative localization to construct a chain complex which counts the critical points of a circle-valued Morse function on a manifold, generalizing the Novikov complex. As a consequence we obtain new topological lower bounds on…

Differential Geometry · Mathematics 2007-05-23 Michael Farber , Andrew Ranicki

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…

Computational Geometry · Computer Science 2018-10-26 Ery Arias-Castro , Thibaut Le Gouic

In this paper we propagate a large deviations approach for proving limit theory for (generally) multivariate time series with heavy tails. We make this notion precise by introducing regularly varying time series. We provide general large…

Statistics Theory · Mathematics 2015-09-02 T. Mikosch , O. Wintenberger

This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local constraints as well as local variables, and they are…

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

Group Theory · Mathematics 2015-02-10 Joachim König

We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…

Probability · Mathematics 2007-05-23 Eddy Mayer-Wolf , Alexander Roitershtein , Ofer Zeitouni

Randomly-assembled dynamical systems are theoretically predicted to be unstable upon crossing a critical threshold of complexity, as first shown by May. Yet, empirical complex systems exhibit remarkable stability, indicating the presence of…

Disordered Systems and Neural Networks · Physics 2026-03-31 Francesco Ferraro , Christian Grilletta , Amos Maritan , Samir Suweis , Sandro Azaele

We present a general method to derive continuity estimates for conditional probabilities of general (possibly continuous) spin models sub jected to local transformations. Such systems arise in the study of a stochastic time-evolution of…

Probability · Mathematics 2007-11-26 C. Kuelske , A. A. Opoku

Complex networks are a powerful modeling tool, allowing the study of countless real-world systems. They have been used in very different domains such as computer science, biology, sociology, management, etc. Authors have been trying to…

Social and Information Networks · Computer Science 2014-02-04 Burcu Kantarcı , Vincent Labatut

We exhibit an explicit sufficient condition for the Lyapunov exponents of a linear cocycle over a Markov map to have multiplicity 1. This builds on work of Guivarc'h-Raugi and Gol'dsheid-Margulis, who considered products of random matrices,…

Dynamical Systems · Mathematics 2007-05-23 Artur Avila , Marcelo Viana

We analyse the so-called Marginal Instability of linear switching systems, both in continuous and discrete time. This is a phenomenon of unboundedness of trajectories when the Lyapunov exponent is zero. We disprove two recent conjectures of…

Dynamical Systems · Mathematics 2014-11-04 Vladimir Y. Protasov , Raphael M. Jungers

We construct a marginally stable linear switching system in continuous time, in four dimensions and with three switching states, which is exponentially stable with respect to constant switching laws and which has a unique Barabanov norm,…

Optimization and Control · Mathematics 2023-01-25 Ian D. Morris

A popular view in contemporary Boltzmannian statistical mechanics is to interpret the measures as typicality measures. In measure-theoretic dynamical systems theory measures can similarly be interpreted as typicality measures. However, a…

History and Philosophy of Physics · Physics 2013-10-08 Charlotte Werndl

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

Social and Information Networks · Computer Science 2015-02-10 Vladan Mlinar

We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kam\v{c}ev, Morrison and the second author. Moreover, we prove that any large system containing such a…

Combinatorics · Mathematics 2024-04-30 Daniel Altman , Anita Liebenau

For probability measures on a complete separable metric space, we present sufficient conditions for the existence of a solution to the Kantorovich transportation problem. We also obtain sufficient conditions (which sometimes also become…

Probability · Mathematics 2007-06-13 S. Ekisheva , C. Houdré

By a classical result of Roitman, a complete intersection $X$ of sufficiently small degree admits a rational decomposition of the diagonal. This means that some multiple of the diagonal by a positive integer $N$, when viewed as a cycle in…

Algebraic Geometry · Mathematics 2018-03-16 Andre Chatzistamatiou , Marc Levine

We describe three different approaches to the extended (N=2) supersymmetrization of the multicomponent KP hierarchy. In the first one we utilize only superfermions while in the second only superbosons and in the third superbosons as well as…

High Energy Physics - Theory · Physics 2008-11-26 Ziemowit Popowicz

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…

Machine Learning · Computer Science 2020-03-10 Pritish Kamath , Omar Montasser , Nathan Srebro