Configuring random graph models with fixed degree sequences

BK Fosdick, DB Larremore, J Nishimura, J Ugander - Siam Review, 2018 - SIAM
Random graph null models have found widespread application in diverse research
communities analyzing network datasets, including social, information, and economic …

Construction of and efficient sampling from the simplicial configuration model

JG Young, G Petri, F Vaccarino, A Patania - Physical Review E, 2017 - APS
Simplicial complexes are now a popular alternative to networks when it comes to describing
the structure of complex systems, primarily because they encode multinode interactions …

Measuring and modeling bipartite graphs with community structure

SG Aksoy, TG Kolda, A Pinar - Journal of Complex Networks, 2017 - academic.oup.com
Network science is a powerful tool for analyzing complex systems in fields ranging from
sociology to engineering to biology. This article is focused on generative models of large …

Annotated hypergraphs: models and applications

P Chodrow, A Mellor - Applied network science, 2020 - Springer
Hypergraphs offer a natural modeling language for studying polyadic interactions between
sets of entities. Many polyadic interactions are asymmetric, with nodes playing distinctive …

The switch Markov chain for sampling irregular graphs

C Greenhill - Proceedings of the twenty-sixth annual acm-siam …, 2014 - SIAM
The problem of efficiently sampling from a set of (undirected) graphs with a given degree
sequence has many applications. One approach to this problem uses a simple Markov …

Sampling hypergraphs with given degrees

M Dyer, C Greenhill, P Kleer, J Ross, L Stougie - Discrete Mathematics, 2021 - Elsevier
There is a well-known connection between hypergraphs and bipartite graphs, obtained by
treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite …

[HTML][HTML] The switch Markov chain for sampling irregular graphs and digraphs

C Greenhill, M Sfragara - Theoretical Computer Science, 2018 - Elsevier
The problem of efficiently sampling from a set of (undirected, or directed) graphs with a given
degree sequence has many applications. One approach to this problem uses a simple …

Island biogeography of food webs

F Massol, M Dubart, V Calcagno, K Cazelles… - Advances in ecological …, 2017 - Elsevier
To understand why and how species invade ecosystems, ecologists have made heavy use
of observations of species colonization on islands. The theory of island biogeography …

Exact sampling of graphs with prescribed degree correlations

KE Bassler, CI Del Genio, PL Erdős, I Miklós… - New Journal of …, 2015 - iopscience.iop.org
Many real-world networks exhibit correlations between the node degrees. For instance, in
social networks nodes tend to connect to nodes of similar degree and conversely, in …

[HTML][HTML] The mixing time of switch Markov chains: a unified approach

PL Erdős, C Greenhill, TR Mezei, I Miklós… - European Journal of …, 2022 - Elsevier
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov
chains on the realizations of graphic degree sequences of simple graphs. Several results …