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

14 citations · 18 across the 7 of their papers we have counts for

collaborators

7 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…

cs.LG2025

FairAD: Computationally Efficient Fair Graph Clustering via Algebraic Distance

Minh Phu Vuong, Young-Ju Lee, Iván Ojeda-Ruiz +1

Due to the growing concern about unsavory behaviors of machine learning models toward certain demographic groups, the notion of 'fairness' has recently drawn much attention from th…

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…

cs.SI2019★ 3 cited

Transient Dynamics of Epidemic Spreading and Its Mitigation on Large Networks

Chul-Ho Lee, Srinivas Tenneti, Do Young Eun

In this paper, we aim to understand the transient dynamics of a susceptible-infected (SI) epidemic spreading process on a large network. The SI model has been largely overlooked in…

math.ST2019

Non-Markovian Monte Carlo on Directed Graphs

Chul-Ho Lee, Min Kang, Do Young Eun

Markov Chain Monte Carlo (MCMC) has been the de facto technique for sampling and inference of large graphs such as online social networks. At the heart of MCMC lies the ability to…

cs.NI2013★ 1 cited

Exploiting the Past to Reduce Delay in CSMA Scheduling: A High-order Markov Chain Approach

Jaewook Kwak, Chul-Ho Lee, Do Young Eun

Recently several CSMA algorithms based on the Glauber dynamics model have been proposed for multihop wireless scheduling, as viable solutions to achieve the throughput optimality,…

stat.ME2012★ 14 cited

Beyond Random Walk and Metropolis-Hastings Samplers: Why You Should Not Backtrack for Unbiased Graph Sampling

Chul-Ho Lee, Xin Xu, Do Young Eun

Graph sampling via crawling has been actively considered as a generic and important tool for collecting uniform node samples so as to consistently estimate and uncover various char…