dorsal/arxiv
View SchemaTriggered urn models for frequently asked questions (FAQ)
| Authors | Irene Crimaldi, Andrea Ghiglietti, Leen Hatem, Hosam Mahmoud |
|---|---|
| Categories | |
| ArXiv ID | 2601.10337vv1 |
| URL | https://arxiv.org/abs/2601.10337 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
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 urn scheme in generality that covers a large number of special cases, such as Simon urn. For instance, we consider time dependent triggering probabilities. We identify regularity conditions on these probabilities that classify the schemes into those where the number of colors in the urn remains almost surely finite or increases to infinity and conditions that tell us whether all the existing colors are observed infinitely often or not. We determine the rank curve, too. In view of the broad generality of the trigger probabilities, a spectrum of limit distributions appears, from central limit theorems to Poisson approximation, to power-laws, revealing connections to Heap's exponent and Zipf's law. A combinatorial approach to the Simon urn is presented to indicate the possibility of such exact analysis, which is important for short-term predictions. Extensive simulations on real datasets (from Amazon sales) as well as computer-generated data clearly indicate that the asymptotic and exact theory developed agrees with practice.
{
"annotation_id": "b9359d16-eb8d-4119-8dd6-cb8bb35f6606",
"date_created": "2026-02-17T05:53:24.116000Z",
"date_modified": "2026-02-17T05:53:24.116000Z",
"file_hash": "a2191e32012d4b4aa80a59bb52382f006ff54746d93ebb663da716cbc59cdadc",
"private": false,
"record": {
"abstract": "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 urn scheme in generality that covers a large number of special cases, such as Simon urn. For instance, we consider time dependent triggering probabilities. We identify regularity conditions on these probabilities that classify the schemes into those where the number of colors in the urn remains almost surely finite or increases to infinity and conditions that tell us whether all the existing colors are observed infinitely often or not. We determine the rank curve, too. In view of the broad generality of the trigger probabilities, a spectrum of limit distributions appears, from central limit theorems to Poisson approximation, to power-laws, revealing connections to Heap\u0027s exponent and Zipf\u0027s law. A combinatorial approach to the Simon urn is presented to indicate the possibility of such exact analysis, which is important for short-term predictions. Extensive simulations on real datasets (from Amazon sales) as well as computer-generated data clearly indicate that the asymptotic and exact theory developed agrees with practice.",
"arxiv_id": "2601.10337",
"authors": [
"Irene Crimaldi",
"Andrea Ghiglietti",
"Leen Hatem",
"Hosam Mahmoud"
],
"categories": [
"math.PR"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Triggered urn models for frequently asked questions (FAQ)",
"url": "https://arxiv.org/abs/2601.10337",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "59ba1b81-de5a-4fa6-89ad-75b9bd5ae097",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}