Graduate Theses: Recent submissions

Now showing items 211-213 of 36487

    • The Limits of Recovering Planted Subgraphs 

      Rajaraman, Amit (Massachusetts Institute of Technology, 2025-05)
      Given an arbitrary subgraph H = Hₙ and p = pₙ ∈ (0, 1), the planted subgraph model is defined as follows. A statistician observes the union of the “signal,” which is a random “planted” copy H* of H, together with random ...

    • Efficient Routing in the CityMesh Decentralized Fallback Wireless Network 

      Liu, Ziqian (Massachusetts Institute of Technology, 2025-05)
      As modern communication systems increasingly rely on centralized network infrastructure, they become more vulnerable to disruptions caused by disasters, failures, or cyberattacks. To address this risk, CityMesh proposes a ...

    • GPU-accelerated Inference for Discrete Probabilistic Programs 

      Ghavami, Matin (Massachusetts Institute of Technology, 2025-05)
      This thesis presents a comprehensive approach to GPU-accelerated inference for discrete probabilistic programs. We make two key contributions : (1) a factor graph IR implemented in JAX that supports variable elimination ...