Related papers: Dynamic monopolies with randomized starting config…
In this paper we study collective decision making on a multi-population, represented by a regular network of groups of individuals. Each group consists of a collection of players and every player can choose between two options. A group is…
A dynamic sieve method is designed according to the basic sieve method. It mainly refers to the symbolic dynamics theory. By this method, we could connect the prime system with familiar 'Logistic Mapping'. An interesting discovery is that…
We review the statistical mechanics approach to the study of the emerging collective behavior of systems of heterogeneous interacting agents. The general framework is presented through examples is such contexts as ecosystem dynamics and…
In this paper we introduce the concept of random time changes in dynamical systems. The subordination principle may be applied to study the long time behavior of the random time systems. We show, under certain assumptions on the class of…
The field of complex networks studies a wide variety of interacting systems by representing them as networks. To understand their properties and mutual relations, the randomisation of network connections is a commonly used tool. However,…
The problem of natural selection in dispersal-structured populations consisting of individuals characterized by different diffusion coefficients is studied. The competition between the organisms is taken into account through the assumption…
Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…
We study the dynamics of randomly connected networks composed of binary Boolean elements and those composed of binary majority vote elements. We elucidate their differences in both sparsely and densely connected cases. The quickness of…
For a graph $G$ and an integer-valued function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbors in it eventually yields…
We explore situations in which certain stochastic and high-dimensional deterministic systems behave effectively as low-dimensional dynamical systems. We define and study moment maps, maps on spaces of low-order moments of evolving…
A model for the dynamical evolution of a granular binary mixture is analyzed. This system is submitted to a tapping procedure, similarly to what is done in real experiments. In the weak vibration limit, an effective dynamics for the tapping…
A determinant property of the structure of a biological network is the distribution of local connectivity patterns, i.e., network motifs. In this work, a method for creating directed, unweighted networks while promoting a certain…
Population dynamics in random ecological networks are investigated by analyzing a simple deterministic equation. It is found that a sequence of abrupt changes of populations punctuating quiescent states characterize the long time behavior.…
Decision making under uncertainty is a key component of many AI settings, and in particular of voting scenarios where strategic agents are trying to reach a joint decision. The common approach to handle uncertainty is by maximizing expected…
An example of a discrete pregeometry on a microscopic scale is introduced. The model is a directed dyadic acyclic graph. This is the particular case of a causal set. The particles in this model must be self-organized repetitive structures.…
This work's purpose is to understand the dynamics of limit order books in order-driven markets. We try to illustrate a dynamical trading mechanism attached to the microstructure of limit order markets. We capture the iterative nature of…
This paper focuses on Majority Dynamics in sparse graphs, in particular, as a tool to study internal cuts. It is known that, in Majority Dynamics on a finite graph, each vertex eventually either comes to a fixed state, or oscillates with…
We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…
An analytical approach to network dynamics is used to show that when agents copy their state randomly the network arrives to a stationary status in which the distribution of states is independent of the agents degree. The effects of network…
In this paper, we consider robust control using randomized algorithms. We extend the existing order statistics distribution theory to the general case in which the distribution of population is not assumed to be continuous and the order…