2 code implementations • 24 Jan 2021 • Philip S. Chodrow, Nate Veldt, Austin R. Benson
Many graph algorithms for this task are based on variants of the stochastic blockmodel, a random graph with flexible cluster structure.
1 code implementation • 19 Sep 2019 • Philip S. Chodrow
Many network data sets are neither large, sparse, nor simple, and in these cases the approximation no longer applies.
Social and Information Networks Probability Data Analysis, Statistics and Probability Physics and Society 05C80, 05C82, 91D30, 62-07, 65C05
1 code implementation • 25 Feb 2019 • Philip S. Chodrow
In this work, we develop a class of random null models for polyadic data in the framework of hypergraphs, therefore circumventing the need for projection.
Probability Social and Information Networks Data Analysis, Statistics and Probability Physics and Society Applications