{"package":"r-netrankr","ecosystem":"conda","exists":true,"latest_version":"1.2.4","repository":"","license":"MIT","description":"Implements methods for centrality related analyses of networks.  While the package includes the possibility to build more than 20 indices,  its main focus lies on index-free assessment of centrality via partial  rankings obtained by neighborhood-inclusion or positional dominance. These  partial rankings can be analyzed with different methods, including  probabilistic methods like computing expected node ranks and relative  rank probabilities (how likely is it that a node is more central than ano","downloads_weekly":450,"deprecated":false,"health":{"score":52},"_cache":"db_only_bot","_partial":true,"_response_ms":1,"_powered_by":"depscope.dev — bot fast path (DB-only)","recommendation":{"action":"review"}}