Design Analysis of Algorithm with Hash Analysis for Anomaly Detection

Abstract

This article describes a method for hashing focused graphs architecturally. The technique is designed to adhere to the recursive notion that a node's hash should be determined only by its neighbors' hashes. The method operates in cycles, prohibiting a naïve recursive procedure from operating. Additionally, we explore the recursive value's consequences, the procedure's limits, and prospective anomaly detection use cases.