相关论文: Analysis of Large Urn Models with Local Mean-Field…

We consider interacting urns on a finite directed network, where both sampling and reinforcement processes depend on the nodes of the network. This extends previous research by incorporating node-dependent sampling and reinforcement. We…

This paper extends the link between stochastic approximation (SA) theory and randomized urn models developed in Laruelle, Pag{\`e}s (2013), and their applications to clinical trials introduced in Bai, HU (1999,2005) and Bai, Hu, Shen…

Motivated by considerations from neuroscience (macroscopic behavior of large ensembles of interacting neurons), we consider a population of mean field interacting diffusions in $\mathbf {R}^m$ in the presence of a random environment and…

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…

We consider a model of N two-colors urns in which the reinforcement of each urn depends also on the content of all the other urns. This interaction is of mean-field type and it is tuned by a parameter $\alpha$ in [0,1]; in particular, for…

This paper considers an $n$-particle jump-diffusion system with mean filed interaction, where the coefficients are locally Lipschitz continuous. We address the convergence as $n\to\infty$ of the empirical measure of the jump-diffusions to…

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…

We study a class of interacting particle systems on $\mathbb{R}$ with two types. Particles evolve by independent jumps sampled from a fixed distribution, with type-dependent jump rates $v_+$, $v_-$ and stochastic type switching driven by…

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…

We introduce a modification of the generalized P\'olya urn model containing two urns and we study the number of balls $B_j(n)$ of a given color $j\in\{1,\ldots,J\}$, $J\in\mathbb{N}$ added to the urns after $n$ draws. We provide sufficient…

Recently several authors have proposed stochastic models of the growth of the Web graph that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the ``rich get richer''…

We describe a microcanonical approach for polymer models that combines atmospheric methods with urn theory. We show that Large Deviation Properties of urn models can provide quite deep mathematical insight by analyzing the Random Walk Range…

The problem of reservation in a large distributed system is analyzed via a new mathematical model. A typical application is a station-based car-sharing system which can be described as a closed stochastic network where the nodes are the…

In this article, we study an interacting particle system in the context of epidemiology where the individuals (particles) are characterized by their position and infection state. We begin with a description at the microscopic level where…

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…

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 particle systems with mean-field interactions whose distribution is invariant by translations. Under the assumption that the system seen from its centre of mass be reversible with respect to a Gibbs measure, we establish large…

Consider throwing $n$ balls at random into $m$ urns, each ball landing in urn $i$ with probability $p_i$. Let $S$ be the resulting number of singletons, i.e., urns containing just one ball. We give an error bound for the Kolmogorov distance…

We propose a particle system of diffusion processes coupled through a chain-like network structure described by an infinite-dimensional, nonlinear stochastic differential equation of McKean-Vlasov type. It has both (i) a local chain…

We propose a generalized Ehrenfest urn model of many urns arranged periodically along a circle. The evolution of the urn model system is governed by a directed stochastic operation. Method for solving an $N$-ball, $M$-urn problem of this…