SearcharxivSearch

arXiv subjects

Antar Bandyopadhyay

Publications and source records attributed to Antar Bandyopadhyay.

At least 19 recordsLinked to original sources

Interacting Urn Schemes on Finite Ancestral Directed Acyclic Graphs

We study interacting finite-color urn schemes on directed acyclic graphs, allowing the graph to be infinite. Each urn evolves through reinforcements driven by colors drawn from its in-neighboring urns via edge-dependent reinforcement matrices. Assuming that every vertex has only finitely many ancestors, we prove almost sure convergence of urn proportions and show that the limiting configuration is determined by vertices with no ancestors or self-loops. Under additional balance and irreducibility assumptions on reinforcement matrices, we also obtain second-order asymptotic results in all regimes of appropriately defined parameters.

math.PR

Generalised De-Preferential Random Graphs

We consider some further generalizations of the novel random graph models as introduced by Bandyopadhyay and Sen \cite{BaSe2025} and find asymptotic for the degree of a fixed vertex and along with the asymptotic degree distribution. We show that in the \emph{case of the inverse power law} the order of these statistics is much slower than the case of the simple inverse function, which was considered in \cite{BaSe2025}. However, the results for the linear case remain exactly the same even after introducing a "shift" parameter.

math.PR

De-Preferential Attachment Random Graphs

In this work we consider a growing random graph sequence where a new vertex is less likely to join to an existing vertex with high degree and more likely to join to a vertex with low degree. In contrast to the well studied \emph{preferential attachment random graphs} \cite{BarAlb99}, we call such a sequence a \emph{de-preferential attachment random graph model}. We consider two types of models, namely, \emph{inverse de-preferential}, where the attachment probabilities are inversely proportional to the degree and \emph{linear de-preferential}, where the attachment probabilities are proportional to $c-$degree, where $c > 0$ is a constant. For the case when each new vertex comes with exactly one half-edge we show that the degree of a fixed vertex is asymptotically of the order $\sqrt{\log n}$ for the inverse de-preferential case and of the order $\log n$ for the linear case. These show that compared to preferential attachment, the degree of a fixed vertex grows to infinity at a much slower rate for these models. We also show that in both cases limiting degree distributions have exponential tails. In fact we show that for the inverse de-preferential model the tail of the limiting degree distribution is faster than exponential while that for the linear de-preferential model is exactly the $\mbox{Geometric}\left(\frac{1}{2}\right)$ distribution. For the case when each new vertex comes with $m > 1$ half-edges, we show that similar asymptotic results hold for fixed vertex degree in both inverse and linear de-preferential models. Our proofs make use of the martingale approach as well as embedding to certain continuous time age dependent branching processes.

math.PR

Right-Most Position of a Last Progeny Modified Branching Random Walk

In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the $n$-th generation, which may be different from the driving increment distribution. We call this process last progeny modified branching random walk (LPM-BRW). Depending on the value of a parameter, $θ$, we classify the model in three distinct cases, namely, the boundary case, below the boundary case, and above the boundary case. Under very minimal assumptions on the underlying point process of the increments, we show that at the boundary case, $θ=θ_0$, where $θ_0$ is a parameter value associated with the displacement point process, the maximum displacement converges to a limit after only an appropriate centering, which is of the form $c_1 n - c_2 \log n$. We give an explicit formula for the constants $c_1$ and $c_2$ and show that $c_1$ is exactly the same, while $c_2$ is $1/3$ of the corresponding constants of the usual BRW Aidekon (2013). We also characterize the limiting distribution. We further show that below the boundary, $θ< θ_0$, the logarithmic correction term is absent. For above the boundary case, $θ> θ_0$, the logarithmic correction term is exactly the same as that of the classical BRW. For $θ\leq θ_0$, we further derive Brunet-Derrida -type results of point process convergence of our LPM-BRW to a Poisson point process. Our proofs are based on a novel method of coupling the maximum displacement with a linear statistic associated with a more well-studied process in statistics, known as the smoothing transformation.

math.PR

Right-Most Position of a Last Progeny Modified Time Inhomogeneous Branching Random Walk

In this work, we consider a modification of time \emph{inhomogeneous} branching random walk, where the driving increment distribution changes over time macroscopically. Following Bandyopadhyay and Ghosh (2021), we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the last generation. We call this process \emph{last progeny modified time inhomogeneous branching random walk (LPMTI-BRW)}. Under very minimal assumptions on the underlying point processes of the displacements, we show that the maximum displacement converges to a limit after only an appropriate centering which is either linear or linear with a logarithmic correction. Interestingly, the limiting distribution depends only on the first set of increments. We also derive Brunet-Derrida-type results of point process convergence of our LPMTI-BRW to a decorated Poisson point process. As in the case of the maximum, the limiting point process also depends only on the first set of increments. Our proofs are based on the method of coupling the maximum displacement with the smoothing transformation, which was introduced by Bandyopadhyay and Ghosh (2021).

math.PR

S.L.L.N. and C.L.T. for Random Walks in I.I.D. Random Environment on Cayley Trees

We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a regular tree. Under a uniform elipticity assumption on the i.i.d. environment we show that the walk has positive speed and establish the annealed central limit theorem for the graph distance of the walker from the starting point.

math.PR

Strong Convergence of Infinite Color Balanced Urns Under Uniform Ergodicity

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, 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

Generalized Pólya Urn Schemes with Negative but Linear Reinforcements

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 \emph{negatively reinforced} urn scheme. We establish almost sure limit of the random configuration for any \emph{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 \emph{doubly stochastic} matrix. We further establish 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.

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

Variance Estimation for Tree Order Restricted Models

In this article we discuss estimation of the common variance of several normal populations with tree order restricted means. We discuss the asymptotic properties of the maximum likelihood estimator of the variance as the number of populations tends to infinity. We consider several cases of various orders of the sample sizes and show that the maximum likelihood estimator of the variance may or may not be consistent or be asymptotically normal.

math.ST

Pólya 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

Random Walks in I.I.D. Random Environment on Cayley Trees

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the i.i.d. environment as invariant under the action of this group. Under a mild non-degeneracy assumption we show that the walk is always transient.

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

On the Expected Total Number of Infections for Virus Spread on a Finite Network

In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices. At each discrete time step, an infected vertex tries to infect its neighbors with probability $β\in (0,1)$ independently of others and then it dies out. The process continues till all infected vertices die out. We focus on obtaining proper lower bounds on the expected number of ever infected vertices. We obtain a simple lower bound, using \textit{breadth-first search} algorithm and show that for a large class of graphs which can be classified as the ones which locally "look like" a tree in sense of the \emph{local weak convergence}, this lower bound gives better approximation than some of the known approximations through matrix-method based upper bounds derived by Draief, Ganesh and Massoulie in 2008.

math.PR

On the Nearest Neighbor Algorithm for Mean Field Traveling Salesman Problem

In this work we consider the mean field traveling salesman problem, where the intercity distances are taken to be i.i.d. with some distribution $F$. This paper focus on the \emph{nearest neighbor tour} which is to move to the nearest non-visited city and we show that under some conditions on $F$, which are satisfied by exponential distribution with constant mean, the total length of the nearest neighbor tour, asymptotically almost surely scales as $\log n$. Similar result is known for Euclidean TSP and nearest neighbor tour. We further derive the limiting behavior of the total length of the nearest neighbor tour for more general distribution function $F$ and show that its asymptotic properties are determined by the scaling properties of the density of $F$ at 0.

math.PR

Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices

For connectivity of \emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. \emph{Cantor} distributed points on $[0,1]$. We show that for this random geometric graph, the connectivity threshold $R_{n}$, converges almost surely to a constant $1-2ϕ$ where $0 < ϕ< 1/2$, which for the standard Cantor distribution is 1/3. We also show that $\| R_n - (1 - 2 ϕ) \|_1 \sim 2 \, C(ϕ) \, n^{-1/d_ϕ}$ where $C(ϕ) > 0$ is a constant and $d_ϕ := - {\log 2}/{\log ϕ}$ is the \emph{Hausdorff dimension} of the generalized Cantor set with parameter $ϕ$.

math.PR

On the One Dimensional Critical "Learning from Neighbours" Model

We consider a model of a discrete time "interacting particle system" on the integer line where infinitely many changes are allowed at each instance of time. We describe the model using chameleons of two different colours, {\it viz}., red ($R$) and blue ($B$). At each instance of time each chameleon performs an independent but identical coin toss experiment with probability $α$ to decide whether to change its colour or not. If the coin lands head then the creature retains its colour (this is to be interpreted as a "success"), otherwise it observes the colours and coin tosses of its two nearest neighbours and changes its colour only if, among its neighbors and including itself, the proportion of successes of the other colour is larger than the proportion of successes of its own colour. This produces a Markov chain with infinite state space ${R, B}^{\Zbold}$. This model was first studied by Chatterjee and Xu (2004) where different colours had different success probabilities. In this work we consider the "critical" case where the success probability, $α$, is the same irrespective of the colour of the chameleon. We show that starting from any initial translation invariant distribution of colours the Markov chain converges to a limit of a single colour, i.e., even at the critical case there is no "coexistence" of the two colours at the limit. Moreover we show that starting with an i.i.d. colour distribution the limiting distribution gives some advantage to the "underdog".

math.PR

On the Cluster Size Distribution for Percolation on Some General Graphs

We show that for any Cayley graph, the probability (at any $p$) that the cluster of the origin has size n decays at a well-defined exponential rate (possibly 0). For general graphs, we relate this rate being positive in the supercritical regime with the amenability/nonamenability of the underlying graph.

math.PR