3 citations · 3 across the 1 of their papers we have counts for
1 paper
Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar +5
We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-beh…