Complex network classification using partially self-avoiding deterministic walks

doi:10.1063/1.4737515

Complex network classification using partially self-avoiding deterministic walks

2012-09-04

0

OA

AI

DOI：10.1063/1.4737515

原文链接

查看原文

摘要

En 中文

Complex networks have attracted increasing interest from various fields of science. It has been demonstrated that each complex network model presents specific topological structures which characterize its connectivity and dynamics. Complex network classification relies on the use of representative measurements that describe topological structures. Although there are a large number of measurements, most of them are correlated. To overcome this limitation, this paper presents a new measurement for complex network classification based on partially self-avoiding walks. We validate the measurement on a data set composed by 40000 complex networks of four well-known models. Our results indicate that the proposed measurement improves correct classification of networks compared to the traditional ones.

Complex network classification using partially self-avoiding deterministic walks

摘要

AI总结

期刊

机构

引用论文