Stochastic Models of Higher-Order Networks:Point Processes and Topological Data Analysis
Bibliographic record
Abstract
Higher-order networks, which model interactions among groups of entities of an arbitrary number, emerged as a generalization of simple networks with pairwise interactions. Their analysis requires the development of stochastic models that can capture complex spatial, topological, and temporal dependencies. This thesis presents new probabilistic frameworks for modeling such networks grounded in point process theory. The first contribution establishes a Poisson approximation result for the number of degree-k nodes in weighted random connection models. Nodes are embedded in Rd via a weighted Poisson point process, and edges are formed based on both spatial proximity and node weights. We identify scaling regimes under which the spatial distribution of degree-k nodes converges in Kantorovich–Rubinstein distance to a homogeneous Poisson point process. In the second part, we analyze the age-dependent random connection model, a spatial network model viewed as a higher-order network. Limit theorems are shown for higher-order degree distributions, Betti numbers, and edge counts. Then, the model is fitted to a real-world collaboration network, and hypothesis tests are conducted to assess how well the model captures the topological features of the network. Next, the framework is extended to hypergraphs. Both network nodes and hyperedges are modeled as weighted Poisson point processes, and hyperedges are formed based on joint connections to points representing the hyperedges. In this model, we prove normal and stable limit theorems for simplex counts, Betti numbers, and edge statistics. We also present a simulation study and an application to a collaboration network extracted from the arXiv dataset, comparing the model with real-world hypergraphs. Finally, a dynamic version of the hypergraph model is proposed, where we equip the vertices with birth-death dynamics. We establish two functional limit theorems for the edge-count process in the model: for light-tailed degree distributions, it converges to a Gaussian process with Matérn-type covariance. In heavy-tailed regimes, the edge count process converges to a non-Markovian, non-Lévy stable process. These results constitute the first dynamic limit theorems for spatial higher-order networks.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.024 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.004 | 0.008 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".