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…
I hate being able to see in fluently animated graphs and pictures who is profiting off of genocide, as it prevents me from being able to say that I didn't know what was going on later, but I also don't want to gatekeep this incredible site from you:
https://bl00d.money/
I built a full-page writing mode for Obsidian. It's not perfect, but it largely works for my purposes. It might not if you have Mermaid graphs or other things I don't run across. But it is open source, so you can turn fable on it. Link below.
1/2
Tired of all graphs being hockey sticks
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 41 nodes and 162 edges.
Tags: Social, Fictional, Weighted
ProtoGIB-Workload: Learning Workload-Specific Neural Topology Prototypes across Subjects
Yuzhe Zhang, Yixi Zhang, Shengdian Jiang, Chengxi Xie, Jihong Wang, Huan Liu, Man Yao, Minnan Luo, Chao Shen
https://arxiv.org/abs/2608.10647 https://arxiv.org/pdf/2608.10647 https://arxiv.org/html/2608.10647
arXiv:2608.10647v1 Announce Type: new
Abstract: Reliable electroencephalography (EEG)-based mental workload recognition is crucial for adaptive human-centered systems, yet practical deployment requires models to generalize to users unseen during training. Although functional connectivity graphs are widely adopted to capture workload-related neural interactions, they inherently entangle task-relevant structures with subject-specific physiological traits and sample-level noise. This entanglement often leads models to learn structural shortcuts, severely degrading cross-subject generalization. To address this, we propose ProtoGIB-Workload, a novel framework that explicitly regularizes and aligns graph structures for subject-independent workload recognition. Our approach introduces a Stochastic Graph Information Bottleneck (SGIB) to compress dense correlation priors into compact, task-relevant subgraphs, filtering out input-related redundancy. Crucially, to prevent the retention of subject-specific spurious edges, we propose a Class-Conditional Topology Stabilizer (CTS). Leveraging the fixed electrode coordinates of EEG data, CTS operates directly on graph-generation probabilities to encourage consistent edge-generation statistics across different subjects sharing the same workload class. Extensive experiments on two public EEG workload datasets and one in-house EEG cognitive load dataset of air traffic controllers under strict leave-one-subject-out (LOSO) protocols demonstrate that ProtoGIB-Workload significantly outperforms state-of-the-art temporal and graph-based baselines, improving the cross-subject Macro-F1 score by an average of 5.15% (up to 6.34%). Further analyses confirm that our method successfully extracts stable, cross-subject consistent neural connectivity patterns.
toXiv_bot_toot
Equivalence of Lin--Lu--Yau curvature and 1/2-Ollivier curvature on weighted graphs
Shiping Liu, Yunyan Yang
https://arxiv.org/abs/2608.05939 https://arxiv.org/pdf/2608.05939 https://arxiv.org/html/2608.05939
arXiv:2608.05939v1 Announce Type: new
Abstract: In this note, we prove that, on weighted graphs, the Lin--Lu--Yau curvature coincides with the $p$-Ollivier curvature up to scaling whenever the idleness parameter $p\geq 1/2$. Moreover, the threshold $1/2$ is sharp. This extends an earlier result of Bourne et al. (Ollivier--Ricci idleness functions of graphs, SIAM J. Discrete Math., 32 (2018), no. 2, 1408-1424), where combinatorial graphs were considered. This observation yields a simple proof for the global existence and uniqueness of solutions of the Lin--Lu--Yau curvature flow in Bai et al. (Ollivier Ricci-flow on weighted graphs, Amer. J. Math. 146 (2024), 1723-1747).
toXiv_bot_toot
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…
#today I did just half an hour of Tai Chi (but I also get the 2 miles walking there and back). I have worked quite productively (I hope) on my #research #paper revisions/corrections. Graphs looking smart…
Oh cool. Signed graphs have a homepage and I just visited it.
(to be fair, it's shared with gain and biased graphs)
https://people.math.binghamton.edu/zaslav/Bsg
Just when I thought we were getting a break in the smoke, we get more.
Now measuring 67 ug/m^3 PM2.5 which translates to an AQI of 159. New high score :(
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 24776 nodes and 101654 edges.
Tags: Technological, Communication, Unweighted, Temporal
The crawlers of Facebook and GPTbot are fighting who gets the most garbage from my Discworld LLM poisoner this week, but getting almost 8 GiB
#iocaine
https://olyfjan.blomi.is
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 26242 nodes and 106348 edges.
Tags: Technological, Communication, Unweighted, Temporal
Almost-Linear Decremental Single-Source Distance Estimates in Directed Graphs via Cut Balance
Hanqing Li (Peking University)
https://arxiv.org/abs/2610.07468 https://
then - including the same library code in every executable is wasteful -> let's build systems with shared libraries
now - shipping executables that work with every system's shared libraries is too hard -> let's bundle the correct shared libraries in a container
future - having every executable be an independent copy of electron is wasteful -> apps are now wasm bundles running in servo-os
post-future - capability dependency graphs are too complicated to …
Crosslisted article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- Automated Prefetching for Object Spatial Programming Using Temporal Trace Graphs
Baichuan Li, Jayanaka Dantanarayana, Savini Kashmira, Lingjia Tang, Jason Mars
Replaced article(s) found for math.AT. https://arxiv.org/list/math.AT/new
[1/1]:
- Relative cyclotomic structures and equivariant complex cobordism
Andrew J. Blumberg, Michael A. Mandell, Allen Yuan
https://arxiv.org/abs/2310.02348 https://mastoxiv.page/@arXiv_mathAT_bot/111180552474754562
- A multiplicative version of the tom Dieck splitting
Andrew J. Blumberg, Michael A. Mandell
https://arxiv.org/abs/2505.02721 https://mastoxiv.page/@arXiv_mathAT_bot/114459688814867416
- A rank-based distance for interval modules and Wasserstein stability of persistence landscapes
Peter Bubenik, Wanchen Zhao
https://arxiv.org/abs/2509.20921 https://mastoxiv.page/@arXiv_mathAT_bot/115269470873966833
- The rank-five Peterson hit problem, the Singer transfer, and canonical Milnor-operation layers
Dang Vo Phuc
https://arxiv.org/abs/2511.11745 https://mastoxiv.page/@arXiv_mathAT_bot/115569647485799776
- The Algebra of Categorical Spectra
Naruki Masuda
https://arxiv.org/abs/2605.03114 https://mastoxiv.page/@arXiv_mathAT_bot/116526500745660438
- Visualizing Local Maxima of the Ohio overdose epidemic with Vineyards
Nicholas Bermingham, David White, Nathan Willey
https://arxiv.org/abs/2607.05710 https://mastoxiv.page/@arXiv_mathAT_bot/116883198005698618
- Chern--Simons-type $3$-cocycles and $\mathbb{Q}/\mathbb{Z}$-torsion in the third homology of disc...
Takefumi Nosaka
https://arxiv.org/abs/2601.07230 https://mastoxiv.page/@arXiv_mathGT_bot/115886790889229457
- The Topology of $k$-Robust Clique Complexes in Grid-like Graphs
Marek Filakovsk\'y
https://arxiv.org/abs/2602.11365 https://mastoxiv.page/@arXiv_mathCO_bot/116062392661479542
- The Redshift Bound from Quillen-Lichtenbaum
Shay Ben-Moshe
https://arxiv.org/abs/2608.02180 https://mastoxiv.page/@arXiv_mathKT_bot/117036142171107624
toXiv_bot_toot
Converse bounds for multiple graph alignment and correlation detection based on last matching
Taha Ameen, Bruce Hajek
https://arxiv.org/abs/2608.14450 https://arxiv.org/pdf/2608.14450 https://arxiv.org/html/2608.14450
arXiv:2608.14450v1 Announce Type: new
Abstract: The paper focuses on information theoretic converse bounds for the alignment of $m$ correlated graphs and for the detection of correlation among $m$ graphs. A simple idea for $m\geq 3$ is that if the alignment of $m-1$ of the graphs is revealed as extra information (by a genie for example) then it is still necessary to produce the alignment between the one remaining graph and the others, i.e. the last matching must be accomplished. For both Gaussian and Erdos-Renyi models, the last-matching problem is equivalent to one with two observed graphs, providing a path to extend converse bounds for $m=2$ to larger $m$. While the method is rather obvious for alignment, we show that the method can also be used to derive converse bounds for weak detection of correlation.
toXiv_bot_toot
From Flows to Maps: Sampling Laws for Attractor Intensity and Bounded-Noise Escape
Jiguang Yu, Louis Shuo Wang
https://arxiv.org/abs/2608.02933 https://arxiv.org/pdf/2608.02933 https://arxiv.org/html/2608.02933
arXiv:2608.02933v1 Announce Type: new
Abstract: Intensity of attraction quantifies the largest amplitude of a persistent bounded disturbance that an attractor can withstand without loss of controlled confinement in its basin. Although intensity has been formulated separately for flows and maps, its behavior under temporal sampling has remained unresolved. We establish an explicit correspondence between the intensity $\mu(A)$ of a continuous-time attractor and the intensity $\mu_h(A)$ of its exact time-$h$ map. For an $L$-Lipschitz vector field, \[ \frac{\mu(A)}{1 Lh} \leq \frac{\mu_h(A)}{h} \leq \mu(A)\frac{e^{Lh}-1}{Lh}, \] and hence $\mu_h(A)/h\to\mu(A)$. The resulting first-order rate is sharp in general, while smooth scalar escape geometries can exhibit second-order convergence. We extend the framework to one-step numerical methods through a stability theory for block intensity and to attracting invariant graphs over compact invertible nonautonomous bases, obtaining uniform sampling convergence over the forcing phase. For bounded-support random perturbations, normalized discrete intensity is identified with the pathwise safety threshold; above it, finite escape follows under an explicit finite-exit condition, while escape probabilities require additional assumptions on the noise law. We also show that the discrete state--normal boundary map converges to the normalized Pontryagin boundary system governing extremal reachable-set boundaries. Exact scalar benchmarks, a grazing resilience model, planar Duffing escape, anisotropic disturbances, periodic and quasiperiodic forcing, and transfer-operator computations illustrate the theory. These results give intensity estimated from discrete observations or simulations a sampling-independent continuous-time meaning.
toXiv_bot_toot
Replaced article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Singularity of non-pluripolar cohomology classes
Duc-Bao Nguyen, Shuang Su, Duc-Viet Vu
https://arxiv.org/abs/2508.14669 https://mastoxiv.page/@arXiv_mathCV_bot/115065656430154433
- Analytic structure of $q$-pseudoconcave subsets of continuous graphs
Filippo Valnegri
https://arxiv.org/abs/2603.04967 https://mastoxiv.page/@arXiv_mathCV_bot/116181309294452296
- Non-symmetric vector dyson equations
Jiaoyang Huang, Zhonggen Su, Ruizhe Xu
https://arxiv.org/abs/2607.16333 https://mastoxiv.page/@arXiv_mathCV_bot/116956844212485469
- Cofinite Zeros of High Derivatives
Eric Hou
https://arxiv.org/abs/2607.20816 https://mastoxiv.page/@arXiv_mathCV_bot/116973837268195335
- Coefficient Problems for a Ma-Minda Convex Class Associated with the Normalized Arcsine Mapping
Shantanu Panja, Abhijit Banerjee, Jhilik Banerjee, Sujoy Majumder
https://arxiv.org/abs/2607.27293 https://mastoxiv.page/@arXiv_mathCV_bot/117013548331556229
- Skoda division theorem on compact K\"ahler manifolds for line bundles with singular hermitian met...
Jaehoon Jeong
https://arxiv.org/abs/2607.29669 https://mastoxiv.page/@arXiv_mathCV_bot/117030527056701741
- Classes of Holomorphic Multicomplex-Valued Functions Generated by Elliptic-Admissible Involutions
Nicolas Doyon, Pierre-Olivier Paris\'e, William Verreault
https://arxiv.org/abs/2211.13875
- Fast vanishing cycles on perturbations of complex weighted-homogeneous complete intersection germs
Dmitry Kerner, Rodrigo Mendes
https://arxiv.org/abs/2311.13423 https://mastoxiv.page/@arXiv_mathAG_bot/111458171750230260
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 21658 nodes and 88616 edges.
Tags: Technological, Communication, Unweighted, Temporal
> Since April, monthly commits have grown from 1.4 billion to 2.9 billion
And the graphs themselves are insane
https://github.blog/wp-content/uploads/2026/08/blog-post-aug-17-outage-1.png?w=1536
Most EEs know that compensating a passive R-C scope probe is important to get a good view of the signal.
But have you ever seen what this looks like in the frequency domain?
I messed up the compensation on one of my LeCroy passive probes and compared the scalar S21 response to it after correctly compensating.
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 5803 nodes and 12412 edges.
Tags: Technological, Communication, Unweighted, Temporal
Replaced article(s) found for nlin.CD. https://arxiv.org/list/nlin.CD/new
[1/1]:
- Entropy and $\omega$-limit sets on invariant graphs for a class of planar piecewise linear maps
Anna Cima, Armengol Gasull, V\'ictor Ma\~nosa, Francesc Ma\~nosas
https://arxiv.org/abs/2503.02411 https://mastoxiv.page/@arXiv_mathDS_bot/114108695476652580
toXiv_bot_toot
Using fonts in R graphics can be tricky at times. {showtext} aims to make it easier: #rstats
Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Reducibility of native weighted graphs on Rydberg Arrays
J. Kombe, J. D. Pritchard
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 40421 nodes and 175692 edges.
Tags: Social, Collaborati…
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 22706 nodes and 92826 edges.
Tags: Technological, Communication, Unweighted, Temporal
Comaximal Graphs of finite-dimensional Lie algebras over finite fields: Triangle counts and structural invariants
David Towers, Yesneri Zuleta, Ismael Gutierrez
https://arxiv.org/abs/2608.16575
Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Cluster deletion in cographs, permutation graphs, and graphs with bounded clique number
Nicola Galesi, Tony Huynh, Arnaud Patey, Fariba Ranjbar
Crosslisted article(s) found for math.DS. https://arxiv.org/list/math.DS/new
[1/2]:
- Inertial manifolds for the nonlocal parabolic problem
Xiaoqing Yang, Alexandre N. Carvalho, Chunyou Sun
https://arxiv.org/abs/2608.00197 https://mastoxiv.page/@arXiv_mathAP_bot/117036089642684807
- Why males compete rather than care, with an application to supplying collective goods
Sara L. Loo, Danya Rose, Michael Weight, Kristen Hawkes, Peter S. Kim
https://arxiv.org/abs/2608.00292 https://mastoxiv.page/@arXiv_qbioPE_bot/117036170847876781
- Sylvester's Theorem and Reduced Linear Systems: From Three-Factor Products to Small Dynamical Models
James M. Hyman
https://arxiv.org/abs/2608.00367 https://mastoxiv.page/@arXiv_mathHO_bot/117036100065935534
- Modeling Unknown Nonlocal PDE Systems via Flow Map Learning
Zhongshu Xu, Ying Li, Yanzhi Zhang, Dongbin Xiu
https://arxiv.org/abs/2608.00400 https://mastoxiv.page/@arXiv_csLG_bot/117036316536728731
- Fundamental examples of height functions on closed manifolds and their 1st derivatives
Naoki Kitazawa
https://arxiv.org/abs/2608.00556 https://mastoxiv.page/@arXiv_mathDG_bot/117036201322109036
- Duck hunting with quantum mechanics
Artem Alexandrov
https://arxiv.org/abs/2608.00579 https://mastoxiv.page/@arXiv_nlinPS_bot/117036126019380602
- Dynamics on graphs with disjoint cycles and applications
Pere Ara, Tran Quang Do, Tran Giang Nam
https://arxiv.org/abs/2608.00587 https://mastoxiv.page/@arXiv_mathRA_bot/117036105572329742
- Co-evolution of social reward and punishment under institutional interventions
Van An Nguyen, et al.
https://arxiv.org/abs/2608.01183 https://mastoxiv.page/@arXiv_csAI_bot/117036523376490165
- Reputation-driven Cooperation in Lattice-based Decentralized Federated Learning through Evolution...
Huynh, Vinh, Lam, Truong, Bui, Dinh, Le Gia, Le Nguyen Nhat, Duong, Han, Nguyen, Trang
https://arxiv.org/abs/2608.01197 https://mastoxiv.page/@arXiv_csAI_bot/117036523769335776
- The Riemann Problem for a 3x3 Generalized Chaplygin Gas System with Variable Pressure
Thomas Allen, Ella Kim, Jonathan Nunes, Rita Xing, Charis Tsikkou
https://arxiv.org/abs/2608.01580 https://mastoxiv.page/@arXiv_mathAP_bot/117036470486364433
- Non-KKT Accumulation in Entropic Mirror Descent
Kuangyu Ding, Kim-Chuan Toh
https://arxiv.org/abs/2608.01658 https://mastoxiv.page/@arXiv_mathOC_bot/117036313981076116
toXiv_bot_toot
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…
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…
For over 25 years, OmniGraffle has been helping you draw beautiful diagrams, family trees, flow charts, org charts, layouts, and other directed or non-directed graphs. We’ve been hard at work on the next version of OmniGraffle, and we're thrilled to share that test builds for Mac, iPad, and iPhone are now available to anyone who is interested in where OmniGraffle is headed!
https://www.omnigroup.com/blog/testing-the-next-omnigraffle
It's the end of the month, so here are the updated graphs of my bike riding. (Remember my spine was semi-broken the first 6 months of the year.)
#BikeTooter
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…
At #bbuzz 2026, David Louis Hollembaek and Vincent Pistor looked through 20 years of search evolution to show how knowledge graphs and vector search fix the missing link in today's Agentic AI.
https://youtu.be/6r9-Wf-NkI8?si=cgQpMNKU9nJYTlDY
Replaced article(s) found for math.DS. https://arxiv.org/list/math.DS/new
[1/2]:
- The structure of totally disconnected Host--Kra--Ziegler factors, and the inverse theorem for the...
Asgar Jamneshan, Or Shalom, Terence Tao
https://arxiv.org/abs/2303.04860 https://mastoxiv.page/@arXiv_mathDS_bot/109997807513962212
- Polynomial entropy of induced homeomorphisms on $C_k(\mathbb{S}^1)$ and $C_k([0,1])$
Ma\v{s}a {\DJ}ori\'c, Jelena Kati\'c
https://arxiv.org/abs/2509.06037 https://mastoxiv.page/@arXiv_mathDS_bot/115173666484478030
- On the geometric quantization of $\theta$-almost twisted Poisson manifold
Nasser Saipele Nansidi, Bertuel Tangue Ndawa, Joseph Dongho
https://arxiv.org/abs/2509.21168 https://mastoxiv.page/@arXiv_mathDS_bot/115269630154890083
- On the generating series of the degree sequence
Quang-Khai Nguyen
https://arxiv.org/abs/2510.06142 https://mastoxiv.page/@arXiv_mathDS_bot/115337828753858865
- Resolvent-Based Singular-Value Diagnostics for Data-Driven Koopman Finite Sections
Yuanchao Xu, Itsushi Sakata, Isao Ishikawa
https://arxiv.org/abs/2512.24953 https://mastoxiv.page/@arXiv_mathDS_bot/115819316279700435
- Refracting Filippov systems: sliding dynamics without sliding regions
D. J. W. Simpson
https://arxiv.org/abs/2603.10333 https://mastoxiv.page/@arXiv_mathDS_bot/116215253094993668
- Complete realization of multifractal entropy spectra and pressure functions
Xiaobo Hou, Wanshan Lin, Xueting Tian
https://arxiv.org/abs/2605.20617 https://mastoxiv.page/@arXiv_mathDS_bot/116611418906721246
- Structural Causal Discovery and Predictive Sufficiency in High-Dimensional Dynamical Systems
Abd AlRahman R. AlMomani, Curtis N. James, Christopher C. Hennon, Ronny Schroeder
https://arxiv.org/abs/2606.00710 https://mastoxiv.page/@arXiv_mathDS_bot/116679365046680815
- Shadowing in Dynamical Systems: Zero-dimensional Extensions and Inverse Limits
Dekui Peng
https://arxiv.org/abs/2606.14435 https://mastoxiv.page/@arXiv_mathDS_bot/116752985726507271
- One residual set of Cantor graphs with dense conjugacy classes
Zhengyu Yin
https://arxiv.org/abs/2607.21018 https://mastoxiv.page/@arXiv_mathDS_bot/116973856140760258
- Hausdorff dimension of non-uniquely ergodic directions in eigenform loci
Yuming Wei, Pengyu Yang
https://arxiv.org/abs/2607.24181 https://mastoxiv.page/@arXiv_mathDS_bot/116996562370083221
- Sharp Cyclicity of Neutral Entry--Exit Cycles with Quadratic Grazing
Haibo Lu
https://arxiv.org/abs/2607.27464 https://mastoxiv.page/@arXiv_mathDS_bot/117013446092691734
toXiv_bot_toot
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 40421 nodes and 175692 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 5482 nodes and 11699 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 3878 nodes and 7694 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 40421 nodes and 175692 edges.
Tags: Social, Collaborati…
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 21402 nodes and 87232 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 3210 nodes and 6157 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 3905 nodes and 7512 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 3351 nodes and 6497 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 3354 nodes and 6369 edges.
Tags: Technological, Communication, Unweighted, Temporal
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 18100 nodes and 74994 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…
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
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
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…
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…
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 49 nodes and 180 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 46 nodes and 191 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 12 nodes and 42 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 47 nodes and 219 edges.
Tags: Social, Fictional, Weighted
@netzschleuder@social.skewed.de
