English
Related papers

Related papers: Interacting urn models with strong reinforcement

200 papers

Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…

Combinatorics · Mathematics 2021-04-08 Zdeněk Dvořák , Jakub Pekárek , Torsten Ueckerdt , Yelena Yuditsky

For n>=1 let X_n be a vector of n independent Bernoulli random variables. We assume that X_n consists of M "blocks" such that the Bernoulli random variables in block i have success probability p_i. Here M does not depend on n and the size…

Probability · Mathematics 2012-08-15 Erik Broman , Tim van de Brug , Wouter Kager , Ronald Meester

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

Number Theory · Mathematics 2023-01-10 Hong Liu , Péter Pál Pach , Csaba Sándor

We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives. This corrects an error and improves a result of [Sanver,…

Computer Science and Game Theory · Computer Science 2017-07-28 Dominik Peters

An extended Polya urn Model with two colors, black and white, is studied with some SLLN and CLT on the proportion of white balls.

Probability · Mathematics 2021-09-17 Rafik Aguech , Wissem Jedidi , Olfa Selmi

We consider the problem of inferring a graphical Potts model on a population of variables, with a non-uniform number of Potts colors (symbols) across variables. This inverse Potts problem generally involves the inference of a large number…

In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known…

Discrete Mathematics · Computer Science 2009-12-17 Jaroslaw Byrka , Andreas Karrenbauer , Laura Sanita

P\'olya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule depends on the colour of the drawn ball and the value of…

Probability · Mathematics 2019-12-04 Cyril Banderier , Philippe Marchal , Michael Wallner

We consider a system of $N$ individuals consisting of $S$ species that interact pairwise: $x_m+x_\ell \rightarrow 2x_m\,\,$ with arbitrary probabilities $p_m^\ell $. With no spatial structure, the master equation yields a simple set of rate…

Statistical Mechanics · Physics 2011-01-05 R. K. P. Zia

We study the necessity of interaction for obtaining efficient allocations in subadditive combinatorial auctions. This problem was originally introduced by Dobzinski, Nisan, and Oren (STOC'14) as the following simple market scenario: $m$…

Computer Science and Game Theory · Computer Science 2017-05-05 Sepehr Assadi

We consider a time-dependent version of a P\'olya urn containing black and white balls. At each time $n$ a ball is drawn from the urn at random and replaced in the urn along with $\sigma_n$ additional balls of the same colour. The…

Probability · Mathematics 2018-07-16 Nadia Sidorova

We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to…

Computer Science and Game Theory · Computer Science 2014-09-16 Martin Hoefer , Lisa Wagner

We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…

Dynamical Systems · Mathematics 2021-08-13 Giovanni B. Escolano , Neil Mañibo , Eden Delight Miro

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

Though widely used in applications, reinforced random walk on graphs have never been the subject of a valid statistical inference. We develop in this paper a statistical framework for a general two-colored urn model. The probability to draw…

Statistics Theory · Mathematics 2016-10-05 Line Chloé Le Goff , Philippe Soulier

In this paper we consider an interacting particle system modeled as a system of $N$ stochastic differential equations driven by Brownian motions with a drift term including a confining potential acting on each particle, and an interaction…

Probability · Mathematics 2007-05-23 Matteo Ortisi

We consider a one-dimensional nearest-neighbor interacting particle system, which is a mixture of the simple exclusion process and the voter model. The state space is taken to be the countable set of the configurations that have a finite…

Probability · Mathematics 2007-07-02 Vladimir Belitsky , Pablo A. Ferrari , Mikhail V. Menshikov , Serguei Yu. Popov

In this paper, we introduce the Iterative Persuasion-Polarization (IPP) model to study the dynamics of opinion formation and change within a population. The IPP model integrates mechanisms of persuasion and repulsion, where individuals…

Physics and Society · Physics 2024-08-02 Fei Cao , Stephanie Reed

The competition between parametric resonance (PR) and dissipation is studied in the damped Kronig-Penney model, with time-dependent dissipation rate gamma(t). In the classical case, it is shown that dissipation leaves just a finite number…

Classical Physics · Physics 2018-12-04 Loris Ferrari

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Functional Analysis · Mathematics 2012-08-14 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Hugo J. Woerdeman