Add Bearkat Centralization statistics plugin#330
Open
bbraell wants to merge 5 commits into
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
This pull request adds Bearkat Centralization, a Gephi Statistics plugin that computes multiple graph centralization metrics from a single execution.
Implemented Metrics
The plugin supports both directed and undirected graphs where applicable and exports node-level values to the Data Laboratory in addition to graph-level centralization statistics.
Methodology
Harmonic closeness centralization is included to provide meaningful results for disconnected graphs, where Freeman closeness may be undefined.
The generated report includes notes explaining:
Validation
The implemented metrics were compared against results from igraph, statnet, and UCINET during development. Degree and harmonic closeness centralization matched the reference implementations. Betweenness centralization was adjusted to follow the standard Freeman formulation. Documentation has been included where different software packages may legitimately produce different eigenvector centralization values.
Acknowledgments
Programmed by Braell Dotson and Dr. Nate Jones at Sam Houston State University.
The generated report includes the citation:
Freeman, L. C. (1978). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215–239.