Related papers: How long is the Chaos Game?
A new class of particle systems with sequential interaction is proposed to approximate the McKean-Vlasov process that originally arises as the limit of the mean-field interacting particle system. The weighted empirical measure of this…
Consider a system of \(n\) players in which each initially starts on a different team. At each time step, we select an individual winner and an individual loser randomly and the loser joins the winner's team. The resulting Markov chain and…
The concept of structural invariance previously introduced by the authors is used to argue that the connection between random matrix theory and quantum systems with a chaotic classical counterpart is in fact largely exact in the…
Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state…
This article deals with classes of antagonistic games with two players. A game is specified in terms of two `hostile' stochastic processes representing mutual attacks upon random times exerting casualties of random magnitudes. The game ends…
We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. This, in turn, means that the parties exert a back-action on the causal…
We propose a class of two person perfect information games based on weighted graphs. One of these games can be described in terms of a round pizza which is cut radially into pieces of varying size. The two players alternately take pieces…
Given two equally long, uniformly random binary strings, the expected length of their longest common subsequence (LCS) is asymptotically proportional to the strings' length. Finding the proportionality coefficient $\gamma$, i.e. the limit…
Acting as a goalkeeper in a video-game, a participant is asked to predict the successive choices of the penalty taker. The sequence of choices of the penalty taker is generated by a stochastic chain with memory of variable length. It has…
We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability $p_{F}$ for the existence of Maker's strategy to claim a member of $F$ in the unbiased game played on…
Dynamical systems in nature exhibit selfsimilar fractal fluctuations and the corresponding power spectra follow inverse power law form signifying long-range space-time correlations identified as self-organized criticality. The physics of…
We study the kinetics of random sequential adsorption of a mixture of particles with continuous distribution of sizes for different deposition rules. It appears in the long time limit the resulting system can be described using the fractal…
In this paper we propose a method to define the range of stability of fixed points for a variety of discrete fractional systems of the order $0 < \alpha <2$. The method is tested on various forms of fractional generalizations of the…
The nearest neighbor distribution (Chandrasekhar 1943) is generalized to fractal stellar systems.For such systems an asymptotic distribution of the magnitude of large random forces and a formula for the effective mean interparticle spacing…
Chaotic transients occur in many experiments including those in fluids, in simulations of the plane Couette flow, and in coupled map lattices and they are a common phenomena in dynamical systems. Superlong chaotic transients are caused by…
We extend anytime constraints to the Markov game setting and the corresponding solution concept of an anytime-constrained equilibrium (ACE). Then, we present a comprehensive theory of anytime-constrained equilibria that includes (1) a…
We prove that zero-sum Dynkin games in continuous time with partial and asymmetric information admit a value in randomised stopping times when the stopping payoffs of the players are general \cadlag measurable processes. As a by-product of…
We present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to derive some known results about biased Maker-Breaker games.…
Here we define natural chaotic systems, like the earths weather and climate system, as chaotic systems which are open to the world so have constantly changing boundary conditions, and measurements of their states are subject to errors. In…
We describe some highlights in the theory of chaos, that started with Poincare (1899). Generic systems have both ordered and chaotic domains. Chaos appears mainly near un- stable periodic orbits. Large chaotic domains are due to resonance…