English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study semantic models of probabilistic programming languages over graphs,and establish a connection to graphons from graph theory and combinatorics. Weshow that every well-behaved equational theory for our graph probabilisticprogramming language corresponds to a graphon, and conversely, every graphonarises in this way.  We provide three constructions for showing that every graphon arises from anequational theory. The first is an abstract construction, using Markovcategories and monoidal indeterminates. The second and third are more concrete.The second is in terms of traditional measure theoretic probability, whichcovers 'black-and-white' graphons. The third is in terms of probability monadson the nominal sets of Gabbay and Pitts. Specifically, we use a variation ofnominal sets induced by the theory of graphs, which covers Erd\H{o}s-R\'enyigraphons. In this way, we build new models of graph probabilistic programmingfrom graphons.

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