Inferring Networks From Random Walk-Based Node Similarities

Jeremy Hoskins, Cameron Musco, Christopher Musco, Babis Tsourakakis

Nov-20-2025, 15:27:27 GMT–Neural Information Processing Systems

For the effective resistance metric, we show that with just a small subset of measurements, one can learn a large fraction of edges in a social network. We also show that it is possible to learn a graph which accurately matches the underlying network on all other effective resistances.

artificial intelligence, data mining, machine learning, (20 more...)

Neural Information Processing Systems

Nov-20-2025, 15:27:27 GMT

Conferences PDF

Add feedback

Country:
- North America
  - Canada > Quebec
    - Montreal (0.04)
  - United States
    - California > Santa Clara County
      - Palo Alto (0.04)
    - Connecticut > New Haven County
      - New Haven (0.04)
    - Massachusetts
      - Middlesex County > Cambridge (0.04)
      - Suffolk County > Boston (0.04)
    - New Jersey > Mercer County
      - Princeton (0.04)

Industry:
- Information Technology (0.68)

Technology:
- Information Technology
  - Artificial Intelligence
    - Machine Learning > Statistical Learning (1.00)
    - Representation & Reasoning (1.00)
  - Communications > Social Media (1.00)
  - Data Science > Data Mining (1.00)
  - Information Management (1.00)

Duplicate Docs Excel Report

Title
Inferring Networks From Random Walk-Based Node Similarities
Inferring Networks From Random Walk-Based Node Similarities

Similar Docs Excel Report more

Title	Similarity	Source
None found