2 papers
cs.LO2025
Are Large Random Graphs Always Safe to Hide?
Sourav Chakraborty, Sujata Ghosh, Smiha Samanta
We discuss winning possibilities of players in various variants of cops and robber game played on large random graphs, a testbed for various kinds of network queries, search proble…
stat.CO2025
Assessing the Quality of Binomial Samplers: A Statistical Distance Framework
Uddalok Sarkar, Sourav Chakraborty, Kuldeep S. Meel
Randomized algorithms depend on accurate sampling from probability distributions, as their correctness and performance hinge on the quality of the generated samples. However, even…