3 papers
cs.LO2026
A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability
Radu Curticapean, Daniel Neuen, Amir Nikabadi +2
Two graphs and are homomorphism indistinguishable over a graph class if they admit the same number of homomorphisms from every graph in . A wide…
stat.ME2026
Unbiased Approximations for Stationary Distributions of McKean-Vlasov SDEs
Elsiddig Awadelkarim, Neil K. Chada, Ajay Jasra
We consider the development of unbiased estimators, to approximate the stationary distribution of Mckean-Vlasov stochastic differential equations (MVSDEs). These are an important c…
math.PR2026
New Trends in the Stability of Sinkhorn Semigroups
Pierre Del Moral, Ajay Jasra
Entropic optimal transport problems play an increasingly important role in machine learning and generative modelling. In contrast with optimal transport maps which often have limit…