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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages 2024-01, Vol.8 (POPL), p.1819-1849, Article 61
Hauptverfasser:	Ackerman, Nate, Freer, Cameron E., Kaddar, Younesse, Karwowski, Jacek, Moss, Sean, Roy, Daniel, Staton, Sam, Yang, Hongseok
Format:	Artikel
Sprache:	eng
Schlagworte:	Probabilistic computation Semantics and reasoning Theory of computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!