84 citations · 131 across the 9 of their papers we have counts for
10 papers
Construction of Directed 2K Graphs
Bálint Tillman, Athina Markopoulou, Carter T. Butts +1
We study the problem of constructing synthetic graphs that resemble real-world directed graphs in terms of their degree correlations. We define the problem of directed 2K construct…
AntMonitor: A System for On-Device Mobile Network Monitoring and its Applications
Anastasia Shuba, Anh Le, Emmanouil Alimpertis +2
In this paper, we present a complete system for on-device passive monitoring, collection, and analysis of fine grained, large-scale packet measurements from mobile devices. First,…
Estimating Subgraph Frequencies with or without Attributes from Egocentrically Sampled Data
Minas Gjoka, Emily Smith, Carter T. Butts
In this paper we show how to efficiently produce unbiased estimates of subgraph frequencies from a probability sample of egocentric networks (i.e., focal nodes, their neighbors, an…
Estimating Clique Composition and Size Distributions from Sampled Network Data
Minas Gjoka, Emily Smith, Carter T. Butts
Cliques are defined as complete graphs or subgraphs; they are the strongest form of cohesive subgroup, and are of interest in both social science and engineering contexts. In this…
2.5K-Graphs: from Sampling to Generation
Minas Gjoka, Maciej Kurant, Athina Markopoulou
Understanding network structure and having access to realistic graphs plays a central role in computer and social networks research. In this paper, we propose a complete, and pract…
Coarse-Grained Topology Estimation via Graph Sampling
Maciej Kurant, Minas Gjoka, Yan Wang +3
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this ar…