Root and community inference on the latent growth process of a network using noisy attachment models

by   Harry Crane, et al.

We introduce the PAPER (Preferential Attachment Plus Erdős–Rényi) model for random networks, where we let a random network G be the union of a preferential attachment (PA) tree T and additional Erdős–Rényi (ER) random edges. The PA tree component captures the fact that real world networks often have an underlying growth/recruitment process where vertices and edges are added sequentially, while the ER component can be regarded as random noise. Given only a single snapshot of the final network G, we study the problem of constructing confidence sets for the early history, in particular the root node, of the unobserved growth process; the root node can be patient zero in a disease infection network or the source of fake news in a social media network. We propose an inference algorithm based on Gibbs sampling that scales to networks with millions of nodes and provide theoretical analysis showing that the expected size of the confidence set is small so long as the noise level of the ER edges is not too large. We also propose variations of the model in which multiple growth processes occur simultaneously, reflecting the growth of multiple communities, and we use these models to provide a new approach community detection.


Inference on the History of a Randomly Growing Tree

The spread of infectious disease in a human community or the proliferati...

Archaeology of random recursive dags and Cooper-Frieze random networks

We study the problem of finding the root vertex in large growing network...

Confidence Sets for the Source of a Diffusion in Regular Trees

We study the problem of identifying the source of a diffusion spreading ...

CIMTDetect: A Community Infused Matrix-Tensor Coupled Factorization Based Method for Fake News Detection

Detecting whether a news article is fake or genuine is a crucial task in...

Growth of Random Trees by Leaf Attachment

We study the growth of a time-ordered rooted tree by probabilistic attac...

Degree-preserving graph dynamics – a versatile process to construct random networks

Real-world networks evolve over time via additions or removals of nodes ...

Spectral partitioning of time-varying networks with unobserved edges

We discuss a variant of `blind' community detection, in which we aim to ...