From random walks to distances on unweighted graphs
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the significance of this problem, statistical characterization of t...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Neural Information Processing Systems Foundation, Inc.
2018
|
| Online Access: | http://hdl.handle.net/1721.1/115396 https://orcid.org/0000-0003-0521-5855 https://orcid.org/0000-0002-2199-0379 https://orcid.org/0000-0003-4283-6327 |