3 papers
cs.DS2024
The graph alignment problem: fundamental limits and efficient algorithms
Luca Ganassali
This thesis studies the graph alignment problem, the noisy version of the graph isomorphism problem, which aims to find a matching between the nodes of two graphs which preserves m…
cs.LG2023
On sample complexity of conditional independence testing with Von Mises estimator with application to causal discovery
Fateme Jamshidi, Luca Ganassali, Negar Kiyavash
Motivated by conditional independence testing, an essential step in constraint-based causal discovery algorithms, we study the nonparametric Von Mises estimator for the entropy of…
stat.ME2023
Learning Causal Graphs via Monotone Triangular Transport Maps
Sina Akbari, Luca Ganassali, Negar Kiyavash
We study the problem of causal structure learning from data using optimal transport (OT). Specifically, we first provide a constraint-based method which builds upon lower-triangula…