activity
20082025
most citedCommunicability Betweenness in Complex Networks

136 citations · 423 across the 42 of their papers we have counts for

collaborators

49 papers

physics.soc-ph2025

Generalized Friendship Paradoxes in Network Science

Desmond J. Higham, Francesco Hrobat, Francesco Tudisco

Generalized friendship paradoxes occur when, on average, our friends have more of some attribute than us. These paradoxes are relevant to many aspects of human interaction, notably…

cs.SI2025

Optimization of geometric hypergraph embedding

Francesco Zigliotto, Desmond J. Higham

We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres.…

cs.LG2025

Embedding Hidden Adversarial Capabilities in Pre-Trained Diffusion Models

Lucas Beerens, Desmond J. Higham

We introduce a new attack paradigm that embeds hidden adversarial capabilities directly into diffusion models via fine-tuning, without altering their observable behavior or requiri…

cs.LG2025

Are We Measuring Oversmoothing in Graph Neural Networks Correctly?

Kaicheng Zhang, Piero Deidda, Desmond Higham +1

Oversmoothing is a fundamental challenge in graph neural networks (GNNs): as the number of layers increases, node embeddings become increasingly similar, and model performance drop…

cs.LG2024

Deceptive Diffusion: Generating Synthetic Adversarial Examples

Lucas Beerens, Catherine F. Higham, Desmond J. Higham

We introduce the concept of deceptive diffusion -- training a generative AI model to produce adversarial images. Whereas a traditional adversarial attack algorithm aims to perturb…

cs.AI2024★ 1 cited

Stealth edits to large language models

Oliver J. Sutton, Qinghua Zhou, Wei Wang +4

We reveal the theoretical foundations of techniques for editing large language models, and present new methods which can do so without requiring retraining. Our theoretical insight…