Related papers: Interacting urn models with strong reinforcement
This is the second part of a two-part investigation. We continue the study of a class of balanced urn schemes on balls of two colors (white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn and ball addition rules…
Majority dynamics is a process on a simple, undirected graph $G$ with an initial Red/Blue color for every vertex of $G$. Each day, each vertex updates its color following the majority among its neighbors, using its previous color for…
We characterize optimal mechanisms for the multiple-good monopoly problem and provide a framework to find them. We show that a mechanism is optimal if and only if a measure $\mu$ derived from the buyer's type distribution satisfies certain…
We report on the onset of anti-resonant behaviour of mass transport systems driven by time-dependent forces. Anti-resonances arise from the coupling of a sufficiently high number of space-time modes of the force. The presence of forces…
We consider the problem of how a trusted, but computationally bounded agent (a 'verifier') can learn to interact with one or more powerful but untrusted agents ('provers') in order to solve a given task. More specifically, we study the case…
In this paper, we consider the threshold-one contact process and the threshold-one voter model w/o spontaneous death on homogeneous trees $\mathbb{T}_d$, $d\ge 2$. Mainly inspired by the corresponding arguments for ordinary contact…
Generalized Friedman urn is one of the simplest and most useful models considered in probability theory. Since Athreya and Ney (1972) showed the almost sure convergence of urn proportions in a randomized urn model with irreducible…
Systems of interacting random replicators are studied using generating functional techniques. While replica analyses of such models are limited to systems with symmetric couplings, dynamical approaches as presented here allow specifically…
Control and manipulation are two of the most studied types of attacks on elections. In this paper, we study the complexity of control attacks on elections in which there are manipulators. We study both the case where the "chair" who is…
The use of interpolants in verification is gaining more and more importance. Since theories used in applications are usually obtained as (disjoint) combinations of simpler theories, it is important to modularly re-use interpolation…
Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors have bounded treedepth. These colorings have an implicit tradeoff between the…
This paper considers trial-offer markets where consumer preferences are modeled by a multinomial logit with social influence and position bias. The social signal for a product is given by its current market share raised to power r (or…
In this paper we extend the framework of evolutionary inspection game put forward recently by the author and coworkers to a large class of conflict interactions dealing with the pressure executed by the major player (or principal) on the…
Adaptive randomly reinforced urn (ARRU) is a two-color urn model where the updating process is defined by a sequence of non-negative random vectors $\{(D_{1,n}, D_{2,n});n\geq1\}$ and randomly evolving thresholds which utilize accruing…
In this work we prove sufficient conditions for the Glauber dynamics corresponding to a sequence of (non-product) measures on finite product spaces to be rapidly mixing, i.e. that the mixing time with respect to the total variation distance…
Contours associated to many interesting low-temperature statistical mechanics models (2D Ising model, (2+1)D SOS interface model, etc) can be described as self-interacting and self-avoiding walks on $\mathbb Z^2$. When the model is defined…
We study systems of interacting reinforced stochastic processes, where agents' decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…
Fr\'ed\'eric Meunier's question about a multicolored Sperner lemma is addressed, leaving the question of connectivity for the color hypergraphs of such a multicolored simplex. Sperner's lemma asserts the existence of a simplex using all the…
Talagrand's inequality for independent Bernoulli random variables is extended to many interacting particle systems (IPS). The main assumption is that the IPS satisfies a log-Sobolev inequality. In this context it is also shown that a…