3 papers
cs.DS2025
Transitivity Preserving Projection in Directed Hypergraphs
Eric Parsonage, Matthew Roughan, Hung X Nguyen
Directed hypergraphs are vital for modeling complex polyadic relationships in domains such as discrete mathematics, computer science, network security, and systems modeling. Howeve…
cs.DS2015
Fast Generation of Spatially Embedded Random Networks
Eric Parsonage, Matthew Roughan
Spatially Embedded Random Networks such as the Waxman random graph have been used in a variety of settings for synthesizing networks. However, little thought has been put into fast…
math.ST2015
Estimating the Parameters of the Waxman Random Graph
Matthew Roughan, Jonathan Tuke, Eric Parsonage
The Waxman random graph is a generalisation of the simple Erdős-Rényi or Gilbert random graph. It is useful for modelling physical networks where the increased cost of longer links…