{"id":16722273,"url":"https://github.com/phipsgabler/netsci-02","last_synced_at":"2026-02-06T21:01:04.259Z","repository":{"id":82586559,"uuid":"79138520","full_name":"phipsgabler/netsci-02","owner":"phipsgabler","description":null,"archived":false,"fork":false,"pushed_at":"2017-02-02T18:31:49.000Z","size":5122,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-07-27T23:45:14.032Z","etag":null,"topics":["network-science","percolation"],"latest_commit_sha":null,"homepage":null,"language":"Julia","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"unlicense","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/phipsgabler.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-01-16T16:46:47.000Z","updated_at":"2017-02-02T18:25:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"a4e16259-264a-4ba7-965c-71ec9c2d93dc","html_url":"https://github.com/phipsgabler/netsci-02","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/phipsgabler/netsci-02","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phipsgabler%2Fnetsci-02","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phipsgabler%2Fnetsci-02/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phipsgabler%2Fnetsci-02/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phipsgabler%2Fnetsci-02/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/phipsgabler","download_url":"https://codeload.github.com/phipsgabler/netsci-02/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/phipsgabler%2Fnetsci-02/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29175822,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-06T20:14:21.878Z","status":"ssl_error","status_checked_at":"2026-02-06T20:14:21.443Z","response_time":59,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["network-science","percolation"],"created_at":"2024-10-12T22:34:09.423Z","updated_at":"2026-02-06T21:01:04.083Z","avatar_url":"https://github.com/phipsgabler.png","language":"Julia","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Network Science - Project 2#\n\n## Motivation: destroying networks fast ##\n\nMy goal is to learn a way of informed percolation which optimally disconnects a network.  This can be useful, e.g., for \npreventing desease spreading by optimally targeting persons to be vaccinated, or to find out which nodes in a network \nshould be prioritized in protection (or conversely, attacked with priority...).\n\n## Method ##\n\nFor that purpose, I want to try taking into account some local node information `info` (like degree, local clustering \ncoefficient, triangles, etc.), and learn the optimal way to combine it. This amounts to having a function\n\n    f(node) = σ(wᵀ · info(node)),\n    \n(where `σ` is the logistic function) which we use as the distribution for percolation.  We then want to minimize the \nexpected area under the percolation curve with respect to the weights `w`, estimated by simulating a few percolation \nruns using it.\n\n## Experimental setup ##\n\nI use simulated annealing to optimize the problem, because it requires fewer calls to the target function, which in \nthis case is quite costly.  Furthermore, the sample runs simulated in the loss function can be run in parallel.\n\nTo compare different network types, I choose several ones from different domains (roads, social, infrastructure, random),\nand compare the result obtained by optimization to the baseline of uniform percolation.\n\n# LICENSE #\n\nAll code and text by me are [unlicensed](http://unlicense.org/).\n\nSources of the data sets (I have preprocessed some of them):\n\n- Facebook: J. McAuley and J. Leskovec. Learning to Discover Social Circles in Ego Networks. NIPS, 2012; via [SNAP](http://snap.stanford.edu/data/egonets-Facebook.html)\n- US Powergrid: Watts, D. J., Strogatz, S. H., 1998. Collective dynamics of “small-world” networks. Nature 393, 440-442; via [Tore Opsahl](https://toreopsahl.com/datasets/#uspowergrid)\n- Euroroad: [KONECT](http://konect.uni-koblenz.de/networks/subelj_euroroad)\n- Philadelphia transportation: [TransportationNetworks](https://github.com/bstabler/TransportationNetworks/tree/a6a968de8f6db1bc15ff0ff3b19ebd8a50afc79e/Philadelphia)\n- Austin transportation: [TransportationNetworks](https://github.com/bstabler/TransportationNetworks/tree/a6a968de8f6db1bc15ff0ff3b19ebd8a50afc79e/Austin)\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphipsgabler%2Fnetsci-02","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fphipsgabler%2Fnetsci-02","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fphipsgabler%2Fnetsci-02/lists"}