Complex network classification using partially self-avoiding deterministic walks

DOI10.1063/1.4737515MaRDI QIDQ2944603zbMATH OpenOpenAlexWikidataFDO

Authors Wesley Nunes Gonçalves, Alexandre Souto Martinez, Odemir Martinez Bruno

Publication date 2 September 2015

Published in Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1112.5625

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81)

Abstract: 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 rely on the use of representative measurements that model 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 40.000 complex networks of four well-known models. Our results indicate that the proposed measurement improves correct classification of networks compared to the traditional ones.

Recommendations

• A model of self-avoiding random walks for searching complex networks
• High-Dimensional Graphical Networks of Self-Avoiding Walks
• Multi-hop assortativities for network classification
• Classification of scale-free networks
• Detecting the topologies of complex networks with stochastic perturbations

Cites work

• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• A complex network-based approach for boundary shape analysis
• Applied MANOVA and Discriminant Analysis
• Collective dynamics of `small-world' networks
• Deterministic walks in random environments
• Deterministic walks in random networks: An application to thesaurus graphs
• Emergence of Scaling in Random Networks
• From random walks to spin glasses
• Further travels with my ant
• Hierarchical characterization of complex networks
• Recurrence properties of Lorentz lattice gas cellular automata
• Texture analysis and classification using deterministic tourist walk
• The Structure and Function of Complex Networks
• The random walk's guide to anomalous diffusion: A fractional dynamics approach
• Walking on fractals: diffusion and self-avoiding walks on percolation clusters

Cited in

(4)

• scientific article; zbMATH DE number 6304438 (Why is no real title available?)
• Using deterministic self-avoiding walks as a small-world metric on Watts-Strogatz networks
• Dynamic texture analysis using networks generated by deterministic partially self-avoiding walks
• Model simplification for supervised classification of metabolic networks

This page was built for publication: Complex network classification using partially self-avoiding deterministic walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944603)