1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.PR2012
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…
math.PR2012
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…
math.PR2012★ 1 cited
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…