On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs

08/04/2020
by   Lloyd Allison, et al.
0

This report concerns the information content of a graph, optionally conditional on one or more background, "common knowledge" graphs. It describes an algorithm to estimate this information content, and includes some examples based on chemical compounds.

READ FULL TEXT
research
10/25/2021

PREC: semantic translation of property graphs

Converting property graphs to RDF graphs allows to enhance the interoper...
research
07/05/2021

Demonstration of Faceted Search on Scholarly Knowledge Graphs

Scientists always look for the most accurate and relevant answer to thei...
research
09/17/2017

Kolmogorov Complexity and Information Content

In this paper, we revisit a central concept in Kolmogorov complexity in ...
research
09/12/2022

Bending the Future: Autoregressive Modeling of Temporal Knowledge Graphs in Curvature-Variable Hyperbolic Spaces

Recently there is an increasing scholarly interest in time-varying knowl...
research
07/01/2019

Information Kernels

Given a set X of finite strings, one interesting question to ask is whet...
research
01/08/2021

Maximizing Information Gain for the Characterization of Biomolecular Circuits

Quantitatively predictive models of biomolecular circuits are important ...
research
07/15/2019

A Neural Turing Machine for Conditional Transition Graph Modeling

Graphs are an essential part of many machine learning problems such as a...

Please sign up or login with your details

Forgot password? Click here to reset