Do Duy Hieu

TS. NCV Department of Probability and Mathematical Statistics Research interests:

Address
Office: Phòng Đào tạo, Nhà A6
Tel:
Email: ddhieu AT math.ac.vn

List of recent publications

1	Do Duy Hieu, Phan Thi Ha Duong, Overlapping community detection algorithms using modularity and the cosine, Advances in Complex Systems Vol. 28, No. 03, 2550006 (2025) Regular Research Articles, (SCI-E, Scopus).
2	Dang Tien Dat, Do Duy Hieu, Phan Thi Ha Duong, Community detection in directed graphs using stationary distribution and hitting times methods, Social Network Analysis and Mining volume 13, Article number: 80 (2023).
3	Do Duy Hieu, On two-variable expanders over finite rings, European Journal of Mathematics volume 9, Article number: 10 (2023).
4	Do Duy Hieu, Phan Thi Ha Duong, Detecting communities in large networks using the extended Walktrap algorithm, 2022 RIVF International Conference on Computing and Communication Technologies (RIVF), pp. 100-105, doi: 10.1109/RIVF55975.2022.10013880.
5	Le Xuan Hung, Do Duy Hieu, Ngô Đăc Tân, Vertex-disjoint cycles of different lengths in multipartite tournaments, Discrete Mathematics, 345, Issue 6 (2022), Article 112819, (SCI-E, Scopus).
6	Do Duy Hieu, Pham Van Thang, Distinct distances on regular varieties over finite fields, Journal of Number Theory, 173 (2017), 602–613, (SCI-E, Scopus).
7	Lê Anh Vinh, Do Duy Hieu, On volume set of boxes in finite spaces, Indiana University Mathematics Journal, 65 (2016), 2125–2136.
8	Ngoc Dai Nguyen, Minh Hai Nguyen, Do Duy Hieu, Anh Vinh Le, Integral Cayley graphs generated by distance sets in vector spaces over finite fields. Electronics Journal of Combinatoric, 20(1) (2013), #P29. (SCI-E).
9	Do Duy Hieu, Lê Anh Vinh, On distance sets and product sets in vector spaces over finite rings. Michigan Mathematical Journal, 62 (2013). 779– 792.

Preprints

1	IMH20241205, Do Duy Hieu, Bui Quoc, Nguyen Hai Tuan, Community Detection in Directed Graphs via Hitting Times and K-Means Clustering
2	IMH20240401, Do Duy Hieu, Phan Thi Ha Duong, An improvement on the Louvain algorithm using random walks.