On the computability of graphons

01/31/2018
by   Nathanael L. Ackerman, et al.
0

We investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of an invariant measure on graphs, or as a graphon in either L^1 or the cut distance. We establish basic computable equivalences, and show that L^1 representations contain fundamentally more computable information than the other representations, but that 0' suffices to move between computable such representations. We show that 0' is necessary in general, but that in the case of random-free graphons, no oracle is necessary. We also provide an example of an L^1-computable random-free graphon that is not weakly isomorphic to any graphon with an a.e. continuous version.

READ FULL TEXT
research
04/30/2019

On the incomputability of computable dimension

Using an iterative tree construction we show that for simple computable ...
research
06/16/2019

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

We consider randomized computation of continuous data in the sense of Co...
research
12/06/2009

Computable de Finetti measures

We prove a computable version of de Finetti's theorem on exchangeable se...
research
04/08/2019

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

We consider numerical functions weakly computable by grammar-controlled ...
research
11/06/2017

The Fréchet distance of surfaces is computable

We show that the Fréchet distance of two-dimensional parametrised surfac...
research
04/13/1999

A Computer Scientist's View of Life, the Universe, and Everything

Is the universe computable? If so, it may be much cheaper in terms of in...
research
06/28/2019

Computing Haar Measures

According to Haar's Theorem, every compact group G admits a unique left-...

Please sign up or login with your details

Forgot password? Click here to reset