no code implementations • 16 Sep 2020 • Leto Peel, Michael T. Schaub
We study the problem of recovering a planted hierarchy of partitions in a network.
1 code implementation • 15 Sep 2020 • Michael T. Schaub, Jiaze Li, Leto Peel
A great deal of effort has gone into trying to detect and study these structures.
1 code implementation • 13 Aug 2019 • Matteo Cinelli, Leto Peel, Antonio Iovanella, Jean-Charles Delvenne
We consider the network constraints on the bounds of the assortativity coefficient, which measures the tendency of nodes with the same attribute values to be interconnected.
Social and Information Networks Data Analysis, Statistics and Probability Physics and Society
1 code implementation • 18 Aug 2018 • Till Hoffmann, Leto Peel, Renaud Lambiotte, Nick S. Jones
We develop a Bayesian hierarchical model to identify communities in networks for which we do not observe the edges directly, but instead observe a series of interdependent signals for each of the nodes.
2 code implementations • 15 Dec 2016 • Leto Peel
Typically this problem is confounded with the problem of graph-based semi-supervised learning (GSSL), because both problems represent the data as a graph and predict the missing class labels of nodes.
no code implementations • 20 Aug 2016 • Leto Peel, Daniel B. Larremore, Aaron Clauset
We illustrate this point by introducing two statistical techniques that can quantify the relationship between metadata and community structure for a broad class of models.
no code implementations • 19 Jun 2015 • Amir Ghasemian, Pan Zhang, Aaron Clauset, Cristopher Moore, Leto Peel
We study the fundamental limits on learning latent community structure in dynamic networks.
no code implementations • 5 Mar 2014 • Leto Peel, Aaron Clauset
Interactions among people or objects are often dynamic in nature and can be represented as a sequence of networks, each providing a snapshot of the interactions over a brief period of time.
no code implementations • 27 Dec 2013 • Leto Peel
In other cases, however, this is not true, and the way that nodes link in a network exhibits a different, more complex relationship to their attributes.