Tin tức nổi bật
Hội thảo sắp diễn ra
21/07/25, Hội nghị, hội thảo:
International conference on commutative algebra to the memory of Jürgen Herzog
Xuất bản mới
Đoàn Nhật Minh,
Sang-Hyun Kim,
Mong Lung Lang,
Ser Peow Tan,
Optimal Special Polygons for the Congruence Subgroups
Hà Đức Thái,
Hoàng Thế Tuấn,
The oscillatory solutions of multi-order fractional differential equations,
Fractional Calculus and Applied Analysis 28, 1282–1323 (2025)
(SCI-E, Scopus)
.
Võ Quốc Bảo,
Phùng Hồ Hải,
Đào Văn Thịnh,
Cohomology of the differential fundamental group of algebraic curves,
Bulletin des Sciences Mathématiques, Volume 203, August 2025, 103646, https://doi.org/10.1016/j.bulsci.2025.103646
(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.