173 citations
- S. Ghosh17 · h 34
- P. Roy2 profiles10 · h 24
- D. Goswami7 · h 19
- C. Raja3 profiles6 · h 6
- Sisir Roy6 · h 16
- B. Basu2 profiles5 · h 12
- Samir Kunkri2 profiles5 · h 10
- Antar Bandyopadhyay2 profiles4 · h 9
- A. Roy2 profiles4 · h 10
- A. Sinha2 profiles4 · h 13
- Rudra P. Sarkar2 profiles4 · h 13
- S. Bhattacharyya2 profiles4 · h 8
- Indian Institute of Science BangaloreIN9 papers
- S.N. Bose National Centre for Basic SciencesIN7 papers
- Saha Institute of Nuclear PhysicsIN6 papers
- The Abdus Salam International Centre for Theoretical Physics (ICTP)IT4 papers
- Inter-University Centre for Astronomy and AstrophysicsIN3 papers
- Tata Institute of Fundamental ResearchIN3 papers
- Texas A&M UniversityUS3 papers
- University of BonnDE3 papers
- University of CalcuttaIN3 papers
- University of WaterlooCA3 papers
- Bankura Sammilani Medical CollegeIN2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
4 papers · 2 filters
Nonuniform random geometric graphs with location-dependent radii
Srikanth K. Iyer, Debleena Thacker
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function , w…
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…
Systems of branching, annihilating, and coalescing particles
Siva Athreya, Jan Swart
This paper studies systems of particles following independent random walks and subject to annihilation, binary branching, coalescence, and deaths. In the case without annihilation,…
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…