2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.AI2026
Discrete Diffusion for Large Graph Generation via Structural Candidate Restriction
Yassin Mohamadi, Zeno Geradts, Marcel Worring
Synthesizing realistic graphs at scale is vital when the graphs of interest are large and real-world samples are limited or access-sensitive. Diffusion-based generators have recent…
cs.SI2024★ 2 cited
Strong Transitivity Relations and Graph Neural Networks
Yassin Mohamadi, Mostafa Haghir Chehreghani
Local neighborhoods play a crucial role in embedding generation in graph-based learning. It is commonly believed that nodes ought to have embeddings that resemble those of their ne…