Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets

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…