Ancillary files for the article "The K-distribution of random graph C*-algebras" by B. Jacelon and I. Khavkine ... These can be executed for example with the following options: python3 dnq.py 100 1/2 ...

We show an example of such a random graph in Fig. 2. This example is one of the simplest models of a network there is, and is certainly the best studied; the random graph has become a cornerstone of ...

Existing random graph models introduce unwanted features such as multiple edges and directed cycles when randomizing directed acyclic networks. This paper proposes a new random graph model for ...

🎉 Accepted to ICML 2023 🎉. We present a one-shot method for compressing large labeled graphs called Random Edge Coding. When paired with a parameter-free model based on Pólya’s Urn, the worst-case ...

Analysis of large networks is of interest to many disciplines. Full network data are often hard to collect, storage and analyze. In particular, in many social science surveys, ego nomination ...

Given two graphs which are almost isomorphic, is it possible to find a bijection which preserves most of the edges between the two? This is the algorithmic task of Robust Graph Isomorphism, which is a ...