-
Notifications
You must be signed in to change notification settings - Fork 2
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Graph metrics #106
Open
joy-kitson
wants to merge
21
commits into
develop
Choose a base branch
from
graph-metrics
base: develop
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Graph metrics #106
Conversation
This file contains 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
Computes average connectivity using minimum edge cuts from a weighted/unweighted sample size of vertex pairs
Added minimal comments documenting the code
Uses a sample to approximate a graph's average eccentricity and the diameter of the graph (maximum eccentricity in the sample)
Add flush=True to print statements and add intermediate print statements to show progress
Add flush=True to print statements and add intermediate print statements to track progress
Computes the average cluster coefficient of a graph using squares
Shuffle vertices before processing
Converts a visits.csv file to a sparse adjacency matrix form (compressed sparse row)
Utilized pandas and scipy.sparse optimizations to heavily optimize this conversion
Add printing of metrics to the end (number of non zeroes, average number of non zeroes per row, 1-norm, and frobenius norm)
Takes in original population directory, proportion of visits to change, and output population directory. Randomly replaces that proportion of visits' (without replacement) with locations that are randomly picked (with replacement). Then, the new population directory is created with the new visits.csv file and soft links to other population files in the old directory.
…ph_perturbation.py to point to
…s to maintain types in input file
Script that calculate and print all of the relevant sparse adjacency matrix metrics as well as location heuristics for a given population directory
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
No description provided.