Year-end Sale % OFF 
Abstract
This research concerns the analysis of social networks using graph theory to find properties that can be used to determine Sybil nodes. This research also investigated the mixing time, which is one of the properties that many existing methods use for detecting Sybil attacks. The results showed that the mixing time does not reflect the difference between honest graphs and Sybil graphs. In addition, the properties of social graphs were studied and it was found that the average node distance is different in graphs containing Sybil nodes than in graphs with only honest nodes. Furthermore, the eigenvector centrality and the degree of Sybil nodes are correlated, while in honest nodes they are not.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
