Related papers: On affine multi-color urns grown under multiple dr…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…
Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with…
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number…
For the renormalised sums of the random $\pm 1$-colouring of the connected components of $\mathbb Z$ generated by the coalescing renewal processes in the "power law P\'olya's urn" of Hammond and Sheffield we prove functional convergence…
We propose a variant model of P{\'o}lya urn process, where the dynamics consist of two competing elements namely, suppression of growth and enhancement of dormant character. Here the level of such features are controlled by an internal…
We present a multiple colour generalisation of the model of graph interacting urns studied by Benaim et. al., Random Struct. Alg., 46: 614-634, 2015. We show that for complete graphs and for a broad class of reinforcement functions…
In the present paper, we consider the two-color nonlinear unbalanced urn model, under a drawing rule reinforced by an $\mathbb{R}^+$-valued concave function and an unbalanced replacement matrix. The large deviation inequalities for the…
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 introduce a class of reinforcement models where, at each time step $t$, one first chooses a random subset $A_t$ of colours (independent of the past) from $n$ colours of balls, and then chooses a colour $i$ from this subset with…
Discrete-time affine processes are widely used in finance and economics and encompass count, positive, and nonnegative-valued processes. This paper develops near-unit-root asymptotic theory for this class of models. Unlike linear AR(1)…
In this paper we discuss metric theory associated with the affine (inhomogeneous) linear forms in the so called doubly metric settings within the classical and the mixed setups. We consider the system of affine forms given by $\qq\mapsto…
Consider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn…
We investigate a nonclassic urn model with triggers that increase the number of colors. The scheme has emerged as a model for web services that set up frequently asked questions (FAQ). We present a thorough asymptotic analysis of the FAQ…
We consider a special case of the generalized P\'{o}lya's urn model introduced by Benaim et al (2013). Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete…
We consider an urn model, whose replacement matrix has all entries nonnegative and is balanced, that is, has constant row sums. We obtain the rates of the counts of balls corresponding to each color for the strong laws to hold. The analysis…
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
In this article, we further develop the thermodynamic formalism of affine iterated function systems with countably many transformations by showing the existence and extending earlier characterisations of the equilibrium states of finite…
This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…