World Wide Web

Engineering

Statistics

Centrality

Node (physics)

Theoretical computer science

Curse of dimensionality

Bipartite graph

Random graph

Set (abstract data type)

Computer science

Complex network

Embedding

Network science

Graph

Mathematics

Artificial intelligence

Combinatorics

Structural engineering

Programming language

Random walk

Random walks are widely adopted in various network analysis tasks ranging from network embedding to label propagation. It could capture and convert geometric structures into structured sequences while alleviating the issues of sparsity and curse of dimensionality. Though random walks on plain networks have been intensively studied, in real-world systems, nodes are often not pure vertices, but own different characteristics, described by the rich set of data associated with them. These node attributes contain plentiful information that often complements the network, and bring opportunities to the random-walk-based analysis. However, it is unclear how random walks could be developed for attributed networks towards an effective joint information extraction. Node attributes make the node interactions more complicated and are heterogeneous with respect to topological structures.

Graph Recurrent Networks With Attributed Random Walks