Linear de-preferential urn models

Author:

Bandyopadhyay Antar,Kaur Gursharn

Abstract

Abstract In this paper we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the de-preferential urn scheme. We establish the almost-sure limit of the random configuration for any balanced replacement matrix R. In particular, we show that the limiting configuration is uniform on the set of colours if and only if R is a doubly stochastic matrix. We further establish the almost-sure limit of the vector of colour counts and prove central limit theorems for the random configuration as well as for the colour counts.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Statistics and Probability

Reference60 articles.

1. A percolation process on the square lattice where large finite clusters are frozen

2. Strong Laws for Balanced Triangular Urns

3. Bandyopadhyay A. and Sen S. (2017). De-preferential attachment random graphs. Preprint.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Azuma-Hoeffding bounds for a class of urn models;Statistics & Probability Letters;2024-01

2. Distributions of cherries and pitchforks for the Ford model;Theoretical Population Biology;2023-02

3. Fluctuations of balanced urns with infinitely many colours;Electronic Journal of Probability;2023-01-01

4. Negatively reinforced balanced urn schemes;Advances in Applied Mathematics;2019-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3