243 citations · 326 across the 23 of their papers we have counts for
23 papers · 1 filter
Interacting Urn Schemes on Finite Ancestral Directed Acyclic Graphs
Antar Bandyopadhyay, Deborshi Das
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…
Generalised De-Preferential Random Graphs
Antar Bandyopadhyay, Kunal Joshi
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 verte…
De-Preferential Attachment Random Graphs
Antar Bandyopadhyay, Subhabrata Sen
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 l…
Right-Most Position of a Last Progeny Modified Time Inhomogeneous Branching Random Walk
Antar Bandyopadhyay, Partha Pratim Ghosh
In this work, we consider a modification of time \emph{inhomogeneous} branching random walk, where the driving increment distribution changes over time macroscopically. Following B…
Right-Most Position of a Last Progeny Modified Branching Random Walk
Antar Bandyopadhyay, Partha Pratim Ghosh
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 p…
S.L.L.N. and C.L.T. for Random Walks in I.I.D. Random Environment on Cayley Trees
Siva Athreya, Antar Bandyopadhyay, Amites Dasgupta +1
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 and $\mat…
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…
Generalized Pólya Urn Schemes with Negative but Linear Reinforcements
Antar Bandyopadhyay, Gursharn Kaur
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 ex…
A New Approach to Pólya Urn Schemes and Its Infinite Color Generalization
Antar Bandyopadhyay, Debleena Thacker
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 re…
Rate of Convergence and Large Deviation for the Infinite Color Pólya Urn Schemes
Antar Bandyopadhyay, Debleena Thacker
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 Tha…
Random Walks in I.I.D. Random Environment on Cayley Trees
Siva Athreya, Antar Bandyopadhyay, Amites Dasgupta
We consider the random walk in an \emph{i.i.d.} random environment on the infinite -regular tree for . We consider the tree as a Cayley graph of free product of finite…
Pólya Urn Schemes with Infinitely Many Colors
Antar Bandyopadhyay, Debleena Thacker
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 b…
On the Nearest Neighbor Algorithm for Mean Field Traveling Salesman Problem
Antar Bandyopadhyay, Farkhondeh Sajadi
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 . This paper focus on the \emph{n…
Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices
Antar Bandyopadhyay, Farkhondeh Sajadi
For connectivity of \emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider i.i.d. \emph{Cantor} distributed points o…
On the Expected Total Number of Infections for Virus Spread on a Finite Network
Antar Bandyopadhyay, Farkhondeh Sajadi
In this paper we consider a simple virus infection spread model on a finite population of agents connected by some neighborhood structure. Given a graph on vertices, we…
On the One Dimensional Critical "Learning from Neighbours" Model
Antar Bandyopadhyay, Rahul Roy, Anish Sarkar
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 u…
On the Cluster Size Distribution for Percolation on Some General Graphs
Antar Bandyopadhyay, Jeffrey Steif, Adam Timar
We show that for any Cayley graph, the probability (at any ) that the cluster of the origin has size n decays at a well-defined exponential rate (possibly 0). For general graphs…
Counting without sampling. New algorithms for enumeration problems using statistical physics
Antar Bandyopadhyay, David Gamarnik
We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth.…
Random Walk in Dynamic Markovian Random Environment
Antar Bandyopadhyay, Ofer Zeitouni
We consider a model, introduced by Boldrighini, Minlos and Pellegrinotti, of random walks in dynamical random environments on the integer lattice Z^d with d>=1. In this model, the…
Bivariate Uniqueness and Endogeny for Recursive Distributional Equations : Two Examples
Antar Bandyopadhyay
This paper has been withdrawn by the author because of finding a flaw in the proof of endogeny for the Frozen Percolation RDE which was one of two examples discussed in this paper.…
Bivariate Uniqueness and Endogeny for the Logistic Recursive Distributional Equation
Antar Bandyopadhyay
In this article we prove the bivariate uniqueness property for a particular ``max-type'' recursive distributional equation (RDE). Using the general theory developed by Aldous and B…
A survey of max-type recursive distributional equations
David J. Aldous, Antar Bandyopadhyay
In certain problems in a variety of applied probability settings (from probabilistic analysis of algorithms to statistical physics), the central requirement is to solve a recursive…
How to Combine Fast Heuristic Markov Chain Monte Carlo with Slow Exact Sampling
David J. Aldous, Antar Bandyopadhyay
Use each of n exact samples as the initial state for a MCMC sampler run for m steps. We give confidence intervals for accuracy of estimators which are always valid and which, in ce…