Many empirical networks are intrinsically polyadic, with interactions occurring within groups
of agents of arbitrary size. There are, however, few flexible null models that can support …

Hypergraphs offer a natural modeling language for studying polyadic interactions between
sets of entities. Many polyadic interactions are asymmetric, with nodes playing distinctive …

The hypergraph community detection problem seeks to identify groups of related vertices in
hypergraph data. We propose an information-theoretic hypergraph community detection …

LFR is a popular benchmark graph generator used to evaluate community detection
algorithms. We present EM-LFR, the first external memory algorithm able to generate …

The mixing time of a random walk, with or without backtracking, on a random graph
generated according to the configuration model on n vertices, is known to be of order log n …

We prove a general normal approximation theorem for local graph statistics in the
configuration model, together with an explicit bound on the error in the approximation with …

We consider statistics on permutations chosen uniformly at random from fixed parabolic
double cosets of the symmetric group. We show that the distribution of fixed points is …

How does the small-scale topological structure of an airline network behave as the network
evolves? To address this question, we study the dynamic properties of small undirected …

We study near‐critical behavior in the configuration model. Let D n be the degree of a
random vertex and; we consider the barely supercritical regime, where ν n→ 1 as n→∞, but …

Random intersection graphs containing an underlying community structure are a popular
choice for modelling real-world networks. Given the group memberships, the classical …