Amites Sarkar's homepage
Research papers
-
Extremal graphs for weights,
Discrete Mathematics 200 (1999), 5-19
(with Béla Bollobás and Paul Erdős)
-
Paths in graphs,
Studia Scientiarum Mathematicarum Hungarica 38 (2001), 115-137
(with Béla Bollobás)
-
Paths of length four,
Discrete Mathematics 265 (2003), 357-363
(with Béla Bollobás)
-
Connectivity of random k-nearest-neighbour graphs,
Advances in Applied Probability 37 (2005), 1-24
(with Paul Balister, Béla Bollobás and Mark Walters)
-
Reliable density estimates for achieving coverage and connectivity in thin strips of finite length,
ACM MobiCom (2007), 75-86
(with Paul Balister, Béla Bollobás and Santosh Kumar)
-
Connectivity of a gaussian network,
Int. J. Ad Hoc and Ubiquitous Computing 3 (2008), 204-213
(with Paul Balister, Béla Bollobás and Mark Walters)
-
Highly connected random geometric graphs,
Discrete Applied Mathematics 157 (2009), 309-320
(with Paul Balister, Béla Bollobás and Mark Walters)
-
A critical constant for the k-nearest-neighbour model,
Advances in Applied Probability 41 (2009), 1-12
(with Paul Balister, Béla Bollobás and Mark Walters)
-
Percolation, connectivity, coverage and colouring of random geometric graphs,
in Handbook of Large-Scale Random Networks, Springer (2009)
(with Paul Balister and Béla Bollobás)
-
The Linus sequence,
Combinatorics, Probability and Computing 19 (2010), 21-46
(with Paul Balister and Steve Kalikow)
-
Sentry selection in wireless networks,
Advances in Applied Probability 42 (2010), 1-25
(with Paul Balister, Béla Bollobás and Mark Walters)
-
The simple random walk on a random Voronoi tiling,
manuscript
(with Louigi Addario-Berry)
-
Secrecy coverage,
Internet Mathematics 9 (2013), 199-216
(with Martin Haenggi)
conference version,
44th Asilomar Conference on Signals, Systems, and Computers (2010)
(with Martin Haenggi)
-
Percolation in the secrecy graph,
Discrete Applied Mathematics 161 (2013), 2120-2132
(with Martin Haenggi)
conference version,
Information Theory and Applications Workshop, San Diego (2011)
(with Martin Haenggi)
related conference paper,
Information Theory Workshop, Paraty, Brazil (2011)
(with Martin Haenggi)
-
Secrecy coverage in two dimensions,
Advances in Applied Probability 48 (2016), 1-12
conference version,
Information Theory and Applications Workshop, San Diego (2014)
-
Barrier coverage,
Random Structures and Algorithms 49 (2016), 429-478
(with Paul Balister and Béla Bollobás)
-
Sentry selection in sensor networks: theory and algorithms,
Int. J. Sensor Networks 24 (2017), 139-148
(with Paul Balister, Béla Bollobás, Martin Haenggi and Mark Walters)
-
Rainbow Turán problems for paths and forests of stars,
Electronic Journal of Combinatorics 24 (2017), Paper 1.34
(with Dan Johnston and Cory Palmer)
-
Unique coverage in Boolean models,
Statistics and Probability Letters 123 (2017), 1-7
(with Martin Haenggi)
-
Continuum percolation with holes,
Statistics and Probability Letters 126 (2017), 212-218
(with Martin Haenggi)
-
Highly connected subgraphs of graphs with given independence number,
European Journal of Combinatorics 70 (2018), 212-231
(with Shinya Fujita and Henry Liu)
conference version,
Electronic Notes in Discrete Mathematics 54 (2016), 103-108
(with Shinya Fujita and Henry Liu)
-
On a conjecture of Nagy on extremal densities,
SIAM Journal on Discrete Mathematics 35 (2021), 294-306
(with Nick Day)
-
Intersections of random sets,
Journal of Applied Probability 59 (2022), 131-151
(with Jacob Richey)
-
Bootstrap percolation in random geometric graphs,
Advances in Applied Probability 55 (2023), 1254-1300
(with Victor Falgas-Ravry)
-
Sums of two squares visualized,
American Mathematical Monthly 131 (2024), 558-565
(with Ishan Banerjee)
-
Sums, differences and dilates, submitted
(with Jon Cutler and Luke Pebody)
-
Gelation in vector multiplicative coalescence and extinction
in multi-type Poisson branching processes, submitted
(with Heshan Aravinda, Yevgeniy Kovchegov and Peter Otto)
Book review
The Polyhedrists: Art and Geometry in the Long Sixteenth Century,
Math Horizons 30 (2022), 28