webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…
Just set up some new IAQ monitoring stations around the house. Still want to put one in the bedroom to see how stuffy it gets at night with the door closed, but I only had four units so this is what I started with.
Particle counts are Sensirion SEN5x, CO2 and most other atmospheric data SCD4x.
Haven't done any kind of zero cal on the CO2 and they've been sitting around idle for a while, so there's probably a bit of offset that will need to be corrected - the one on th…
"Dynamic electric vehicle charging incentives induce large shifts in both the timing and location of charging.
Incentives designed to shift charging toward peak solar generation periods result in a 34% increase in midday charging."
https://www.sciencedirect.com/science/arti
caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 21157 nodes and 85468 edges.
Tags: Technological, Communication, Unweighted, Temporal
So apparently running massive EM solver simulations makes my workstation draw enough power compared to normal usage that it shows up in the lab-wide power usage graphs.
I wonder how much more it'll pull when I get the uncapped version that uses all my cores
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 12 nodes and 42 edges.
Tags: Social, Fictional, Weighted
Wooo, I have made many graphs and they look good. Proxmox is now pushing to Influx as well. I still need to get Grafana behind `nginx`, but I can do that later.
#homelab #monitoring #influx
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 346 nodes and 26832 edges.
Tags: Informational, Web gr…
arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…
Graphical Analysis of Lifted Product Code Constructions
Ragnar Freij-Hollanti, Kirsten D. Morris, Patricija \v{S}apokait\.e
https://arxiv.org/abs/2606.11987 https://arxiv.org/pdf/2606.11987 https://arxiv.org/html/2606.11987
arXiv:2606.11987v1 Announce Type: new
Abstract: Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.
toXiv_bot_toot
Tools used:
1. Anthropic’s Claude Code as the AI agent
2. DeepSeek-v4 as the LLM
3. Virtuoso Data Spaces platform, comprising:
* A WebDAV-based filesystem for hosting generated RDF, HTML, and Markdown documents
* A high-performance DBMS engine that automatically ingests and manages these documents
* Support for RDF graphs and relational tables accessible via SQL, SPARQL, GraphQL, etc. (note: we also have openCypher and GQL in the works to bury…
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…
Hmm not sure if the #qemu issue rate is accelerating or not. Is that a hockystick? #graphs #vibed
Crosslisted article(s) found for math.SP. https://arxiv.org/list/math.SP/new
[1/1]:
- Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries
Andrew Niu
https://arxiv.org/abs/2605.15017 https://mastoxiv.page/@arXiv_mathCO_bot/116577628725645448
toXiv_bot_toot
#ARVO2026 today, May 6, 2:30-2:45pm room 403 talk 4493 in Emerging technologies for low vision: Comparing tactile & auditory sensory substitution on visual cortex recruitment in the early and late blind https://
Crosslisted article(s) found for math.AT. https://arxiv.org/list/math.AT/new
[1/1]:
- RTD-Lite: Scalable Topological Analysis for Comparing Weighted Graphs in Learning Tasks
Eduard Tulchinskii, Daria Voronkova, Ilya Trofimov, Evgeny Burnaev, Serguei Barannikov
https://arxiv.org/abs/2503.11910 https://mastoxiv.page/@arXiv_csLG_bot/114182227105908009
- Hallucination Detection in LLMs with Topological Divergence on Attention Graphs
Alexandra Bazarova, et al.
https://arxiv.org/abs/2504.10063 https://mastoxiv.page/@arXiv_csCL_bot/114340822288698487
- Arithmetic Wu Formulas and the Generalized Hecke Theorem
Shachar Carmeli, Mark Shusterman, Sa'ar Zehavi
https://arxiv.org/abs/2606.06008 https://mastoxiv.page/@arXiv_mathNT_bot/116696438874436734
- $p$-adic Bi-Filtrations for Topological Machine Learning on Genomic Sequences
Tirtharaj Dash, Gunja Sachdeva
https://arxiv.org/abs/2606.06117 https://mastoxiv.page/@arXiv_qbioQM_bot/116696454797742926
- RedZeD: Computing persistent homology by Reduction to Zero Differentials
Chris Kapulkin, Nathan Kershaw
https://arxiv.org/abs/2606.06310 https://mastoxiv.page/@arXiv_csCG_bot/116696326602622617
toXiv_bot_toot
i would have a lot more sympathy for this graph if 99% of github's blog posts weren't boosting the very thing that causes it
Testing out the new light mode toolbar artwork for ngscopeclient.
The application as a whole is definitely not practical to use in light mode yet. While it's theoretically possible and there's selectors in the preferences dialog to configure all of the non-contrasty colors, you would need to update 50 separate preferences to re-theme everything from the color of X axis tickmarks to the cursors in the plot.
Down the road, most likely for v0.3, the plan is to simplify this …
Can you recommend me some paper to read? What paper(s) did you read lately that you recommend? Computer Science preferred. Maths, specially graphs stuff, is ok. Astrophysics (if it is half readable for a hobbyist) is also fine.
caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 23072 nodes and 78684 edges.
Tags: Technological, Communication, Unweighted, Temporal
I have a similar cognitive response in these two different scenarios: reading the sciencey page at the dispensary that shows how awesome this strain is.
And reading the sciencey page about LLMs like the one below.
I read them with the full intention of understand said science. Then I get a few sentences in, and what looks like made up words start appearing. A few paragraphs in and I'm not sure it's English anymore.
But, hey they have graphs. And their dots are th…
UKHSA Dashboard has added graphs for 8 years of antibiotic use, and for all of the publicity regarding antibiotic resistance, we're not really seeing a downturn in use.
https://ukhsa-dashboard.data.gov.uk/antimicrobial-consumption/total-antibiotic-use…
arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 31163 nodes and 120029 edges.
Tags: Social, Collaborati…
Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications
\'Angel Alfredo Mor\'an Ledezma
https://arxiv.org/abs/2605.13423 https://arxiv.org/pdf/2605.13423 https://arxiv.org/html/2605.13423
arXiv:2605.13423v1 Announce Type: new
Abstract: We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on $[0,1]$ induced by a family of nested partitions and $w$ is a positive kernel. The resulting random graphs exhibit a nested hierarchical community structure in which the density of connections is governed by the ultrametric distance between vertices. The Laplacian $L_d^k$ of the deterministic graph sampled from an ultrametric graphon is itself an ultrametric Laplacian, whose eigenvalues and spectral projectors admit completely explicit closed-form expressions in terms of the community sizes and inter-community connection densities. We show that the normalized eigenvalues and spectral projectors of the random Laplacian $L_r^k$ are arbitrarily close to those of $L_d^k$ with high probability as $k\to\infty$, so that the explicit formulas for $L_d^k$ provide closed-form approximations for the spectrum and spectral projectors of $L_r^k$. As applications: a sign structure theorem generalizes the Fiedler vector criterion to hierarchical networks with arbitrarily many communities; a detectability threshold $p^*=\min_i\rho_i$ governs spectral community detection for one-level hierarchical graphons; the pseudo-inverse Laplacian $L_W^ $ is constructed and shown to be the almost sure limit of the pseudo-inverse of $L_r^k$, implying that hitting and commute times collapse to quantities depending only on the expected degrees of the endpoints; and explicit closed-form stability conditions for the SIS disease-free equilibrium reveal a fundamental tension between homogeneous and heterogeneous community structures, confirmed by numerical experiments.
toXiv_bot_toot
At #ARVO2026, Wednesday May 6: The vOICe visual-to-auditory sensory substitution device (SSD) for the blind evokes stronger visual cortex activity than a tongue display unit (TDU), for both early blind and late blind people https://mas.…
route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 2102 nodes and 4675 edges.
Tags: Technological, Communication, Unweighted, Temporal
Crosslisted article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Delta-pulse solution in Zener viscoelastic model
Andrea Mentrelli, Juan Luis Gonzalez-Santander, Francesco Mainardi
https://arxiv.org/abs/2606.04024 https://mastoxiv.page/@arXiv_mathph_bot/116690715796108102
- On the First Caustic of Elliptical Billiards
Aleksandra Uskova
https://arxiv.org/abs/2606.04132 https://mastoxiv.page/@arXiv_mathDS_bot/116690728606418123
- Combinatorial and analytic aspects of independence polynomials of zero divisor graphs
Bilal Ahmad Rather
https://arxiv.org/abs/2606.04789 https://mastoxiv.page/@arXiv_mathCO_bot/116690805845491494
- Median porosity is quasiconformally invariant
Tero Kilpel\"ainen, Antti V. V\"ah\"akangas
https://arxiv.org/abs/2606.05034 https://mastoxiv.page/@arXiv_mathCA_bot/116690760260142089
toXiv_bot_toot
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 70 nodes and 299 edges.
Tags: Social, Fictional, Weighted
Replaced article(s) found for math.SP. https://arxiv.org/list/math.SP/new
[1/1]:
- Perron matrix semigroups
Vladimir Yu. Protasov
https://arxiv.org/abs/2502.10571 https://mastoxiv.page/@arXiv_mathRA_bot/114023632633490341
- The cut-off resolvent can grow arbitrarily fast in obstacle scattering
Simon N. Chandler-Wilde, Siavash Sadeghi
https://arxiv.org/abs/2508.16958 https://mastoxiv.page/@arXiv_mathAP_bot/115094416718673800
- Resonant scattering for tunable quantum walks on graphs with tails
Kenta Higuchi, Ryuta Ishikawa, Hisashi Morioka, Etsuo Segawa, Eijirou Yoshimura
https://arxiv.org/abs/2602.03192
toXiv_bot_toot
Crosslisted article(s) found for math.AT. https://arxiv.org/list/math.AT/new
[1/1]:
- RTD-Lite: Scalable Topological Analysis for Comparing Weighted Graphs in Learning Tasks
Eduard Tulchinskii, Daria Voronkova, Ilya Trofimov, Evgeny Burnaev, Serguei Barannikov
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 47 nodes and 219 edges.
Tags: Social, Fictional, Weighted
Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
Fernando Granha Jeronimo, Lenny Liu, Pranav Rajpal
https://arxiv.org/abs/2601.10047 https://mastoxiv.page/@arXiv_csIT_bot/115903956641689136
- Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization
Xiang Zhang, Giuseppe Caire, Mingyue Ji
https://arxiv.org/abs/2602.12220 https://mastoxiv.page/@arXiv_csIT_bot/116062725600909840
- A New Approach to Code Smoothing Bounds
Tsuyoshi Miezaki, Yusaku Nishimura, Katsuyuki Takashima
https://arxiv.org/abs/2603.18077 https://mastoxiv.page/@arXiv_csIT_bot/116260380391748925
- Fluid Antenna Systems Enabling 6G HRLLC With Port Switching Delay
Xusheng Zhu, Kai-Kit Wong, Hao Xu, Chenguang Rao, Hyundong Shin
https://arxiv.org/abs/2605.06275 https://mastoxiv.page/@arXiv_csIT_bot/116537839161835575
- Accurate Estimation of Mutual Information in High Dimensional Data
Eslam Abdelaleem, K. Michael Martini, Ilya Nemenman
https://arxiv.org/abs/2506.00330 https://mastoxiv.page/@arXiv_physicsdataan_bot/114618315134354611
- SDQM: Synthetic Data Quality Metric for Object Detection Dataset Evaluation
Ayush Zenith, Arnold Zumbrun, Neel Raut, Jing Lin
https://arxiv.org/abs/2510.06596 https://mastoxiv.page/@arXiv_csCV_bot/115343628773188610
- SEDULity: A Proof-of-Learning Framework for Distributed and Secure Blockchains with Efficient Use...
Weihang Cao, Mustafa Doger, Sennur Ulukus
https://arxiv.org/abs/2512.13666 https://mastoxiv.page/@arXiv_csCR_bot/115729118798706696
- A theory of learning data statistics in diffusion models, from easy to hard
Lorenzo Bardone, Claudia Merger, Sebastian Goldt
https://arxiv.org/abs/2603.12901 https://mastoxiv.page/@arXiv_statML_bot/116237842977106276
- On the independence number of de Bruijn graphs
Pietro Majer, Matteo Novaga
https://arxiv.org/abs/2604.14671 https://mastoxiv.page/@arXiv_mathCO_bot/116419097221023806
- Information bottleneck for learning the phase space of dynamics from high-dimensional experimenta...
K. Michael Martini, Eslam Abdelaleem, Paarth Gulati, Ilya Nemenman
https://arxiv.org/abs/2604.24662 https://mastoxiv.page/@arXiv_physicsdataan_bot/116481236697063671
- Improved Amenability Bounds for Local Coordination Games
Ron Peretz, Dean Kraizberg
https://arxiv.org/abs/2606.01963 https://mastoxiv.page/@arXiv_csGT_bot/116679490095124433
toXiv_bot_toot
caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 21901 nodes and 89176 edges.
Tags: Technological, Communication, Unweighted, Temporal
Discretisation and independent resolutions of ample groupoids
Xin Li, Alistair Miller
https://arxiv.org/abs/2606.21761 https://arxiv.org/pdf/2606.21761 https://arxiv.org/html/2606.21761
arXiv:2606.21761v1 Announce Type: new
Abstract: We develop a general framework for understanding and computing both the groupoid homology of an ample groupoid and the topological K-theory of its reduced C*-algebra, based on two main ideas: discretisation and independent resolutions. Discretisation shows that a special class of ample groupoids we term independent groupoids are homologically and K-theoretically equivalent to discrete groupoids. We introduce the notion of a resolution by independent groupoids and provide a recipe for building a controlled independent resolution of a given ample groupoid of interest, leading to a systematic way of studying its homology and K-theory. In order to illustrate our general ideas and methods, we work out several concrete examples and applications. Garside categories provide a wide range of examples, including higher rank graphs, self-similar groups and spherical Artin-Tits groups. We also present an application to the homology of Stein's groups.
toXiv_bot_toot
Crosslisted article(s) found for math.SP. https://arxiv.org/list/math.SP/new
[1/1]:
- Analytic local resolution of Medvedev's Morse index conjecture for the critical hyperbolic cateno...
Alexander Pigazzini
https://arxiv.org/abs/2605.13562 https://mastoxiv.page/@arXiv_mathDG_bot/116571915012742224
- Determinantal point processes associated with the Bochner-Schr\"odinger operator
Yuri A. Kordyukov
https://arxiv.org/abs/2605.13575 https://mastoxiv.page/@arXiv_mathDG_bot/116571924843260732
- Spectral instability and non-uniqueness of mild solutions for the Keller-Segel system
Eliseo Luongo, Umberto Pappalettera
https://arxiv.org/abs/2605.13592 https://mastoxiv.page/@arXiv_mathAP_bot/116571934281016744
- Quantum Fractional Revival and Entanglement Entropy in Unitary Cayley Graphs
Duaa Abdullah
https://arxiv.org/abs/2605.13645 https://mastoxiv.page/@arXiv_mathCO_bot/116571957678938731
toXiv_bot_toot
route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4816 nodes and 9988 edges.
Tags: Technological, Communication, Unweighted, Temporal
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…
Berry's phase under topology change
Pavel Kurasov, Vladislav Shubin, Axel Tibbling
https://arxiv.org/abs/2605.10798 https://arxiv.org/pdf/2605.10798 https://arxiv.org/html/2605.10798
arXiv:2605.10798v1 Announce Type: new
Abstract: Laplacians on metric graphs are used to construct continuous families of Hamiltonians with different topological structure. One such family is used to demonstrate that Hamiltonians with real-valued eigenfunctions may possess non-trivial geometric Berry's phase. Connections between non-trivial Berry's phase and topology change are discussed.
toXiv_bot_toot
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…
arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 434 nodes and 30462 edges.
Tags: Informational, Web gr…
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 434 nodes and 30462 edges.
Tags: Informational, Web gr…
webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…
arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…
arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 38 nodes and 96 edges.
Tags: Social, Fictional, Weighted
route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3340 nodes and 6469 edges.
Tags: Technological, Communication, Unweighted, Temporal
arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…
route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 512 nodes and 1273 edges.
Tags: Technological, Communication, Unweighted, Temporal
…
arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…
route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3790 nodes and 7531 edges.
Tags: Technological, Communication, Unweighted, Temporal
route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4196 nodes and 8473 edges.
Tags: Technological, Communication, Unweighted, Temporal
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 18 nodes and 50 edges.
Tags: Social, Fictional, Weighted
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 42 nodes and 109 edges.
Tags: Social, Fictional, Weighted
route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3505 nodes and 6856 edges.
Tags: Technological, Communication, Unweighted, Temporal
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 32 nodes and 80 edges.
Tags: Social, Fictional, Weighted
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 50 nodes and 169 edges.
Tags: Social, Fictional, Weighted
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 37 nodes and 71 edges.
Tags: Social, Fictional, Weighted
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 25 nodes and 91 edges.
Tags: Social, Fictional, Weighted
moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 38 nodes and 96 edges.
Tags: Social, Fictional, Weighted
@netzschleuder@social.skewed.de
