相关论文: How long is the Chaos Game?

The scope of the paper is the theoretical analysis of the time rate in which a dynamical system reaches a stable stationary state or stable oscillations. The method used for the analysis is based on the so-called iterative time profiles,…

Machine learning processes, e.g. ''learning in games'', can be viewed as non-linear dynamical systems. In general, such systems exhibit a wide spectrum of behaviors, ranging from stability/recurrence to the undesirable phenomena of chaos…

It is shown that conductance fluctuations due to phase coherent ballistic transport through a chaotic cavity generically are fractals. The graph of conductance vs. externally changed parameter, e.g. magnetic field, is a fractal with…

We study several variants of the classical card game war. As anyone who played this game knows, the game can take some time to terminate, but it usually does. Here, we analyze a number of asymptotic variants of the game, where the number of…

While there have been many publications on potential applications of chaos to fields such as communications, radar, sonar, random signal generation, channel equalization and others, designing continuous chaotic systems is still an unsolved…

We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals:…

This work considers stochastic differential games with a large number of players, whose costs and dynamics interact through the empirical distribution of both their states and their controls. We develop a new framework to prove convergence…

Gerber and Li in \cite{GeLi} formulated, using a Markov chain embedding, a system of equations that describes relations between generating functions of waiting time distributions for occurrences of patterns in a sequence of independent…

Morphogenesis, as it is understood in a wide sense by Ren\'e Thom, is considered for various types of chaos. That is, those, obtained by period-doubling cascade, Devaney's and Li-Yorke chaos. Moreover, in discussion form we consider…

We propose a new model of a distributed game, called an ATS game, which is played on a non-deterministic asynchronous transition system -- a natural distributed finite-state device working on Mazurkiewicz traces. This new…

We explore the cycle types of a class of biased random derangements, described as a random game played by some children labeled $1,\cdots,n$. Children join the game one by one, in a random order, and randomly form some circles of size at…

Stochastic games are a natural model for the synthesis of controllers confronted to adversarial and/or random actions. In particular, $\omega$-regular games of infinite length can represent reactive systems which are not expected to reach a…

We consider a zero-sum stochastic game for continuous-time Markov chain with countable state space and unbounded transition and pay-off rates. The additional feature of the game is that the controllers together with taking actions are also…

Fractal structures appear in a vast range of physical systems. A literature survey including all experimental papers on fractals which appeared in the six Physical Review journals (A-E and Letters) during the 1990's shows that experimental…

In recent years, there has been a growing interest in games on graphs within the research community, fueled by their relevance in applications such as economics, politics, and epidemiology. This paper aims to comprehensively detail the…

A stochastic modification of Conway's cellular automaton "Life" is introduced here. Any cell could be perturbed spontaneously to the opposite (dead or alive) state at any iteration with a very low probability. This probability is assumed to…

The recently discovered Parrondo's paradox claims that two losing games can result, under random or periodic alternation of their dynamics, in a winning game: "losing+losing=winning". In this paper we follow Parrondo's philosophy of…

This brief paper describes the single-player card game called "Perpetual Motion" and reports on a computational analysis of the game's outcome. The analysis follows a Monte Carlo methodology based on a sample of 10,000 randomly generated…

The online semi-random graph process is a one-player game which starts with the empty graph on $n$ vertices. At every round, a player (called Builder) is presented with a vertex $v$ chosen uniformly at random and independently from previous…

In this paper, random and stochastic processes are defined on fractal curves. Fractal calculus is used to define cumulative distribution function, probability density function, moments, variance and correlation function of stochastic…