SearcharxivSearch

arXiv subjects

Debleena Thacker

Publications and source records attributed to Debleena Thacker.

11 recordsLinked to original sources

Tampered Memory Elephant Random Walk on One-Dimensional Integer Lattice

One of the outstanding questions in the theory of elephant random walks as observed by Gut and Stadtm\"uller (2023), is to determine how much memory is needed for a phase transition between the diffusive, critical and superdiffusive regimes to persist. To investigate this memory breakpoint, we introduce the tampered memory elephant random walk, in which the memory is partitioned into two disjoint sets $D_n$ and $D_n^c$, which may be deterministic or random. On $D_n^c$ the dynamics is the same as an elephant random walk, while on $D_n$ the increments are replaced by independent innovations. The resulting walk is thus driven by two competing components: elephant random walk and an independent simple random walk corresponding to the innovations. We first establish a law of large numbers when the increasing collections $\{D_n\}_{n \ge 1}$ and $\{D^c_n\}_{n \ge 1}$ have a renewal structure with exponential moments. We then identify a sharp threshold that governs the persistence of the phase transition for deterministic memory partitions. We show that if $\{D_n\}_{n \ge 1}$ is non-random increasing collection with increasing complement $\{D^c_n\}_{n \ge 1}$ such that $\lim_{n \to \infty} \frac{\lvert D^c_n\rvert}{n} >1/2$, then a phase transition into diffusive, critical and superdiffusive regimes persists, whereas for $\lim_{n \to \infty} \frac{\lvert D^c_n \rvert}{n}<1/2$, there is only the diffusive regime with $\mathcal{O}(\sqrt{n})$. The case of $\lim_{n\to \infty}\frac{\lvert D^c_n \rvert}{n}=1/2$ is also characterised. Thus, one-half emerges as the sharp breakpoint for the persistence of anomalous diffusion in this competitive setting. We conjecture that the same threshold governs the case when $\{D_n\}_{n \ge 1}$ is random. Our proofs rely on stochastic approximation applied to the two dependent competing components of the walk, representing the retained memory and the innovations.

math.PR

Long-range one-dimensional internal diffusion-limited aggregation

We study internal diffusion limited aggregation on $\mathbb{Z}$, where a cluster is grown incrementally by adding, for each random walk dispatched from the origin, the first site it reaches outside the cluster. We assume that the increment distribution $X$ of the driving random walks has $\mathbb{E} X =0$, but need neither be simple nor symmetric, and can have $\mathbb{E} (X^2) = \infty$, for example. For the case where $\mathbb{E} (X^2) < \infty$, we prove that after $m$ of the random walks have been dispatched, all but $o(m)$ sites in the cluster form an approximately symmetric contiguous block around the origin. This strengthens a result of Blach\`ere, for centred random walks whose increments have finite $3$rd moments, to the optimal moments condition. On the other hand, if $X$ is in the domain of attraction of a symmetric $\alpha$-stable law, $1 < \alpha <2$, we prove that the cluster contains a contiguous block of $\delta m +o(m)$ sites, where $0 < \delta < 1$, but, unlike the finite-variance case, one may not take $\delta=1$.

math.PR

Positive reinforced generalized time-dependent P\'olya urns via stochastic approximation

Consider a generalized time-dependent P\'olya urn process defined as follows. Let $d\in \mathbb{N}$ be the number of urns/colors. At each time $n$, we distribute $\sigma_n$ balls randomly to the $d$ urns, proportionally to $f$, where $f$ is a valid reinforcement function. We consider a general class of positive reinforcement functions $\mathcal{R}$ assuming some monotonicity and growth condition. The class $\mathcal{R}$ includes convex functions and the classical case $f(x)=x^{\alpha}$, $\alpha>1$. The novelty of the paper lies in extending stochastic approximation techniques to the $d$-dimensional case and proving that eventually the process will fixate at some random urn and the other urns will not receive any balls any more.

math.PR

Continuous time digital search tree and a border aggregation model

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 a relation between the height of the tree and the time required for aggregation. This relation carries over to the corresponding discrete-time models. As a consequence we find a very precise asymptotic result for the time to aggregation, using recent results by Drmota et al.\ (2020) for the digital search tree.

math.PR

Strong Convergence of Infinite Color Balanced Urns Under Uniform Ergodicity

We consider the generalization of the P\'olya urn scheme with possibly infinite many colors as introduced in \cite{Th-Thesis, BaTH2014, BaTh2016, BaTh2017}. For countable many colors, we prove almost sure convergence of the urn configuration under \emph{uniform ergodicity} assumption on the associated Markov chain. The proof uses a stochastic coupling of the sequence of chosen colors with a \emph{branching Markov chain} on a weighted \emph{random recursive tree} as described in \cite{BaTh2017, Sv_2018}. Using this coupling we estimate the covariance between any two selected colors. In particular, we reprove the limit theorem for the classical urn models with finitely many colors.

math.PR

Border aggregation model

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 neighbourhood of the border, at which point it joins this subset thus increasing the border by one point. Then a new particle is released from the origin and the process repeats until the origin becomes a part of the border itself. We are interested in the total number $\xi$ of particles to be released by this final moment. We show that this model covers OK Corral model as well as the erosion model, and obtain distributions and bounds for $\xi$ in cases where the graph is star graph, regular tree, and a $d-$dimensional lattice.

math.PR

A New Approach to Pólya Urn Schemes and Its Infinite Color Generalization

In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a branching Markov chain on random recursion tree. This enables us to derive fairly general asymptotic for our urn schemes. We then illustrate through several examples that our method can easily derive the classical results for finite urns, as well as, many new results for infinite color urns.

math.PR

Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs

In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of vertex, traversals. The technique relies on upper bound estimates for the number of edge traversals, proved in a different context by Cotar and Limic [Ann. Appl. Probab. (2009)] for finite graphs with edge reinforcement. We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected graphs of bounded degree. We stress that, unlike all previous results for processes with super-linear reinforcement, we make no other assumption on the graphs. For edge-reinforced random walks, we complete the results of Limic and Tarrès [Ann. Probab. (2007)] and we settle a conjecture of Sellke [Technical Report 94-26, Purdue University (1994)] by showing that for any reciprocally summable reinforcement weight function w, the walk traverses a random attracting edge at all large times. For vertex-reinforced random walks, we extend results previously obtained on Z by Volkov [Ann. Probab. (2001)] and by Basdevant, Schapira and Singh [Ann. Probab. (2014)], and on complete graphs by Benaim, Raimond and Schapira [ALEA (2013)]. We show that on any infinite connected graph of bounded degree, with reinforcement weight function w taken from a general class of reciprocally summable reinforcement weight functions, the walk traverses two random neighbouring attracting vertices at all large times.

math.PR

Rate of Convergence and Large Deviation for the Infinite Color Pólya Urn Schemes

In this work we consider the \emph{infinite color urn model} associated with a bounded increment random walk on $\Zbold^d$. This model was first introduced by Bandyopadhyay and Thacker (2013). We prove that the rate of convergence of the expected configuration of the urn at time $n$ with appropriate centering and scaling is of the order ${\mathcal O}\left(\frac{1}{\sqrt{\log n}}\right)$. Moreover we derive bounds similar to the classical Berry-Essen bound. Further we show that for the expected configuration a \emph{large deviation principle (LDP)} holds with a good rate function and speed $\log n$.

math.PR

P\'olya Urn Schemes with Infinitely Many Colors

In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced replacement schemes associated with bounded increment random walks on it. We prove central and local limit theorems for the random color of the $n$-th selected ball and show that irrespective of the null recurrent or transient behavior of the underlying random walks, the asymptotic distribution is Gaussian after appropriate centering and scaling. We show that the order of any non-zero centering is always ${\mathcal O}\left(\log n\right)$ and the scaling is ${\mathcal O}\left(\sqrt{\log n}\right)$. The work also provides similar results for urn models with infinitely many colors indexed by more general lattices in ${\mathbb R}^d$. We introduce a novel technique of representing the random color of the $n$-th selected ball as a suitably sampled point on the path of the underlying random walk. This helps us to derive the central and local limit theorems.

math.PR

Nonuniform random geometric graphs with location-dependent radii

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density function on $\mathbb{R}^d$. A vertex located at $x$ connects via directed edges to other vertices that are within a cut-off distance $r_n(x)$. We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large $n$ and (ii) the maximum and minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.

math.PR