Search Results - "Bandyopadhyay, Antar"

Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models by Bandyopadhyay, Antar, Gamarnik, David

“…In this article we propose new methods for computing the asymptotic value for the logarithm of the partition function (free energy) for certain statistical…”
Get full text

A new approach to Pólya urn schemes and its infinite color generalization by Bandyopadhyay, Antar, Thacker, Debleena

“…In this work, we introduce a generalization of the classical Pólya urn scheme (Ann. Inst. Henri Poincaré 1 (1930) 117–161) with colors indexed by a Polish…”
Get full text

Pólya urn schemes with infinitely many colors by Bandyopadhyay, Antar, Thacker, Debleena

Get full text

Right-most position of a last progeny modified time inhomogeneous branching random walk by Bandyopadhyay, Antar, Ghosh, Partha Pratim

“…In this work, we consider a modification of the time inhomogeneous branching random walk, where the driving increment distribution changes over time…”
Get full text

Linear de-preferential urn models by Bandyopadhyay, Antar, Kaur, Gursharn

“…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…”
Get full text

Pólya urn schemes with infinitely many colors by BANDYOPADHYAY, ANTAR, THACKER, DEBLEENA

“…In this work, we introduce a class of balanced urn schemes with infinitely many colors indexed by ℤd, where the replacement schemes are given by the transition…”
Get full text

Strong convergence of infinite color balanced urns under uniform ergodicity by Bandyopadhyay, Antar, Janson, Svante, Thacker, Debleena

“…We consider the generalization of the Pólya urn scheme with possibly infinitely many colors, as introduced in [37], [4], [5], and [6]. For countably many…”
Get full text

Rate of convergence and large deviation for the infinite color Pólya urn schemes by Bandyopadhyay, Antar, Thacker, Debleena

“…In this work we consider the infinite color urn model associated with a bounded increment random walk on Zd. This model was first introduced in  Bandyopadhyay…”
Get full text

SLLN and annealed CLT for random walks in I.I.D. random environment on Cayley trees by Athreya, Siva, Bandyopadhyay, Antar, Dasgupta, Amites, Sahasrabudhe, Neeraja

“…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 Z…”
Get full text

ON THE EXPECTED TOTAL NUMBER OF INFECTIONS FOR VIRUS SPREAD ON A FINITE NETWORK by Bandyopadhyay, Antar, Sajadi, Farkhondeh

“…In this work we consider a simple SIR infection spread model on a finite population of n agents represented by a finite graph G. Starting with a fixed set of…”
Get full text

On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem by Bandyopadhyay, Antar, Sajadi, Farkhondeh

“…In this work we consider the mean-field traveling salesman problem, where the intercity distances are taken to be independent and identically distributed with…”
Get full text

On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem by Bandyopadhyay, Antar, Sajadi, Farkhondeh

“…In this work we consider the mean-field traveling salesman problem , where the intercity distances are taken to be independent and identically distributed with…”
Get full text

On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem by Bandyopadhyay, Antar, Sajadi, Farkhondeh

“…In this work we consider the mean-field traveling salesman problem , where the intercity distances are taken to be independent and identically distributed with…”
Get full text

The connectivity threshold of random geometric graphs with Cantor distributed vertices by Bandyopadhyay, Antar, Sajadi, Farkhondeh

“…For the connectivity of random geometric graphs, where there is no density for the underlying distribution of the vertices, we consider n i.i.d. Cantor…”
Get full text

Variance estimation for tree-order restricted models by Bandyopadhyay, Antar, Chaudhuri, Sanjay

“…In this article, we discuss the estimation of the common variance of several normal populations with tree-order restricted means. We discuss the asymptotic…”
Get full text

Random walks in I.I.D. random environment on Cayley trees by Athreya, Siva, Bandyopadhyay, Antar, Dasgupta, Amites

“…We consider the random walk in an i.i.d. random environment on the infinite d-regular tree for d≥3. We consider the tree as a Cayley graph of the free product…”
Get full text

A Survey of Max-Type Recursive Distributional Equations by Aldous, David J., Bandyopadhyay, Antar

“…In certain problems in a variety of applied probability settings (from probabilistic analysis of algorithms to statistical physics), the central requirement is…”
Get full text

A Necessary and Sufficient Condition for the Tail-Triviality of a Recursive Tree Process by Bandyopadhyay, Antar

“…Given a recursive distributional equation (RDE) and a solution μ of it, we consider the tree indexed invariant process called the recursive tree process (RTP)…”
Get full text

Right-Most Position of a Last Progeny Modified Time Inhomogeneous Branching Random Walk by Bandyopadhyay, Antar, Ghosh, Partha Pratim

“…Statistics & Probability Letters, 193: Paper No. 109697 (2023), 1-8 In this work, we consider a modification of time \emph{inhomogeneous} branching random…”
Get full text

Right-Most Position of a Last Progeny Modified Branching Random Walk by Bandyopadhyay, Antar, Ghosh, Partha Pratim

“…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.)…”
Get full text