Network analysis examines the relationships or connections between entities (i.e., actors) and the patterns that emerge from their interactions. A key aspect of network analysis is community detection, which identifies groups of closely connected actors within networks and is widely used in fields ranging from social science to public health. Traditional approaches for detecting communities using latent space models are often slow and can be distorted by spurious or noisy connections. This dissertation introduces new methods to address these challenges, including a fast algorithm for fitting latent space models and an extension called the Latent Space Hurdle Model, which improves accuracy by accounting for noisy connections. Simulation studies show that these methods are both faster and more accurate than existing approaches. Finally, using an agent-based model, we demonstrate the utility of community detection to guide quarantining strategies during disease outbreaks, showing that targeting densely connected clusters can effectively reduce disease transmission.