Network Inequality¶
NetIn is a Python package for the analysis of network inequalities. It is based on the NetworkX package and provides a set of functions to study inequalities (e.g., in ranking, inference) in social networks.
Contents:
- Graphs
- Algorithms
- Mechanisms
TriadicClosureTriadicClosure.get_metadata_as_dict()TriadicClosure.get_target_probabilities()TriadicClosure.get_triadic_closure()TriadicClosure.infer_triadic_closure()TriadicClosure.info_computed()TriadicClosure.info_params()TriadicClosure.init_special_targets()TriadicClosure.initialize()TriadicClosure.on_edge_added()TriadicClosure.set_triadic_closure()TriadicClosure.validate_parameters()
HomophilyHomophily.get_homophily_between_source_and_target()Homophily.get_homophily_majority()Homophily.get_homophily_minority()Homophily.get_metadata_as_dict()Homophily.get_target()Homophily.get_target_probabilities()Homophily.infer_homophily_values()Homophily.info_computed()Homophily.info_params()Homophily.initialize()Homophily.set_homophily_majority()Homophily.set_homophily_minority()Homophily.validate_parameters()
- Statistics
fit_power_law()get_ccdf()get_cdf()get_disparity()get_fraction_of_minority()get_gini_coefficient()get_pdf()get_average_degree()get_average_degrees()get_edge_type_counts()get_min_degree()get_minority_fraction()get_node_attributes()get_similitude()get_fraction_of_minority_in_ranking()get_gini_in_ranking()get_ranking_inequality()get_ranking_inequality_class()get_ranking_inequity()get_ranking_inequity_class()gini()
- Visualization
