10 citations · 13 across the 10 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.SI2026
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.…
stat.ME2026
Universal Inference for model selection on networks
Eric Yanchenko, Jonathan P. Williams, Ryan Martin
Model selection and hypothesis testing are important tasks on networks. A key challenge lies in the inherent dependence in network data, as well as the fact that typically only a s…