Complex network classification using partially self-avoiding deterministic walks

DOI10.1063/1.4737515zbMath1319.05121arXiv1112.5625OpenAlexW2004283196WikidataQ43794281 ScholiaQ43794281MaRDI QIDQ2944603

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)

Related Items (2)

Dynamic texture analysis using networks generated by deterministic partially self-avoiding walks ⋮ Using deterministic self-avoiding walks as a small-world metric on Watts-Strogatz networks

Cites Work

• Unnamed Item
• Deterministic walks in random environments
• Hierarchical characterization of complex networks
• A complex network-based approach for boundary shape analysis
• Recurrence properties of Lorentz lattice gas cellular automata
• From random walks to spin glasses
• Deterministic walks in random networks: An application to thesaurus graphs
• Further travels with my ant
• Texture analysis and classification using deterministic tourist walk
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks
• Applied MANOVA and Discriminant Analysis
• Walking on fractals: diffusion and self-avoiding walks on percolation clusters
• The random walk's guide to anomalous diffusion: A fractional dynamics approach

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