activity
20192024
most citedLikelihood-based approach to discriminate mixtures of network models that vary in time

7 citations · 10 across the 6 of their papers we have counts for

collaborators

6 papers

cs.SI2024

Insights and caveats from mining local and global temporal motifs in cryptocurrency transaction networks

Naomi A. Arnold, Peijie Zhong, Cheick Tidiane Ba +5

Distributed ledger technologies have opened up a wealth of fine-grained transaction data from cryptocurrencies like Bitcoin and Ethereum. This allows research into problems like an…

cs.SI2023★ 1 cited

Raphtory: The temporal graph engine for Rust and Python

Ben Steer, Naomi Arnold, Cheick Tidiane Ba +15

Raphtory is a platform for building and analysing temporal networks. The library includes methods for creating networks from a variety of data sources; algorithms to explore their…

cs.SI2023★ 2 cited

Non-Markovian paths and cycles in NFT trades

Haaroon Yousaf, Naomi A. Arnold, Renaud Lambiotte +5

Recent years have witnessed the availability of richer and richer datasets in a variety of domains, where signals often have a multi-modal nature, blending temporal, relational and…

cs.SI2022

Using a Bayesian approach to reconstruct graph statistics after edge sampling

Naomi A. Arnold, Raul J. Mondragon, Richard G. Clegg

Often, due to prohibitively large size or to limits to data collecting APIs, it is not possible to work with a complete network dataset and sampling is required. A type of sampling…

cs.SI2020

Moving with the Times: Investigating the Alt-Right Network Gab with Temporal Interaction Graphs

Naomi A. Arnold, Benjamin A. Steer, Imane Hafnaoui +4

Gab is an online social network often associated with the alt-right political movement and users barred from other networks. It presents an interesting opportunity for research bec…

cs.SI2019★ 7 cited

Likelihood-based approach to discriminate mixtures of network models that vary in time

Naomi A. Arnold, Raul J. Mondragon, Richard G. Clegg

Discriminating between competing explanatory models as to which is more likely responsible for the growth of a network is a problem of fundamental importance for network science. T…