Multifractality of the Feigenbaum attractor and fractional derivatives

It is shown that fractional derivatives of the (integrated) invariant measure of the Feigenbaum map at the onset of chaos have power-law tails in their cumulative distributions, whose exponents can be related to the spectrum of singularities $f(\alpha)$. This is a new way of characterizing multifractality in dynamical systems, so far applied only to multifractal random functions (Frisch and Matsumoto (J. Stat. Phys. 108:1181, 2002)). The relation between the thermodynamic approach (Vul, Sinai and Khanin (Russian Math. Surveys 39:1, 1984)) and that based on singularities of the invariant measures is also examined. The theory for fractional derivatives is developed from a heuristic point view and tested by very accurate simulations.Comment: 20 pages, 5 figures, J.Stat.Phys. in pres

Regulating Highly Automated Robot Ecologies: Insights from Three User Studies

Highly automated robot ecologies (HARE), or societies of independent autonomous robots or agents, are rapidly becoming an important part of much of the world's critical infrastructure. As with human societies, regulation, wherein a governing body designs rules and processes for the society, plays an important role in ensuring that HARE meet societal objectives. However, to date, a careful study of interactions between a regulator and HARE is lacking. In this paper, we report on three user studies which give insights into how to design systems that allow people, acting as the regulatory authority, to effectively interact with HARE. As in the study of political systems in which governments regulate human societies, our studies analyze how interactions between HARE and regulators are impacted by regulatory power and individual (robot or agent) autonomy. Our results show that regulator power, decision support, and adaptive autonomy can each diminish the social welfare of HARE, and hint at how these seemingly desirable mechanisms can be designed so that they become part of successful HARE.Comment: 10 pages, 7 figures, to appear in the 5th International Conference on Human Agent Interaction (HAI-2017), Bielefeld, German

Sublinear Estimation of Weighted Matchings in Dynamic Data Streams

This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm is implementable in any streaming model including dynamic graph streams. We also give the first constant estimation for the maximum matching size in a dynamic graph stream for planar graphs (or any graph with bounded arboricity) using $\tilde{O}(n^{4/5})$ space which also extends to weighted matching. Using previous results by Kapralov, Khanna, and Sudan (2014) we obtain a $\mathrm{polylog}(n)$ approximation for general graphs using $\mathrm{polylog}(n)$ space in random order streams, respectively. In addition, we give a space lower bound of $\Omega(n^{1-\varepsilon})$ for any randomized algorithm estimating the size of a maximum matching up to a $1+O(\varepsilon)$ factor for adversarial streams

Bifurcations and Chaos in the Six-Dimensional Turbulence Model of Gledzer

The cascade-shell model of turbulence with six real variables originated by Gledzer is studied numerically using Mathematica 5.1. Periodic, doubly-periodic and chaotic solutions and the routes to chaos via both frequency-locking and period-doubling are found by the Poincar\'e plot of the first mode $v_1$. The circle map on the torus is well approximated by the summation of several sinusoidal functions. The dependence of the rotation number on the viscosity parameter is in accordance with that of the sine-circle map. The complicated bifurcation structure and the revival of a stable periodic solution at the smaller viscosity parameter in the present model indicates that the turbulent state may be very sensitive to the Reynolds number.Comment: 19 pages, 12 figures submitted to JPS

Iterated maps for clarinet-like systems

The dynamical equations of clarinet-like systems are known to be reducible to a non-linear iterated map within reasonable approximations. This leads to time oscillations that are represented by square signals, analogous to the Raman regime for string instruments. In this article, we study in more detail the properties of the corresponding non-linear iterations, with emphasis on the geometrical constructions that can be used to classify the various solutions (for instance with or without reed beating) as well as on the periodicity windows that occur within the chaotic region. In particular, we find a regime where period tripling occurs and examine the conditions for intermittency. We also show that, while the direct observation of the iteration function does not reveal much on the oscillation regime of the instrument, the graph of the high order iterates directly gives visible information on the oscillation regime (characterization of the number of period doubligs, chaotic behaviour, etc.)

Binary Tree Approach to Scaling in Unimodal Maps

Ge, Rusjan, and Zweifel (J. Stat. Phys. 59, 1265 (1990)) introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree which takes into account the self-similarity of the window structure. A non-universal geometric convergence of the associated superstable parameter values towards a Misiurewicz point is observed for almost all binary sequences with periodic tails. There are an infinite number of exceptional sequences, however, which lead to superexponential scaling. The origin of such sequences is explained.Comment: 25 pages, plain Te

Relaxing the Irrevocability Requirement for Online Graph Algorithms

Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request can be accepted at a later point, but any acceptance is irrevocable. Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption). Finally, we consider the Late Accept/Reject model, where late accepts and rejects are both allowed, but any late reject is irrevocable. For Independent Set, the Late Accept/Reject model is necessary to obtain a constant competitive ratio, but for Vertex Cover the Late Accept model is sufficient and for Minimum Spanning Forest the Late Reject model is sufficient. The Matching problem has a competitive ratio of 2, but in the Late Accept/Reject model, its competitive ratio is 3/2

A Two-Parameter Recursion Formula For Scalar Field Theory

We present a two-parameter family of recursion formulas for scalar field theory. The first parameter is the dimension $(D)$. The second parameter ($\zeta$) allows one to continuously extrapolate between Wilson's approximate recursion formula and the recursion formula of Dyson's hierarchical model. We show numerically that at fixed $D$, the critical exponent $\gamma$ depends continuously on $\zeta$. We suggest the use of the $\zeta -$independence as a guide to construct improved recursion formulas.Comment: 7 pages, uses Revtex, one Postcript figur

Extension of Lorenz Unpredictability

It is found that Lorenz systems can be unidirectionally coupled such that the chaos expands from the drive system. This is true if the response system is not chaotic, but admits a global attractor, an equilibrium or a cycle. The extension of sensitivity and period-doubling cascade are theoretically proved, and the appearance of cyclic chaos as well as intermittency in interconnected Lorenz systems are demonstrated. A possible connection of our results with the global weather unpredictability is provided.Comment: 32 pages, 13 figure