ptr: Run pass-to-rank on a weighted graph.

Description Usage Arguments Author(s)

Description

It extracts (non-zero) edge weight vector W from a graph and replaces it with 2*R / (|E|+1) where R is the rank of W and |E| is the number of edges. This does 'no-op' for an unweighted graph.

Usage

1
ptr(g)

Arguments

g

a graph in igraph format or an n x 2 edge list or an n x n adjacency matrix

Author(s)

Youngser Park youngser@jhu.edu


neurodata/graphstats documentation built on May 14, 2019, 5:19 p.m.