Related papers: Interacting urn models with strong reinforcement

An urn contains black and red balls. Let $Z_n$ be the proportion of black balls at time $n$ and $0\leq L<U\leq 1$ random barriers. At each time $n$, a ball $b_n$ is drawn. If $b_n$ is black and $Z_{n-1}<U$, then $b_n$ is replaced together…

This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…

We propose a stochastic model of opinion exchange in networks. A finite set of agents is organized in a fixed network structure. There is a binary state of the world and each agent receives a private signal on the state. We model beliefs as…

We study the Popular Matching problem in multiple models, where the preferences of the agents in the instance may change or may be unknown/uncertain. In particular, we study an Uncertainty model, where each agent has a possible set of…

The lambda calculus is not upward confluent, one of counterexamples known thanks to Plotkin. This paper investigates upward confluence in the interaction calculus. Can an interaction system have this property? We positively answer this…

An urn model of Diaconis and some generalizations are discussed. A convergence theorem is proved that implies for Diaconis' model that the empirical distribution of balls in the urn converges with probability one to the uniform…

A one-dimensional interacting particle system is said to exhibit interface tightness if starting in an initial condition describing the interface between two constant configurations of different types, the process modulo translations is…

In social choice theory with ordinal preferences, a voting method satisfies the axiom of positive involvement if adding to a preference profile a voter who ranks an alternative uniquely first cannot cause that alternative to go from winning…

We study popularity for matchings under preferences. This solution concept captures matchings that do not lose against any other matching in a majority vote by the agents. A popular matching is said to be robust if it is popular among…

We prove that a first-order cooperative system of interacting agents converges to consensus if the so-called Persistence Excitation condition holds. This condition requires that the interaction function between any pair of agents satisfies…

A classical P\'olya urn scheme is a Markov process whose evolution is encoded by a replacement matrix $(R_{i,j})_{1\leq i,j\leq d}$. At every discrete time-step, we draw a ball uniformly at random, denote its colour $c$, and replace it in…

Competing urns refers to the random experiment where m balls are dropped, randomly and independently, into urns 1,...,n. Formally, we have a random map $\sigma$ from {1,...,m} to {1,...,n} with the $\sigma(i)$'s i.i.d. With $x_j$ the…

We consider a generalization of the Bernoulli-Laplace model in which there are two urns and $n$ total balls, of which $r$ are red and $n - r$ white, and where the left urn holds $m$ balls. At each time increment, $k$ balls are chosen…

There are $n$ independent Bernoulli random variables with parameters $p_i$ that are observed sequentially. Two players, A and B, act in turns starting with player A. Each player has the possibility on his turn, when $I_k=1$, to choose…

We are given a bipartite graph $G = \left( A \cup B, E \right)$. In the one-sided model, every $a \in A$ (often called agents) ranks its neighbours $z \in N_{a}$ strictly, and no $b \in B$ has any preference order over its neighbours $y \in…

Can strong repulsive interactions be shown to give rise to pairing in a controlled way? We find that for a single flavor polarized band, there is a small expansion parameter in the low density limit, once the Bloch wavefunction form factor…

We prove that every geometric Lorenz attractor has superpolynomial decay of correlations with respect to the unique SRB measure. Moreover, we prove the Central Limit Theorem and Almost Sure Invariance Principle for the time-1 map of the…

In the present paper we prove that the probabilities of the P\'olya urn distribution (with negative replacement) satisfy a monotonicity property similar to that of the binomial distribution (P\'olya urn distribution with no replacement). As…

We study the ordering kinetics of a generalization of the voter model with long-range interactions, the $p$-voter model, in one dimension. It is defined in terms of boolean variables $S_{i}$, agents or spins, located on sites $i$ of a…

In common-interest stochastic games all players receive an identical payoff. Players participating in such games must learn to coordinate with each other in order to receive the highest-possible value. A number of reinforcement learning…