1 citations · 1 across the 5 of their papers we have counts for
5 papers
Assessing the reliability polynomial based on percolation theory
Farkhondeh A. Sajadi
In this paper, we study the robustness of network topologies. We use the concept of percolation as measuring tool to assess the reliability polynomial of those systems which can be…
Asymptotic Normality of the Chromatic Number of a Random Graph
Ali Rejali, Farkhondeh Sajadi
In this paper we prove that the limiting distribution of the Chromatic number of a random graph , with fixed edge-probability , after appropriate centering an…
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…