Tin tức nổi bật
Hội thảo sắp diễn ra
27/09/25, Hội nghị, hội thảo:
Gặp gỡ Toán học 2025 - Hội thảo Khoa học các nhà nghiên cứu trẻ"
06/11/25, Hội nghị, hội thảo:
Lectures on selected areas in Pure Mathematics
24/11/25, Hội nghị, hội thảo:
Hội nghị toàn quốc lần thứ VII “Xác suất - Thống kê: Nghiên cứu, ứng dụng và giảng dạy”
Xuất bản mới
Nguyễn Hữu Sáu,
Piyapong Niamsup,
Vũ Ngọc Phát,
Linear Programming Approach to Constrained Stabilization of Positive Differential-Difference Equations With Unbounded Delay,
Optimal Control Applications and Methods, 2025; 46:2581--2594
(SCI-E, Scopus)
.
Đỗ Hoàng Sơn,
Vũ Đức Việt,
Quantitative stability for the complex Monge-Ampère equations II,
Calculus of Variations and Partial Differential Equations 64 (2025), no. 8, Paper No. 269
(SCI-E, Scopus)
.
Giang Trung Hiếu,
Existence and uniqueness results for a nonlinear Budiansky-Sanders shell model,
Journal of Engineering Mathematics, Volume 151, article number 5, (2025)
(SCI-E, Scopus)
.
Extending the Walktrap Algorithm to Directed Graphs via Hitting Time and Stationary Distribution
Người báo cáo: Đỗ Duy Hiếu
Speaker: Đỗ Duy Hiếu, Viện Toán học
Thời gian: 14h Thứ 5, ngày 22/05/2025
Địa điểm: Phòng 507 nhà A6
Link online Zoom: https://zoom.us/j/96058506399?pwd=ZwJHlZg0qb5ijT8Mj5GttENSYED0Kh.1
Meeting ID: 891 3406 2450Passcode: 123456
Abstract: Community detection has been extensively studied through a wide range of algorithms. One of the most influential methods for undirected graphs is the Walktrap algorithm, which estimates distances between vertices via random walks and evaluates communities based on modularity derived from vertex degrees. While several attempts have been made to adapt this method to directed graphs, they have achieved limited success.
In this talk, I will revisit the Walktrap algorithm (Pons and Latapy, J. Graph Algorithms Appl., 10:191–218, 2006) and present an extension that is suitable for directed graphs. The key idea is to redefine the distance between vertices using the hitting time and the stationary distribution of a random walk. These definitions are both theoretically grounded and computationally efficient, as they rely on well-established algorithms. Notably, this framework also recovers the undirected case as a special instance. Finally, I will present an implementation of the proposed algorithm and discuss its practicality and effectiveness through experiments.
This work is based on joint research with Phan Thị Hà Dương and Đặng Tiến Đạt.