activity
20122025
most citedBeyond Random Walk and Metropolis-Hastings Samplers: Why You Should Not Backtrack for Unbiased Graph Sampling

14 citations · 49 across the 19 of their papers we have counts for

collaborators

19 papers

cs.NI2025

Effective Delayed Patching for Transient Malware Control on Networks

Minh Phu Vuong, Chul-Ho Lee, Do Young Eun

Patching nodes is an effective network defense strategy for malware control at early stages, and its performance is primarily dependent on how accurately the infection propagation…

eess.SY2024

Keeping Up With the Winner! Targeted Advertisement to Communities in Social Networks

Shailaja Mallick, Vishwaraj Doshi, Do Young Eun

When a new product enters a market already dominated by an existing product, will it survive along with this dominant product? Most of the existing works have shown the coexistence…

stat.ML2024

Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications

Jie Hu, Vishwaraj Doshi, Do Young Eun

Two-timescale stochastic approximation (TTSA) is among the most general frameworks for iterative stochastic algorithms. This includes well-known stochastic optimization methods suc…

math.PR2024★ 1 cited

Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks

Jie Hu, Vishwaraj Doshi, Do Young Eun

We study a family of distributed stochastic optimization algorithms where gradients are sampled by a token traversing a network of agents in random-walk fashion. Typically, these r…

cs.SI2023

Controlling Epidemic Spread Under Immunization Delay Constraints

Shiju Li, Xin Huang, Chul-Ho Lee +1

In this paper, we study the problem of minimizing the spread of a viral epidemic when immunization takes a non-negligible amount of time to take into effect. Specifically, our prob…

math.PR2023

Self-Repellent Random Walks on General Graphs -- Achieving Minimal Sampling Variance via Nonlinear Markov Chains

Vishwaraj Doshi, Jie Hu, Do Young Eun

We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topolo…