A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Proceedings of International Conference on Mathematics and Computer Science
A scan statistic methodology for detecting anomalies has been developed for application to graphs. We equate anomalies with vertices that exhibit high local connectivity properties. In particular we look for cases where all vertices have similar local connectivity, except for one vertex (a champion) that has much higher connectivity at a certain level. For example, a neighborhood champion is a vertex whose closed neighborhood is larger than those of other vertices; a scale k champion is afatcat:xy2ma4xhkzbl3obtgxgob5ikau