3 papers
cs.LG2026
Distance-Preserving Embeddings in Inhomogeneous Random Graphs
My Le, Luana Ruiz, Souvik Dhara
Graph machine learning provides powerful tools for understanding complex networks and learning meaningful node representations. A central challenge, however, is designing embedding…
math.PR2026
Giants through higher-order paths in random simplicial complexes
Souvik Dhara, Taegyu Kang
We investigate the giant component formed via high-dimensional paths in the multi-parameter random simplicial complex (MRSC) model. For a -dimensional simplicial complex, we def…
stat.ML2025
Landmark-Based Node Representations for Shortest Path Distance Approximations in Random Graphs
My Le, Luana Ruiz, Souvik Dhara
Learning node representations is a fundamental problem in graph machine learning. While existing embedding methods effectively preserve local similarity measures, they often fail t…