# Analyzing Partial Rankings in Networks

## Documentation for package ‘netrankr’ version 1.2.4

- DESCRIPTION file
- User guides, package vignettes and other documentation
- Package NEWS
- Package README

## Help Pages

aggregate_positions | Quantification of (indirect) relations
approx_rank_expected | Approximation of expected ranks
approx_rank_relative | Approximation of relative rank probabilities
as.matrix.netrankr_full | Extract probabilities from netrankr_full object
comparable_pairs | Comparable pairs in a partial order
compare_ranks | Count occurrences of pairs in rankings
dbces11 | dbces11 graph
dist_2pow | Transform indirect relations
dist_dpow | Transform indirect relations
dist_inv | Transform indirect relations
dist_powd | Transform indirect relations
dominance_graph | Partial ranking as directed graph
exact_rank_prob | Probabilistic centrality rankings
florentine_m | Florentine family marriage network
get_rankings | Rankings that extend a partial ranking
hyperbolic_index | Hyperbolic (centrality) index
incomparable_pairs | Incomparable pairs in a partial order
index_builder | Centrality Index Builder
indirect_relations | Indirect relations in a network
is_preserved | Check preservation
majorization_gap | Majorization gap
mcmc_rank_prob | Estimate rank probabilities with Markov Chains
neighborhood_inclusion | Neighborhood-inclusion preorder
plot.netrankr_full | Plot netrankr_full object
plot.netrankr_interval | plot netrankr_interval objects
plot.netrankr_mcmc | Plot netrankr_mcmc object
plot_rank_intervals | Plot rank intervals
positional_dominance | Generalized Dominance Relations
print.netrankr_full | Print netrankr_full object to terminal
print.netrankr_interval | Print netrankr_interval object to terminal
print.netrankr_mcmc | Print netrankr_mcmc object to terminal
rank_intervals | Rank interval of nodes
spectral_gap | Spectral gap of a graph
summary.netrankr_full | Summary of a netrankr_full object
swan_closeness | Impact on closeness when a node is removed
swan_combinatory | Error and attack tolerance of complex networks
swan_connectivity | Impact on connectivity when a node is removed
swan_efficiency | Impact on farness when a node is removed
threshold_graph | Random threshold graphs
transform_relations | Transform indirect relations
transitive_reduction | Transitive Reduction
walks_attenuated | Transform indirect relations
walks_exp | Transform indirect relations
walks_exp_even | Transform indirect relations
walks_exp_odd | Transform indirect relations
walks_limit_prop | Transform indirect relations
walks_uptok | Transform indirect relations