Pith. sign in

REVIEW 1 cited by

IRWE: Inductive Random Walk for Joint Inference of Identity and Position Network Embedding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.00651 v3 pith:KEGGCQ3L submitted 2024-01-01 cs.SI

classification cs.SI
keywords inductiveinferenceembeddingidentitypositionattributesembeddingsirwe
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Network embedding, which maps graphs to distributed representations, is a unified framework for various graph inference tasks. According to the topology properties (e.g., structural roles and community memberships of nodes) to be preserved, it can be categorized into the identity and position embedding. Most existing methods can only capture one type of property. Some approaches can support the inductive inference that generalizes the embedding model to new nodes or graphs but relies on the availability of attributes. Due to the complicated correlations between topology and attributes, it is unclear for some inductive methods which type of property they can capture. In this study, we explore a unified framework for the joint inductive inference of identity and position embeddings without attributes. An inductive random walk embedding (IRWE) method is proposed, which combines multiple attention units to handle the random walk (RW) on graph topology and simultaneously derives identity and position embeddings that are jointly optimized. We demonstrate that some RW statistics can characterize node identities and positions while supporting the inductive inference. Experiments validate the superior performance of IRWE over various baselines for the transductive and inductive inference of identity and position embeddings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Random feature aggregation (RFA) derives identity and position graph embeddings from random noise via one parameter-free spectral propagation, matching or beating trained baselines at much lower cost.

Pith tools