Tootfinder

NodeShield: Runtime Enforcement of Security-Enhanced SBOMs for Node.js
Eric Cornelissen, Musard Balliu
https://arxiv.org/abs/2508.13750 https://arxiv.org/p…

NodeShield: Runtime Enforcement of Security-Enhanced SBOMs for Node.js
The software supply chain is an increasingly common attack vector for malicious actors. The Node.js ecosystem has been subject to a wide array of attacks, likely due to its size and prevalence. To counter such attacks, the research community and practitioners have proposed a range of static and dynamic mechanisms, including process- and language-level sandboxing, permission systems, and taint tracking. Drawing on valuable insight from these works, this paper studies a runtime protection mechani…

heise | Off-Grid-Messenger mit Meshfunktion: Meshtastic-Solarrouter im Eigenbau
Mit einem solarbetriebenen Meshtastic-Node hält man im Katastrophenfall die Kommunikation aufrecht. So geht der Eigenbau für wenig Geld.

On the usage of $2$-node lines in $n$-correct and $GC_n$ sets
Hakop Hakopian, Gagik Vardanyan, Navasard Vardanyan
https://arxiv.org/abs/2508.13289 https://…

On the usage of $2$-node lines in $n$-correct and $GC_n$ sets
An $n$-correct set $\mathcal{X}$ in the plane is a set of nodes admitting unique interpolation with bivariate polynomials of total degree at most $n$. A $k$-node line is a line passing through exactly $k$ nodes of $\mathcal{X}.$ A line can pass through at most $n+1$ nodes of an $n$-correct set. An $(n+1)$-node line is called maximal line (C. de Boor, 2007). We say that a node $A\in\mathcal{X}$ uses a line $\ell,$ if $\ell$ is a factor of the fundamental polynomial of the node $A.$ Let $\mat…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

Contrastive Multi-View Graph Hashing
Yang Xu, Zuliang Yang, Kai Ming Ting
https://arxiv.org/abs/2508.12377 https://arxiv.org/pdf/2508.12377

Contrastive Multi-View Graph Hashing
Multi-view graph data, which both captures node attributes and rich relational information from diverse sources, is becoming increasingly prevalent in various domains. The effective and efficient retrieval of such data is an important task. Although multi-view hashing techniques have offered a paradigm for fusing diverse information into compact binary codes, they typically assume attributes-based inputs per view. This makes them unsuitable for multi-view graph data, where effectively encoding …

Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation
Haruka Ezoe, Hiroki Matsumoto, Ryohei Hisano
https://arxiv.org/abs/2508.12674

Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation
Dynamic relational structures play a central role in many AI tasks, but their evolving nature presents challenges for consistent and interpretable representation. A common approach is to learn time-varying node embeddings, whose effectiveness depends on satisfying key stability properties. In this paper, we propose Unfolded Laplacian Spectral Embedding, a new method that extends the Unfolded Adjacency Spectral Embedding framework to normalized Laplacians while preserving both cross-sectional an…

Optimizing Allreduce Operations for Heterogeneous Architectures with Multiple Processes per GPU
Michael Adams, Amanda Bienz
https://arxiv.org/abs/2508.13397 https://

Optimizing Allreduce Operations for Heterogeneous Architectures with Multiple Processes per GPU
Large inter-GPU all-reduce operations, prevalent throughout deep learning, are bottlenecked by communication costs. Emerging heterogeneous architectures are comprised of complex nodes, often containing $4$ GPUs and dozens to hundreds of CPU cores per node. Parallel applications are typically accelerated on the available GPUs, using only a single CPU core per GPU while the remaining cores sit idle. This paper presents novel optimizations to large GPU-aware all-reduce operations, extending lane-a…

Replaced article(s) found for cs.SI. https://arxiv.org/list/cs.SI/new
[1/1]:
- Fast Geometric Embedding for Node Influence Maximization
Alexander Kolpakov, Igor Rivin

Simultaneous estimation of connectivity and dimensionality in samples of networks
Wenlong Jiang, Chris McKennan, Jes\'us Arroyo, Joshua Cape
https://arxiv.org/abs/2508.12483

Simultaneous estimation of connectivity and dimensionality in samples of networks
An overarching objective in contemporary statistical network analysis is extracting salient information from datasets consisting of multiple networks. To date, considerable attention has been devoted to node and network clustering, while comparatively less attention has been devoted to downstream connectivity estimation and parsimonious embedding dimension selection. Given a sample of potentially heterogeneous networks, this paper proposes a method to simultaneously estimate a latent matrix of …

Now out in #TMLR:
🍇 GRAPES: Learning to Sample Graphs for Scalable Graph Neural Networks 🍇
There's lots of work on sampling subgraphs for GNNs, but relatively little on making this sampling process _adaptive_. That is, learning to select the data from the graph that is relevant for your task.
We introduce an RL-based and a GFLowNet-based sampler and show that the approach perf…

Lightweight Node Selection in Hexagonal Grid Topology for TDoA-Based UAV Localization
Zexin Fang, Bin Han, Wenwen Chen, Hans D. Schotten
https://arxiv.org/abs/2506.14311

Lightweight Node Selection in Hexagonal Grid Topology for TDoA-Based UAV Localization
This paper investigates the optimization problem for TDoA-based UAV localization in low-altitude urban environments with hexagonal grid node deployment. We derive a lightweight optimized node selection strategy based on only RSSI measurements, to pre-select optimal nodes, avoiding extensive TDoA measurements in energy-constrained UAV scenarios. Theoretical and simulation results demonstrate that dynamically selecting the number of reference nodes improves localization performance while minimizi…

A Remedy for Over-Squashing in Graph Learning via Forman-Ricci Curvature based Graph-to-Hypergraph Structural Lifting
Michael Banf, Dominik Filipiak, Max Schattauer, Liliya Imasheva
https://arxiv.org/abs/2508.11390

A Remedy for Over-Squashing in Graph Learning via Forman-Ricci Curvature based Graph-to-Hypergraph Structural Lifting
Graph Neural Networks are highly effective at learning from relational data, leveraging node and edge features while maintaining the symmetries inherent to graph structures. However, many real-world systems, such as social or biological networks, exhibit complex interactions that are more naturally represented by higher-order topological domains. The emerging field of Geometric and Topological Deep Learning addresses this challenge by introducing methods that utilize and benefit from higher-ord…

Strain-induced Ettingshausen effect in spin-orbit coupled noncentrosymmetric metals
Gautham Varma K, Azaz Ahmad, Gargee Sharma
https://arxiv.org/abs/2508.13147 https://

Strain-induced Ettingshausen effect in spin-orbit coupled noncentrosymmetric metals
Elastic deformations couple with electronic degrees of freedom in materials to generate gauge fields that lead to interesting transport properties. Recently, it has been well studied that strain-induced chiral magnetic fields in Weyl semimetals lead to interesting magnetotransport induced by the chiral anomaly (CA). Recent studies have revealed that CA is not necessarily only a Weyl-node property, but is rather a Fermi surface property, and is also present in a more general class of materials, …

Market Viability and Completeness for Multinomial Models
Nahuel I. Arca
https://arxiv.org/abs/2508.13966 https://arxiv.org/pdf/2508.13966

Market Viability and Completeness for Multinomial Models
We study a generalization of the classical binomial model that consists in allowing any finite number of branches in each node of the tree representation. In this model, we show that the two fundamental theorems of asset pricing have a geometric interpretation and, using this, we give necessary and sufficient conditions for a market to be arbitrage-free and complete. We also present an algorithm for completing arbitrage-free markets in every possible way. We apply these results to the study of …

Load-Balanced Diffusion Monte Carlo Method with Lattice Regularization
Kousuke Nakano, Sandro Sorella, Michele Casula
https://arxiv.org/abs/2508.12033 https://

Load-Balanced Diffusion Monte Carlo Method with Lattice Regularization
Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schrödinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of $N_w$ walkers, making them well suited to large-scale high-performance computing. Among the QMC techniques, Diffusion Monte Carlo (DMC) is widely regarded as the most reliable, since it provides the projection onto the ground state of a given Hamiltonian under the fixed-node approxima…

Latency-Optimal File Assignment in Geo-Distributed Storage with Preferential Demands
Srivathsa Acharya, P. Vijay Kumar, Viveck R. Cadambe
https://arxiv.org/abs/2507.12830

Latency-Optimal File Assignment in Geo-Distributed Storage with Preferential Demands
We consider the problem of data storage in a geographically distributed (or geo-distributed) network of servers (or nodes) where inter-node communication incurs certain round-trip delays. Every node serves a set of users who can request any file in the network. If the requested file is not available at the node, it communicates with other nodes to obtain the file, thus causing the user to experience latency in obtaining the file. The files can be placed uncoded, where each node stores exact cop…

Empirically-Calibrated H100 Node Power Models for Reducing Uncertainty in AI Training Energy Estimation
Alex C. Newkirk, Jared Fernandez, Jonathan Koomey, Imran Latif, Emma Strubell, Arman Shehabi, Constantine Samaras
https://arxiv.org/abs/2506.14551

Empirically-Calibrated H100 Node Power Models for Reducing Uncertainty in AI Training Energy Estimation
As AI's energy demand continues to grow, it is critical to enhance the understanding of characteristics of this demand, to improve grid infrastructure planning and environmental assessment. By combining empirical measurements from Brookhaven National Laboratory during AI training on 8-GPU H100 systems with open-source benchmarking data, we develop statistical models relating computational intensity to node-level power consumption. We measure the gap between manufacturer-rated thermal design pow…

Multipartite Mixed-Species Entanglement over a Quantum Network
D. Main, P. Drmota, E. M. Ainley, A. Agrawal, D. Webb, S. Saner, O. Bazavan, B. C. Nichol, R. Srinivas, D. P. Nadlinger, G. Araneda, D. M. Lucas
https://arxiv.org/abs/2506.14334

Multipartite Mixed-Species Entanglement over a Quantum Network
We generate multipartite entangled states of two, three and four matter qubits, where the entanglement is distributed over macroscopic distances via a photonic network link. Trapped-ion ${}^{88}\text{Sr}^+$ qubits are entangled directly via the optical fibre link, and the entanglement is subsequently extended to ${}^{43}\text{Ca}^+$ memory qubits co-trapped in each network node, using local mixed-species logic gates. We create remotely entangled $\text{Sr}^+$-$\text{Ca}^+$ and $\text{Ca}^+$-$\t…

Attractor Stability of Boolean networks under noise
Byungjoon Min, Jeehye Choi, Reinhard Laubenbacher
https://arxiv.org/abs/2506.15581 https://

Attractor Stability of Boolean networks under noise
We study the impact of noise on attractor dynamics in Boolean networks, focusing on their stability and transition behaviors. By constructing attractor matrices based on single-node perturbations, we propose a framework to quantify attractor stability and identify dominant attractors. We find that attractors are more stable than predicted by basin sizes, showing the importance of dynamical structure in noisy environments. In addition, under global perturbations, basin sizes dictate long-term be…

lkml_thread: Linux kernel mailing list
A bipartite network of contributions by users to threads on the Linux kernel mailing list. A left node is a person, and a right node is a thread, and each timestamped edge (i,j,t) denotes that user i contributed to thread j at time t. The date of the snapshot is not given.
This network has 379554 nodes and 1565683 edges.
Tags: Social, Communication, Unweighted, Timestamps

Replaced article(s) found for q-bio.NC. https://arxiv.org/list/q-bio.NC/new
[1/1]:
- Effective Stimulus Propagation in Neural Circuits: Driver Node Selection
Bulat Batuev, Arsenii Onuchin, Sergey Sukhov

So thankful to the *excellent* work that @… has done with Node.js!
Especially this: https://floss.social/@webhackfest/114699260646396693

Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities
Chenyuan Jia, Dongxu Chang, Ruiyuan Wang, Guanghui Wang, Guiying Yan, Cunquan Qu
https://arxiv.org/abs/2506.13507

Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities
In this study, a new scheduling strategies for low-density parity-check (LDPC) codes under layered belief propagation (LBP) is designed. Based on the criteria of prioritizing the update of check nodes with lower error probabilities, we propose two dynamic scheduling methods: dynamic error belief propagation (Dyn-EBP) and dynamic penalty error belief propagation (Dyn-PEBP). In Dyn-EBP, each check node is restricted from being updated the same number of times, whereas Dyn-PEBP removes this restri…

🥳 New Kitten Release
Housekeeping:
• Updated runtime version to Node version 22.18.0 (latest LTS).
• Removed `--experimental-global-customevent` in node launch command (as `CustomEvent` is no longer behing the CLI flag since Node v19.0.0)
• Renamed `--experimental-loader` flag to `--loader` as the experimental prefix is no longer required.
…

A novel approach for converting spatio-temporal series into complex networks
G. Cigdem Yalcin, M. Berk Onder
https://arxiv.org/abs/2506.14378 https://

A novel approach for converting spatio-temporal series into complex networks
This study aims to offer a new perspective on complex network representation of real-world systems. Currently, the most well-known transformation algorithms in the literature treat each data point in a time series as a node and transform the time series into a network. In this study, we present a new approach converting spatio-temporal series into a complex network. We focus on studying this transformation by grounding it in the context of physics , with the aim of adapting it to real-world pro…

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos
https://arxiv.org/abs/2506.12828

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
In $\textit{total domination}$, given a graph $G=(V,E)$, we seek a minimum-size set of nodes $S\subseteq V$, such that every node in $V$ has at least one neighbor in $S$. We define a $\textit{fault-tolerant}$ version of total domination, where we require any node in $V \setminus S$ to have at least $m$ neighbors in $S$. Let $Δ$ denote the maximum degree in $G$. We prove a first $1 + \ln(Δ+ m - 1)$ approximation for fault-tolerant total domination. We also consider fault-tolerant variants of t…

This is the #Garbce stop on railway line 271 (Poznań — Wrocław), renovated a few years ago.
The platforms end a dozen metres from the railway crossing. However, there is no walkway from the platforms to the crossing; probably because it would need to cross a tiny stream. Instead, a 100 m long walkways have been added to the other end of the platforms, with a tunnel joining the platforms and access to a side road in the town. To reach the railway crossing, you have to walk 700 m.
Ironically, even in the general drought the tunnel manages to feature puddles of ground water. Also including the photo of a platform roofing with weird orange marks.
#rail

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

Realization and characterization of an all-bands-flat electronic lattice
Noah Lape, Simon Diubenkov, L. Q. English, P. G. Kevrekidis, Alexei Andreanov, Yeongjun Kim, Sergej Flach
https://arxiv.org/abs/2508.13571

Realization and characterization of an all-bands-flat electronic lattice
We construct an electronic all-bands-flat (ABF) lattice and experimentally generate compact localized states (CLSs) therein. The lattice is a diamond (rhombic) chain and implemented as a network of capacitors and inductors, as well as voltage inverters (using operational amplifiers) in order to introduce a \(π\)-phase flux within each diamond. The network's normal modes split into three flat bands, and the corresponding CLSs can be excited in isolation via a two-node driving at the flat band f…

CRAFT: Latency and Cost-Aware Genetic-Based Framework for Node Placement in Edge-Fog Environments
Soheil Mahdizadeh, Amir Mahdi Rasouli, Mohammad Pourashory, Sadra Galavani, Mohsen Ansari
https://arxiv.org/abs/2507.12445

CRAFT: Latency and Cost-Aware Genetic-Based Framework for Node Placement in Edge-Fog Environments
Reducing latency in the Internet of Things (IoT) is a critical concern. While cloud computing facilitates communication, it falls short of meeting real-time requirements reliably. Edge and fog computing have emerged as viable solutions by positioning computing nodes closer to end users, offering lower latency and increased processing power. An edge-fog framework comprises various components, including edge and fog nodes, whose strategic placement is crucial as it directly impacts latency and sy…

New allocation rule based on graph structures and their application to economic phenomena
Taiki Yamada, Taisuke Matsubae, Tomoya Akamatsu
https://arxiv.org/abs/2507.11808

New allocation rule based on graph structures and their application to economic phenomena
This study introduces the \emph{edge-based Shapley value}, a novel allocation rule within cooperative game theory, specifically tailored for networked systems, where value is generated through interactions represented by edges. Traditional allocation rules, such as the Shapley and Myerson values, evaluate player contributions based on node-level characteristics, or connected components. However, these approaches often fail to adequately capture the functional role of edges, which are crucial in…

Scaling Up without Fading Out: Goal-Aware Sparse GNN for RL-based Generalized Planning
Sangwoo Jeon, Juchul Shin, Gyeong-Tae Kim, YeonJe Cho, Seongwoo Kim
https://arxiv.org/abs/2508.10747

Scaling Up without Fading Out: Goal-Aware Sparse GNN for RL-based Generalized Planning
Generalized planning using deep reinforcement learning (RL) combined with graph neural networks (GNNs) has shown promising results in various symbolic planning domains described by PDDL. However, existing approaches typically represent planning states as fully connected graphs, leading to a combinatorial explosion in edge information and substantial sparsity as problem scales grow, especially evident in large grid-based environments. This dense representation results in diluted node-level infor…

Scala.js
#scala

Heat Kernel Goes Topological
Maximilian Krahn, Vikas Garg
https://arxiv.org/abs/2507.12380 https://arxiv.org/pdf/2507.12380

Heat Kernel Goes Topological
Topological neural networks have emerged as powerful successors of graph neural networks. However, they typically involve higher-order message passing, which incurs significant computational expense. We circumvent this issue with a novel topological framework that introduces a Laplacian operator on combinatorial complexes (CCs), enabling efficient computation of heat kernels that serve as node descriptors. Our approach captures multiscale information and enables permutation-equivariant represen…

DAGs for the Masses
Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, Petr Kuznetsov
https://arxiv.org/abs/2506.13998 https://…

DAGs for the Masses
A recent approach to building consensus protocols on top of Directed Acyclic Graphs (DAGs) shows much promise due to its simplicity and stable throughput. However, as each node in the DAG typically includes a linear number of references to the nodes in the previous round, prior DAG protocols only scale up to a certain point when the overhead of maintaining the graph becomes the bottleneck. To enable large-scale deployments of DAG-based protocols, we propose a sparse DAG architecture, where ea…

Predicting the response of structurally altered and asymmetrical networks
Melvyn Tyloo
https://arxiv.org/abs/2506.14609 https://arxiv…

Predicting the response of structurally altered and asymmetrical networks
We investigate how the response of coupled dynamical systems is modified due to a structural alteration of the interaction. The majority of the literature focuses on additive perturbations and symmetrical interaction networks. Here, we consider the challenging problem of multiplicative perturbations and asymmetrical interaction coupling. We introduce a framework to approximate the averaged response at each network node for general structural perturbations, including non-normal and asymmetrical …

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

Identification of Authoritative Nodes and Dismantling of Illicit Networks Using a Novel Metric for Measuring Strength of a Graph
Kartikeya Kansal, Arunabha Sen
https://arxiv.org/abs/2507.12711

Identification of Authoritative Nodes and Dismantling of Illicit Networks Using a Novel Metric for Measuring Strength of a Graph
Dismantling criminal networks or containing epidemics or misinformation through node removal is a well-studied problem. To evaluate the effectiveness of such efforts, one must measure the strength of the network before and after node removal. Process P1 is considered more effective than P2 if the strength of the residual network after removing k nodes via P1 is smaller than that from P2. This leads to the central question: How should network strength be measured? Existing metrics rely solely …

Choreographic Quick Changes: First-Class Location (Set) Polymorphism
Ashley Samuelson, Andrew K. Hirsch, Ethan Cecchetti
https://arxiv.org/abs/2506.10913 h…

Choreographic Quick Changes: First-Class Location (Set) Polymorphism
Choreographic programming is a promising new paradigm for programming concurrent systems where a developer writes a single centralized program that compiles to individual programs for each node. Existing choreographic languages, however, lack critical features integral to modern systems, like the ability of one node to dynamically compute who should perform a computation and send that decision to others. This work addresses this gap with $λ_{QC}$, the first typed choreographic language with \e…

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

Freie 3D-Software Blender 4.5: visuell programmieren und effizient rendern
Das 3D-Programm Blender 4.5 ist erschienen. Es bringt Langzeitunterstützung bis 2027, verbesserte Node-Bedienung und soll effizienter rendern als der Vorgänger.

Oto przystanek osobowy #Garbce na linii kolejowej 271 (Poznań — Wrocław), wyremontowana parę lat temu.
Jak widać, perony kończą się kilkanaście metrów przed przejazdem kolejowym. Jednak zdecydowano, by nie prowadzić chodnika do tego przejazdu — najpewniej ze względu na ten tyci strumyk. Zamiast tego, na drugim końcu peronu poprowadzono stumetrowy chodnik, który prowadzi do tunelu łączącego peron…

Do Conversational Interfaces Limit Creativity? Exploring Visual Graph Systems for Creative Writing
Abhinav Sood, Maria Teresa Llano, Jon McCormack
https://arxiv.org/abs/2507.08260

Do Conversational Interfaces Limit Creativity? Exploring Visual Graph Systems for Creative Writing
We present a graphical, node-based system through which users can visually chain generative AI models for creative tasks. Research in the area of chaining LLMs has found that while chaining provides transparency, controllability and guardrails to approach certain tasks, chaining with pre-defined LLM steps prevents free exploration. Using cognitive processes from creativity research as a basis, we create a system that addresses the inherent constraints of chat-based AI interactions. Specifically…

A Novel Thermal Network Model and Electro-Thermal Coupling Study for NSFETs and CFETs Considering Thermal Crosstalk
Tianci Miao, Qihang Zheng, Yangyang Hu, Xiaoyu Cheng, Jie Liang, Liang Chen, Aiying Guo, Jingjing Liu, Kailin Ren, Jianhua Zhang
https://arxiv.org/abs/2506.12264

A Novel Thermal Network Model and Electro-Thermal Coupling Study for NSFETs and CFETs Considering Thermal Crosstalk
As the technology node continues to shrink, nanosheet field effect transistors (NSFETs) and complementary FETs (CFETs) become valid candidates for the 3nm and sub-nanometre nodes. However, due to the shrinking device size, self-heating and inter-device thermal crosstalk of NSFETs and CFETs become more severe. It is important to accurately calculate the self-heating and thermal crosstalk of devices and to study the electrical and thermal characteristics of logic gates, etc. In this work, a therm…

Wer auf der #froscon hat einen #meshtastic Node dabei?

Developing and evaluating quilts for the depiction of large layered graphs
Juhee Bae, Benjamin Watson
https://arxiv.org/abs/2507.10883 https://

Developing and evaluating quilts for the depiction of large layered graphs
Traditional layered graph depictions such as flow charts are in wide use. Yet as graphs grow more complex, these depictions can become difficult to understand. Quilts are matrix-based depictions for layered graphs designed to address this problem. In this research, we first improve Quilts by developing three design alternatives, and then compare the best of these alternatives to better-known node-link and matrix depictions. A primary weakness in Quilts is their depiction of skip links, links th…

Effective Stimulus Propagation in Neural Circuits: Driver Node Selection
Bulat Batuev, Arsenii Onuchin, Sergey Sukhov
https://arxiv.org/abs/2506.13615 http…

Effective Stimulus Propagation in Neural Circuits: Driver Node Selection
Precise control of signal propagation in modular neural networks represents a fundamental challenge in computational neuroscience. We establish a framework for identifying optimal control nodes that maximize stimulus transmission between weakly coupled neural populations. Using spiking stochastic block model networks, we systematically compare driver node selection strategies - including random sampling and topology-based centrality measures (degree, betweenness, closeness, eigenvector, harmoni…

Collaborative Beamforming for Communication Applications Using a Two-Element Fully-Wireless Open-Loop Coherent Distributed Array
Jason M. Merlo, Jeffrey A. Nanzer
https://arxiv.org/abs/2506.13014

Collaborative Beamforming for Communication Applications Using a Two-Element Fully-Wireless Open-Loop Coherent Distributed Array
In this work we demonstrate a proof of concept of a fully-wireless two-node open-loop coherent distributed communication system and evaluate its performance by transmitting QPSK , 64-, and 256-QAM constellations at a symbol rate of 2 MBd over a 58 m link in an urban environment. The system is implemented in a distributed manner with on-node processing using software-defined radios (SDRs) and wireless internode communication to share coordination information and does not rely on external time or…

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

On the error correction of iterative bounded distance decoding of generalized LDPC codes
David Burshtein
https://arxiv.org/abs/2507.12073 https://

On the error correction of iterative bounded distance decoding of generalized LDPC codes
Consider an ensemble of regular generalized LDPC (GLDPC) codes and assume that the same component code is associated with each parity check node. To decode a GLDPC code from the ensemble, we use the bit flipping bounded distance decoding algorithm, which is an extension of the bit flipping algorithm for LDPC codes. Previous work has shown conditions, under which, for a typical code in the ensemble with blocklength sufficiently large, a positive constant fraction of worst case errors can be corr…

Hybrid Fiber-Free-Space Entanglement Distribution Using Off-the-Shelf Quantum Devices
Gustavo C. Amaral, Nienke M. ten Haaf, Breno Perlingeiro, David L. Bakker, Mark G. M. Boekel, Tim E. van Duivenbode, Karthik Selvan, Nicolas Oidtmann, Rafael Ochsendorf, Rick N. M. Wasserman, Mael Flament, Felipe Giraldo, Shane Andrewski, Mehdi Namazi, Federica Facchin, Mario Casta\~neda, Fokko de Vries, Sayali Shevate, Shaurya Bhave, Marco Gorter, Nico Coesel, David Mytling, Mike Mabry, Carlo Page, A…

Hybrid Fiber-Free-Space Entanglement Distribution Using Off-the-Shelf Quantum Devices
Entanglement serves as a fundamental resource for quantum technologies, enabling communication and computation tasks that surpass classical limits. Its distribution across networks is essential for interconnecting quantum processors, enabling distributed quantum computing to address complex challenges in areas such as drug discovery, material science, and optimization. In this work, we report the successful distribution of polarization-entangled photon pairs across a campus-scale, three-node qu…

Can LLMs Find Fraudsters? Multi-level LLM Enhanced Graph Fraud Detection
Tairan Huang, Yili Wang
https://arxiv.org/abs/2507.11997 https://

Can LLMs Find Fraudsters? Multi-level LLM Enhanced Graph Fraud Detection
Graph fraud detection has garnered significant attention as Graph Neural Networks (GNNs) have proven effective in modeling complex relationships within multimodal data. However, existing graph fraud detection methods typically use preprocessed node embeddings and predefined graph structures to reveal fraudsters, which ignore the rich semantic cues contained in raw textual information. Although Large Language Models (LLMs) exhibit powerful capabilities in processing textual information, it remai…

Towards Energy-Efficient Distributed Agreement
Hugo Mirault, Peter Robinson
https://arxiv.org/abs/2506.12282 https://arxiv.org/pdf/25…

Towards Energy-Efficient Distributed Agreement
We study fault-tolerant consensus in a variant of the synchronous message passing model, where, in each round, every node can choose to be awake or asleep. This is known as the sleeping model (Chatterjee, Gmyr, Pandurangan PODC 2020) and defines the awake complexity (also called \emph{energy complexity}), which measures the maximum number of rounds that any node is awake throughout the execution. Only awake nodes can send and receive messages in a given round and all messages sent to sleeping n…

Voltage Stability of Inverter-Based Systems: Impact of Parameters and Irrelevance of Line Dynamics
Sushobhan Chatterjee, Sijia Geng
https://arxiv.org/abs/2506.13341

Voltage Stability of Inverter-Based Systems: Impact of Parameters and Irrelevance of Line Dynamics
This paper investigates voltage stability in inverter-based power systems concerning fold and saddle-node bifurcations. An analytical expression is derived for the sensitivity of the stability margin using the normal vector to the bifurcation hypersurface. Such information enables efficient identification of effective control parameters in mitigating voltage instability. Comprehensive analysis reveals that reactive loading setpoint and current controller's feedforward gain are the most influent…

Crypto-Assisted Graph Degree Sequence Release under Local Differential Privacy
Xiaojian Zhang, Junqing Wang, Kerui Chen, Peiyuan Zhao, Huiyuan Bai
https://arxiv.org/abs/2507.10627

Crypto-Assisted Graph Degree Sequence Release under Local Differential Privacy
Given a graph $G$ defined in a domain $\mathcal{G}$, we investigate locally differentially private mechanisms to release a degree sequence on $\mathcal{G}$ that accurately approximates the actual degree distribution. Existing solutions for this problem mostly use graph projection techniques based on edge deletion process, using a threshold parameter $θ$ to bound node degrees. However, this approach presents a fundamental trade-off in threshold parameter selection. While large $θ$ values intro…

Delay-optimal Congestion-aware Routing and Computation Offloading in Arbitrary Network
Jinkun Zhang, Yuezhou Liu, Edmund Yeh
https://arxiv.org/abs/2506.13626

Delay-optimal Congestion-aware Routing and Computation Offloading in Arbitrary Network
Emerging edge computing paradigms enable heterogeneous devices to collaborate on complex computation applications. However, for arbitrary heterogeneous edge networks, delay-optimal forwarding and computation offloading remains an open problem. In this paper, we jointly optimize data/result routing and computation placement in arbitrary networks with heterogeneous node capabilities, and congestion-dependent nonlinear transmission and processing delay. Despite the non-convexity of the formulated …

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
Sander Borst, Moritz Venzin
https://arxiv.org/abs/2507.08698 https://

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
We study the rent-or-buy variant of the online Steiner forest problem on node- and edge-weighted graphs. For $n$-node graphs with at most $\bar{n}$ non-zero node-weights, and at most $\tilde{k}$ different arriving terminal pairs, we obtain a deterministic, $O(\log n \log \bar{n})$-competitive algorithm. This improves on the previous best, $O(\log^4 n)$-competitive algorithm obtained by the black-box reduction from (Bartal et al. 2021) combined with the previously best deterministic algorithms f…

Performance Analysis of Communication Signals for Localization in Underwater Sensor Networks
Ashwani Koul, Gustaf Hendeby, Isaac Skog
https://arxiv.org/abs/2506.13330

Performance Analysis of Communication Signals for Localization in Underwater Sensor Networks
Fusion of passive and active measurements from sensor nodes becomes critical in localizing underwater objects and is traditionally achieved by communicating information to a central node. This causes significant inefficiencies in bandwidth, energy, and processing time, which are critical in marine applications. With integrated sensing and communication (ISAC) systems, the process of sensing, localization, and communication can be achieved jointly, and the inefficiencies can be minimized. Thus, …

Distinguishing features of longitudinal magnetoconductivity for a Rarita-Schwinger-Weyl node
Ipsita Mandal
https://arxiv.org/abs/2506.12380 https://…

Distinguishing features of longitudinal magnetoconductivity for a Rarita-Schwinger-Weyl node
The band-degeneracy points in the Brillouin zones of chiral crystals exist in multiple avatars, with the high-symmetry points being able to host multifold nodes of distinct characters. A class of such crystals, assisted by the spin-orbit coupling, harbours fourfold degeneracy in the form of Rarita-Schwinger-Weyl node (RSWN) at the $Γ$-point. Our aim is to explore the nature of longitudinal magnetoconductivity, arising from applying collinear electric and magnetic fields, for such systems. Adju…

Distributed Algorithms for Potential Problems
Alkida Balliu, Thomas Boudier, Francesco d'Amore, Dennis Olivetti, Gustav Schmid, Jukka Suomela
https://arxiv.org/abs/2507.12038 …

Distributed Algorithms for Potential Problems
In this work we present a fast distributed algorithm for local potential problems: these are graph problems where the task is to find a locally optimal solution where no node can unilaterally improve the utility in its local neighborhood by changing its own label. A simple example of such a problem is the task of finding a locally optimal cut, i.e., a cut where for each node at least half of its incident edges are cut edges. The distributed round complexity of locally optimal cut has been wide …

A review of perfect quantum state transfer, from one to two and three dimensional arrays of qubits
Marzieh Asoudeh, Vahid Karimipour
https://arxiv.org/abs/2507.11016

A review of perfect quantum state transfer, from one to two and three dimensional arrays of qubits
In the light of recent advances in fabricating single layer quantum chips and a possible road toward development of multi-layer quantum chips, we review, in a detailed way, the subject of quantum state transfer with particular emphasis on perfect quantum state transfer in two and three dimensional lattices. We show how one can route an unknown quantum state from one node in a single layer of a quantum chip to another one on another layer with unit fidelity. Our method of presentation in this …

wordnet: WordNet relationships
A network of English words from the WordNet. Node is a word, and edge denotes relationships between words (synonymy, hyperonymy, meronymy, etc.). The date at which this network was extracted from WordNet is not unknown.
This network has 146005 nodes and 656999 edges.
Tags: Informational, Language, Unweighted
htt…

Optimal Honeypot Ratio and Convergent Fictitious-Play Learning in Signaling Games for CPS Defense
Yueyue Xu, Yuewei Chen, Lin Wang, Zhaoyang Cheng, Xiaoming Hu
https://arxiv.org/abs/2507.11113

Optimal Honeypot Ratio and Convergent Fictitious-Play Learning in Signaling Games for CPS Defense
Cyber-Physical Systems (CPSs) are facing a fast-growing wave of attacks. To achieve effective proactive defense, this paper models honeypot deployment as a gamma-fixed signaling game in which node liveness serves as the only signal and normal-node signal gamma is exogenously fixed. We define the gamma-perfect Bayesian-Nash equilibrium (gamma-PBNE). Analytical expressions are obtained for all gamma-PBNEs, revealing three distinct equilibrium regimes that depend on the priori honeypot ratio. Furt…

Enhancing Fairness in Autoencoders for Node-Level Graph Anomaly Detection
Shouju Wang, Yuchen Song, Sheng'en Li, Dongmian Zou
https://arxiv.org/abs/2508.10785 https://

Enhancing Fairness in Autoencoders for Node-Level Graph Anomaly Detection
Graph anomaly detection (GAD) has become an increasingly important task across various domains. With the rapid development of graph neural networks (GNNs), GAD methods have achieved significant performance improvements. However, fairness considerations in GAD remain largely underexplored. Indeed, GNN-based GAD models can inherit and amplify biases present in training data, potentially leading to unfair outcomes. While existing efforts have focused on developing fair GNNs, most approaches target…

digg_reply: Digg reply network (2008)
Network of replies among users of digg.com. Each node in the network is a digg user, and each directed edge indicates that user i replied to user j.
This network has 30398 nodes and 87627 edges.
Tags: Social, Online, Unweighted, Multigraph
https://networks.skewed.de/net/di…

NetMoniAI: An Agentic AI Framework for Network Security & Monitoring
Pallavi Zambare, Venkata Nikhil Thanikella, Nikhil Padmanabh Kottur, Sree Akhil Akula, Ying Liu
https://arxiv.org/abs/2508.10052

NetMoniAI: An Agentic AI Framework for Network Security & Monitoring
In this paper, we present NetMoniAI, an agentic AI framework for automatic network monitoring and security that integrates decentralized analysis with lightweight centralized coordination. The framework consists of two layers: autonomous micro-agents at each node perform local traffic analysis and anomaly detection. A central controller then aggregates insights across nodes to detect coordinated attacks and maintain system-wide situational awareness. We evaluated NetMoniAI on a local micro-test…

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
https://arxiv.org/abs/2507.11257 http…

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
We study the $k$-edge connectivity problem on undirected graphs in the distributed sketching model, where we have $n$ nodes and a referee. Each node sends a single message to the referee based on its 1-hop neighborhood in the graph, and the referee must decide whether the graph is $k$-edge connected by taking into account the received messages. We present the first lower bound for deciding a graph connectivity problem in this model with a deterministic algorithm. Concretely, we show that the …

Versatile Wavelength-Division Multiplexed Quantum Key Distribution Network Operating Simultaneously in the O and C Bands
Davide Scalcon, Matteo Padovan, Paolo Villoresi, Giuseppe Vallone, Marco Avesani
https://arxiv.org/abs/2507.11175

Versatile Wavelength-Division Multiplexed Quantum Key Distribution Network Operating Simultaneously in the O and C Bands
Ongoing technological progress is accelerating the commercial and global-scale deployment of Quantum Key Distribution (QKD). Its ability to enable unconditionally secure communication is expected to be a key feature of future telecommunication networks, and practical demonstrations of QKD network implementations in real-world environments are crucial for ensuring reliable adoption. In this work, we demonstrate a four-node photonic QKD network that employs versatile and cost-effective wavelength…

bible_nouns: Bible noun phrases
A network of noun phrases (places and names) in the King James Version of the Bible. Each node is a noun phrase, and an edge exists if the noun phrases co-occur in a Bible verse. Edge weight denotes how often the two words co-occur.
This network has 1773 nodes and 9131 edges.
Tags: Informational, Language, Weighted

Minimum-hop Constellation Design for Low Earth Orbit Satellite Networks
Chirag Rao, Eytan Modiano
https://arxiv.org/abs/2506.11995 https://

Minimum-hop Constellation Design for Low Earth Orbit Satellite Networks
We consider a Low Earth Orbit (LEO) satellite network with each satellite capable of establishing inter-satellite link (ISL) connections for satellite-to-satellite communication. Since ISLs can be reoriented to change the topology, we optimize the topology to minimize the average shortest path length (ASPL). We characterize the optimal ASPL ISL topology in two families of topologies, 1) vertex-symmetric in which the ISL connections at a satellite node represent a motif that is repeated at all o…

contiguous_usa: Contiguous states (USA)
A network of contiguous states in the USA, in which each state is a node and two nodes are connected if they share a land-based geographic border. The dataset includes the lower 48 states, and the District of Columbia.
This network has 49 nodes and 107 edges.
Tags: Transportation, Roads, Unweighted

FAFO: Over 1 million TPS on a single node running EVM while still Merkleizing every block
Ryan Zarick, Isaac Zhang, Daniel Wong, Thomas Kim, Bryan Pellegrino, Mignon Li, Kelvin Wong
https://arxiv.org/abs/2507.10757

FAFO: Over 1 million TPS on a single node running EVM while still Merkleizing every block
Current blockchain execution throughput is limited by data contention, reducing execution layer parallelism. Fast Ahead-of-Formation Optimization (FAFO) is the first blockchain transaction scheduler to address this problem by reordering transactions before block formation for maximum concurrency. FAFO uses CPU-optimized cache-friendly Bloom filters to efficiently detect conflicts and schedule parallel transaction execution at high throughput and low overhead. We integrate the Rust EVM client …

petster: Pet owner social networks (2016)
A network of friendships among users on catster.com and dogster.com. Node represents a user, and edge exists if two users self-identify as friends on either website. The dogster/catster network also contains family links between dog and dog, cat and cat, as well as dog and cat.
This network has 623766 nodes and 15699276 edges.
Tags: Social, Online, Unweighted

petster: Pet owner social networks (2016)
A network of friendships among users on catster.com and dogster.com. Node represents a user, and edge exists if two users self-identify as friends on either website. The dogster/catster network also contains family links between dog and dog, cat and cat, as well as dog and cat.
This network has 623766 nodes and 15699276 edges.
Tags: Social, Online, Unweighted

The Throughput Gain of Hypercycle-level Resource Reservation for Time-Triggered Ethernet
Peng Wang, Suman Sourav, Binbin Chen, Hongyan Li, Feng Wang, Fan Zhang
https://arxiv.org/abs/2506.11745

The Throughput Gain of Hypercycle-level Resource Reservation for Time-Triggered Ethernet
Time-Triggered Communication is a key technology for many safety-critical systems, with applications spanning the areas of aerospace and industrial control. Such communication relies on time-triggered flows, with each flow consisting of periodic packets originating from a source and destined for a destination node. Each packet needs to reach its destination before its deadline. Different flows can have different cycle lengths. To achieve assured transmission of time-triggered flows, existing ef…

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://netwo…

bible_nouns: Bible noun phrases
A network of noun phrases (places and names) in the King James Version of the Bible. Each node is a noun phrase, and an edge exists if the noun phrases co-occur in a Bible verse. Edge weight denotes how often the two words co-occur.
This network has 1773 nodes and 9131 edges.
Tags: Informational, Language, Weighted

word_assoc: Edinburgh word associations
A network of word associations showing the count of such associations as collected from subjects, from the Edinburgh Associative Thesaurus (EAT). Each node represents a word, and a directed edge (i, j) denotes that word i was used as a stimulus to which word j was given as a response. Multiple edges are allowed.
This network has 23132 nodes and 312342 edges.
Tags: Informational, Language, Unweighted, Multigraph

ego_social: Ego networks in social media (2012)
Ego networks associated with a set of accounts of three social media platforms (Facebook, Google , and Twitter). Datasets include node features (profile metadata), circles, and ego networks, and were crawled from public sources in 2012.
This network has 1079 nodes and 46234 edges.
Tags: Social, Online, Unweighted, Metadata

Bi-Contextuality: A Novel Non-Classical Phenomenon in Bipartite Quantum Systems
Gabriel Ruffolo, Nigel Benjamin Lee Junsheng, Kim Mu Young, Dzmitry Matsukevich, Rafael Rabelo, Dagomir Kaszlikowski, Pawe{\l} Kurzy\'nski
https://arxiv.org/abs/2507.08461

Bi-Contextuality: A Novel Non-Classical Phenomenon in Bipartite Quantum Systems
We present and experimentally demonstrate a novel non-classical phenomenon, bi-contextuality, observed in quantum systems prepared by two independent sources. This discovery plays a key role in the developing framework of network nonlocality, offering a new method for confirming the quantum nature of measurements within a single network node. Bi-contextuality acts as a reversed Bell scenario: while Bell scenarios involve splitting a system for independent measurements, our approach combines sys…

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://netwo…

swingers: Swingers and parties (2013)
A bipartite sexual affiliation network representing “swing unit” couples (one node per couple) and the parties they attended.
This network has 96 nodes and 232 edges.
Tags: Social, Offline, Unweighted
https://networks.skewed.de/net/swingers

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://netwo…

foodweb_baywet: Florida cypress wetlands food web (1998)
Networks of carbon exchanges among species in the cypress wetlands of South Florida. One network covers the wet and the other the dry season. Each node represents a taxon (similar to a species), and a directed edge indicates that one taxon uses another as food.
This network has 128 nodes and 2106 edges.
Tags: Biological, Food web, Weighted

scotus_majority: SCOTUS majority opinions
Network of legal citations among majority opinions written by the Supreme Court of the United States (SCOTUS), from 1754-2002 (2008 version) and 1792-2006 (2007 version). In addition to the citation network, node metadata is included giving some description of each opinion.
This network has 25417 nodes and 216738 edges.
Tags: Informational, Legal, Unweighted, Metadata, Temporal

scotus_majority: SCOTUS majority opinions
Network of legal citations among majority opinions written by the Supreme Court of the United States (SCOTUS), from 1754-2002 (2008 version) and 1792-2006 (2007 version). In addition to the citation network, node metadata is included giving some description of each opinion.
This network has 34613 nodes and 202167 edges.
Tags: Informational, Legal, Unweighted, Metadata, Temporal

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

swingers: Swingers and parties (2013)
A bipartite sexual affiliation network representing “swing unit” couples (one node per couple) and the parties they attended.
This network has 96 nodes and 232 edges.
Tags: Social, Offline, Unweighted
https://networks.skewed.de/net/swingers

contiguous_usa: Contiguous states (USA)
A network of contiguous states in the USA, in which each state is a node and two nodes are connected if they share a land-based geographic border. The dataset includes the lower 48 states, and the District of Columbia.
This network has 49 nodes and 107 edges.
Tags: Transportation, Roads, Unweighted

bible_nouns: Bible noun phrases
A network of noun phrases (places and names) in the King James Version of the Bible. Each node is a noun phrase, and an edge exists if the noun phrases co-occur in a Bible verse. Edge weight denotes how often the two words co-occur.
This network has 1773 nodes and 9131 edges.
Tags: Informational, Language, Weighted

word_assoc: Edinburgh word associations
A network of word associations showing the count of such associations as collected from subjects, from the Edinburgh Associative Thesaurus (EAT). Each node represents a word, and a directed edge (i, j) denotes that word i was used as a stimulus to which word j was given as a response. Multiple edges are allowed.
This network has 23132 nodes and 312342 edges.
Tags: Informational, Language, Unweighted, Multigraph

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

7th_graders: Vickers 7th Graders (1981)
A small multiplex network of friendships among 29 seventh grade students in Victoria, Australia. Students nominated classmates for three different activities (who do you get on with in the class, who are your best friends, and who would you prefer to work with). Edge direction for each of these three types of edges indicates if node i nominated node j, and the edge weight gives the frequency of this nomination. Students 1-12 are boys and 13-29 ar…