My research interests span network science, optimization, learning and privacy. My ongoing research at CMU focuses on developing mathematical frameworks for i) modeling spreading phenomena in real-world networks; and ii) designing resilient ad-hoc networks.
My Masters Thesis at IIT Bombay entailed optimization and game theoretic analysis of two-sided marketplaces.
M. Sood, O. Yagan, On the Minimum Node Degree and k-connectivity in Inhomogeneous Random K-out Graphs, IEEE Transactions on Information Theory 2021.
M. Sood, A. Sridhar, R. Eletreby, C. Wu, H.V. Poor, O. Yagan , ‘Epidemic Spreading of Mutating Contagions over Multi-layer Contact Networks’, International Conference on Network Science (Netsci) 2021.
E. Elumar, M. Sood, O. Yagan, ‘On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes’, IEEE International Symposium on Information Theory 2021 .
M. Sood, O. Yagan, Tight Bounds for the Probability of Connectivity in Random K-out Graphs, IEEE International Conference on Communications (ICC) 2021. (recipient of the best paper award)
M. Sood, O. Yagan, On the Size of the Giant Component in Inhomogeneous Random K-out Graphs, IEEE Conference of Decision and Control (CDC) 2020.
M. Sood, O. Yagan, k-Connectivity in Random Graphs induced by Pairwise Key Predistribution Schemes, IEEE International Symposium on Information Theory (ISIT) 2020.
M. Sood, O. Yagan, Towards k-connectivity in Heterogeneous Sensor Networks under Pairwise Key Predistribution, IEEE Global Communications Conference (GLOBECOM) 2019.
M. Sood, S. Moharir & A. A. Kulkarni, Pricing and Commission in Two-Sided Markets with Free Upgrades, Springer’s Lecture Notes in Computer Science (LNCS) 2018, preliminary version appeared in IEEE International Conference on Communication Systems and Networks 2018.
M. Sood, A. A. Kulkarni & S. Moharir, Platform Competition for Throughput in Two-sided Freelance Markets, IEEE International Conference on Signal Processing and Communications 2018.
M. Sood, O. Yagan, Existence and Size of the Giant Component in Inhomogeneous Random K-out Graphs.
E. Elumar, M. Sood, O. Yagan, ‘On the Robustness, Connectivity and Giant Component Size of Random K-out Graphs’.
M. Sood, A. A. Kulkarni & S. Moharir, Platform Competition for Throughput & Revenue in Two-sided Freelance Markets.