7 papers
A Pure Hypothesis Test for Inhomogeneous Random Graph Models Based on a Kernelised Stein Discrepancy
Anum Fatima, Gesine Reinert
Complex data are often represented as a graph, which in turn can often be viewed as a realisation of a random graph, such as an inhomogeneous random graph model (IRG). For general…
Approximating inter-point distances in directed Bernoulli graphs
A. D. Barbour, Gesine Reinert
In directed random graphs, in which edges can be assigned to have one of two directions, or perhaps both, the distance between two vertices and can be computed along paths…
Learning to Fuse Temporal Proximity Networks: A Case Study in Chimpanzee Social Interactions
Yixuan He, Aaron Sandel, David Wipf +3
How can we identify groups of primate individuals which could be conjectured to drive social structure? To address this question, one of us has collected a time series of data for…
Individualised Counterfactual Examples Using Conformal Prediction Intervals
James M. Adams, Gesine Reinert, Lukasz Szpruch +2
Counterfactual explanations for black-box models aim to pr ovide insight into an algorithmic decision to its recipient. For a binary classification problem an individual counterfac…
Triadic structures in multislice networks
Kevin Ren, Tara Trauthwein, Gesine Reinert
Networks provide a popular representation of complex data. Often, different types of relational measurements are taken on the same subjects. Such data can be represented as a \text…
Isolated vertices in two duplication-divergence models with edge deletion
Tiffany Y. Y. Lo, Gesine Reinert, Ruihua Zhang
Duplication-divergence models are a popular model for the evolution of gene and protein interaction networks. However, existing duplication-divergence models often neglect realisti…