{"id":20769691,"url":"https://github.com/rpytel1/mathoverflow-network-analysis","last_synced_at":"2026-04-28T03:33:56.401Z","repository":{"id":67530834,"uuid":"181166508","full_name":"rpytel1/mathoverflow-network-analysis","owner":"rpytel1","description":"Analysis of the mathoverflow user interaction data using networks","archived":false,"fork":false,"pushed_at":"2019-04-23T11:13:39.000Z","size":39958,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-11T19:45:43.563Z","etag":null,"topics":["mathoverflow","network-analysis","networkx","stackoverflow"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rpytel1.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":"2019-04-13T12:17:20.000Z","updated_at":"2024-11-09T07:10:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"55300440-7082-445d-9e86-058f0218128c","html_url":"https://github.com/rpytel1/mathoverflow-network-analysis","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rpytel1/mathoverflow-network-analysis","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rpytel1%2Fmathoverflow-network-analysis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rpytel1%2Fmathoverflow-network-analysis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rpytel1%2Fmathoverflow-network-analysis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rpytel1%2Fmathoverflow-network-analysis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rpytel1","download_url":"https://codeload.github.com/rpytel1/mathoverflow-network-analysis/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rpytel1%2Fmathoverflow-network-analysis/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32365509,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-27T20:07:02.737Z","status":"online","status_checked_at":"2026-04-28T02:00:07.250Z","response_time":56,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["mathoverflow","network-analysis","networkx","stackoverflow"],"created_at":"2024-11-17T11:44:48.312Z","updated_at":"2026-04-28T03:33:56.362Z","avatar_url":"https://github.com/rpytel1.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# tudelft-complex-networks #\nComplex networks project (2019).\n\n### New ideas? ###\n- [ ] think about multilayer network? \n- [ ] for certain time window we can define questions\n- [ ] roboustness attack: investigate how removal of few most popular answering users would collapse the network\nand num of questions would be unanswered\n- [ ] activity driven network \n\n## Final ideas ##\n1. Basic analysis of undirected network (metrics, if scale-free network etc)(Almost done)(RSK)\n2. Define user types and try to find patterns which define user type by comparing directed and undirected graph (RSK)\n3. Thread detection(NCH)\n4. Motifs analysis (implementation + look for patterns between layers and networks)(RPY)\n5. Popularity prediction (VSK)\n\nNotes: \n- check for each node in undirected graph as interaction(compare directed and undirected)\n- analyze motifs (algorithms from paper) and perform similar analysis as they did\n- GROUND TRUTH: no of posts per year(fitting distribution to the interactions we can calculate)\n- Finally analyze patterns on MathExchange and then later check if it generalize to others (super-user and ask-ubuntu)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frpytel1%2Fmathoverflow-network-analysis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frpytel1%2Fmathoverflow-network-analysis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frpytel1%2Fmathoverflow-network-analysis/lists"}