Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets
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-behaved equational theory for our graph probabilistic programming language corresponds to a graphon, and conversely, every...
| Autors principals: | , , , , , , , |
|---|---|
| Format: | Journal article |
| Idioma: | English |
| Publicat: |
Association for Computing Machinery
2024
|