Showing cs.SIShow all
2 papers · 1 filter
cs.SI2024
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…
cs.SI2022
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…