activity
20122026
most citedPólya Urn Schemes with Infinitely Many Colors

17 citations · 26 across the 10 of their papers we have counts for

collaborators

11 papers

math.PR2026

Tampered Memory Elephant Random Walk on One-Dimensional Integer Lattice

Vinita Mulay, Neeraja Sahasrabudhe, Debleena Thacker

One of the outstanding questions in the theory of elephant random walks as observed by Gut and Stadtmüller (2023), is to determine how much memory is needed for a phase transition…

math.PR2024

Long-range one-dimensional internal diffusion-limited aggregation

Conrado da Costa, Debleena Thacker, Andrew Wade

We study internal diffusion limited aggregation on , where a cluster is grown incrementally by adding, for each random walk dispatched from the origin, the first site i…

math.PR2022★ 1 cited

Positive reinforced generalized time-dependent Pólya urns via stochastic approximation

Wioletta M. Ruszel, Debleena Thacker

Consider a generalized time-dependent Pólya urn process defined as follows. Let be the number of urns/colors. At each time , we distribute balls randomly…

math.PR2020

Continuous time digital search tree and a border aggregation model

Svante Janson, Debleena Thacker

We consider the continuous-time version of the random digital search tree, and construct a coupling with a border aggregation model as studied in Thacker and Volkov (2018), showing…

math.PR2019★ 1 cited

Strong Convergence of Infinite Color Balanced Urns Under Uniform Ergodicity

Antar Bandyopadhyay, Svante Janson, Debleena Thacker

We consider the generalization of the Pólya urn scheme with possibly infinite many colors as introduced in \cite{Th-Thesis, BaTH2014, BaTh2016, BaTh2017}. For countable many colors…

math.PR2017

Border aggregation model

Debleena Thacker, Stanislav Volkov

Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighb…