10 citations · 13 across the 10 of their papers we have counts for
4 papers · 1 filter
Core-periphery identification in massive networks
Eric Yanchenko
Modern networks can be huge with millions or even billions of nodes and edges. Thus, algorithms must be capable of scaling to such large networks in order to be practically useful.…
Graph sub-sampling for divide-and-conquer algorithms in large networks
Eric Yanchenko
As networks continue to increase in size, current methods must be capable of handling large numbers of nodes and edges in order to be practically relevant. Instead of working direc…
Quantifying the presence/absence of meso-scale structures in networks
Eric Yanchenko
Meso-scale structures are network features where nodes with similar properties are grouped together instead of being treated individually. In this work, we provide formal and mathe…
A generalized hypothesis test for community structure in networks
Eric Yanchenko, Srijan Sengupta
Researchers theorize that many real-world networks exhibit community structure where within-community edges are more likely than between-community edges. While numerous methods exi…