3 papers
math.PR2026
Limit laws for longest edges in empty region graphs
Holger Sambale, Matthias Schulte, Christoph Thaele
Empty region graphs are graphs whose vertices are points in and where two vertices are connected by an edge whenever some associated region does not contain any othe…
math.CO2024
Randomized algorithms to generate hypergraphs with given degree sequences
Michela Ascolese, Matthias Lienau, Matthias Schulte +1
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by…
math.PR2023
Large components in the subcritical Norros-Reittu model
Matthias Lienau, Matthias Schulte
The Norros-Reittu model is a random graph with vertices and i.i.d. weights assigned to them. The number of edges between any two vertices follows an independent Poisson distrib…