Tootfinder

soc_net_comms: Networks with group metadata
Snapshots of LiveJournal, Friendster, Orkut, and YouTube online social networks, as well as DBLP and Amazon. Node metadata represents a post hoc definition of a 'community' that a node belongs to, derived from topical labels of the node or interest-based 'groups' that a node links to.
This network has 317080 nodes and 1049866 edges.
Tags: Online, Social, Collaboration, Informational, Relatedness, Unweighted, Metada…

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

In our last #ISE2025 lecture last week, we were discussing what makes a node "important" in a knowledge graph. A simple heuristics can be borrowed from graph theory or communication theory: Degree Centrality
Interestingly, in Wikidata In-degree centrality states Jane Austen to be to most "important" female author, while Out-degree centrality claims J.K. Rowling as being…

We launched our product at work this week!
I don't usually post the marketingese, but I'm really proud of a lot of the work we've done and I really think our core technology is pretty cool.
Spice Labs is live. We’ve launched our Surveyor and Topographer products; available now at https://spicelabs.io.
Spice Labs maps deployment artifacts and systems with cryptographic fingerprints, anchoring them to a continuously updated ten billion node OSS database and enrichment layers to drive confident, fact-based decisions.
With comprehensive maps of your stack, replace guesswork with hard data. This enables faster decisions, reduced risk, and measurable progress across projects.
A deeper dive from our founder and CEO, David Pollak is at: https://lnkd.in/eSt8hAyX

Improved Approximation for Broadcasting in k-cycle Graphs
Jeffrey Bringolf, Anne-Laure Ehresmann, Hovhannes A. Harutyunyan
https://arxiv.org/abs/2509.26426 https://

Improved Approximation for Broadcasting in k-cycle Graphs
Broadcasting is an information dissemination primitive where a message originates at a node (called the originator) and is passed to all other nodes in the network. Broadcasting research is motivated by efficient network design and determining the broadcast times of standard network topologies. Verifying the broadcast time of a node $v$ in an arbitrary network $G$ is known to be NP-hard. Additionally, recent findings show that the broadcast time problem is also NP-complete in general cactus gra…

Triangular neural synchronization patterns in visual impairment: A comprehensive case series exploring multi-node network dynamics and the Neural Triangle Index (NTI) https://www.

Triangular Neural Synchronization Patterns in Visual Impairment: A Comprehensive Case Series Exploring Multi-node Network Dynamics and the Neural Triangle Index
Background: Compensatory neural plasticity in visual impairment involves complex reorganization of multi-node networks that goes beyond conventional bilateral connection analysis. Triangular synchronization patterns, representing coordinated activity among three cortical sites simultaneously, remain unexplored despite their potential to reveal fundamental mechanisms underlying compensatory neuroplasticity. Objective: This study aimed to conduct a case series examining triangular neural synchro…

physician_trust: Physician trust network (1966)
A network of trust relationships among physicians in four midwestern (USA) cities in 1966. Edge direction indicates that node i trusts or asks for advice from node j. Each of the four components represent the network within a given city.
This network has 241 nodes and 1098 edges.
Tags: Social, Offline, Unweighted

My new #meshtastic node, solar powered in #Bonn, Germany.
Great to be part of a community which creates a meshed network for messages up to 200 characters which is independent of the Internet.
Thanks @…

Basic Cycle Ratio: Cost-Effective Ranking of Influential Spreaders from Local and Global Perspectives
Wenxin Zheng, Wenfeng Shi, Tianlong Fan, Linyuan Lv
https://arxiv.org/abs/2509.26220

Basic Cycle Ratio: Cost-Effective Ranking of Influential Spreaders from Local and Global Perspectives
Spreading processes are fundamental to complex networks. Identifying influential spreaders with dual local and global roles presents a crucial yet challenging task. To address this, our study proposes a novel method, the Basic Cycle Ratio (BCR), for assessing node importance. BCR leverages basic cycles and the cycle ratio to uniquely capture a node's local significance within its immediate neighborhood and its global role in maintaining network cohesion. We evaluated BCR on six diverse real-wor…

Equivariant Geometric Scattering Networks via Vector Diffusion Wavelets
David R. Johnson, Rishabh Anand, Smita Krishnaswamy, Michael Perlmutter
https://arxiv.org/abs/2510.01022 …

Equivariant Geometric Scattering Networks via Vector Diffusion Wavelets
We introduce a novel version of the geometric scattering transform for geometric graphs containing scalar and vector node features. This new scattering transform has desirable symmetries with respect to rigid-body roto-translations (i.e., $SE(3)$-equivariance) and may be incorporated into a geometric GNN framework. We empirically show that our equivariant scattering-based GNN achieves comparable performance to other equivariant message-passing-based GNNs at a fraction of the parameter count.

My Seeed Solar Node has been in the darkness of my basement now for two weeks - still 78% charge.
I think that one will go up on my roof.
And for my forest nodes, I should probably build some birdhouses :)
#meshtastic

Branching Out: Broadening AI Measurement and Evaluation with Measurement Trees
Craig Greenberg, Patrick Hall, Theodore Jensen, Kristen Greene, Razvan Amironesei
https://arxiv.org/abs/2509.26632

Branching Out: Broadening AI Measurement and Evaluation with Measurement Trees
This paper introduces \textit{measurement trees}, a novel class of metrics designed to combine various constructs into an interpretable multi-level representation of a measurand. Unlike conventional metrics that yield single values, vectors, surfaces, or categories, measurement trees produce a hierarchical directed graph in which each node summarizes its children through user-defined aggregation methods. In response to recent calls to expand the scope of AI system evaluation, measurement trees …

Type-Less yet Type-Aware Inductive Link Prediction with Pretrained Language Models
Alessandro De Bellis, Salvatore Bufi, Giovanni Servedio, Vito Walter Anelli, Tommaso Di Noia, Eugenio Di Sciascio
https://arxiv.org/abs/2509.26224

Type-Less yet Type-Aware Inductive Link Prediction with Pretrained Language Models
Inductive link prediction is emerging as a key paradigm for real-world knowledge graphs (KGs), where new entities frequently appear and models must generalize to them without retraining. Predicting links in a KG faces the challenge of guessing previously unseen entities by leveraging generalizable node features such as subgraph structure, type annotations, and ontological constraints. However, explicit type information is often lacking or incomplete. Even when available, type information in mos…

In our last #ISE2025 lecture last week, we were discussing what makes a node "important" in a knowledge graph. A simple heuristics can be borrowed from graph theory or communication theory: Degree Centrality
Interestingly, in Wikidata In-degree centrality states Jane Austen to be to most "important" female author, while Out-degree centrality claims J.K. Rowling as being…

Chambers and walls in spaces of real algebraic curves of small degrees
Victor Ivanovich Zvonilov
https://arxiv.org/abs/2510.00751 https://arxiv.org/pdf/251…

Chambers and walls in spaces of real algebraic curves of small degrees
This paper reviews known results on the rigid isotopy classification of plane curves of degree $m\leq6$ and curves of small degrees on quadrics. The paper's study completes the rigid isotopy classification of nonsingular real algebraic curves of bidegree (4,3) on a hyperboloid, begun by the author in earlier works. There are given previously missing proofs of the uniqueness of the connected components for 16 classes of real algebraic curves of bidegree (4,3) having a single node or a cusp. The …

Funnel control for passive infinite-dimensional systems
Thavamani Govindaraj, Anthony Hastir, Lassi Paunonen, Timo Reis
https://arxiv.org/abs/2510.01027 https://

Funnel control for passive infinite-dimensional systems
We consider funnel control for linear infinite-dimensional systems that are impedance passive, meaning that they satisfy an energy balance in which the stored energy equals the squared norm of the state and the supplied power is the inner product of input and output. For the analysis we employ the system node approach, which offers a unified framework for infinite-dimensional systems with boundary and distributed control and observation. The resulting closed-loop dynamics are governed by a nonl…

Assumption-lean Inference for Network-linked Data
Wei Li, Nilanjan Chakraborty, Robert Lunde
https://arxiv.org/abs/2510.00287 https://arxiv.org/pdf/2510.00…

Assumption-lean Inference for Network-linked Data
We consider statistical inference for network-linked regression problems, where covariates may include network summary statistics computed for each node. In settings involving network data, it is often natural to posit that latent variables govern connection probabilities in the graph. Since the presence of these latent features makes classical regression assumptions even less tenable, we propose an assumption-lean framework for linear regression with jointly exchangeable regression arrays. We …

A Robust Proactive Communication Strategy for Distributed Active Noise Control Systems
Junwei Ji, Dongyuan Shi, Zhengding Luo, Boxiang Wang, Ziyi Yang, Haowen Li, Woon-Seng Gan
https://arxiv.org/abs/2510.00934

A Robust Proactive Communication Strategy for Distributed Active Noise Control Systems
Distributed multichannel active noise control (DMCANC) systems assign the high computational load of conventional centralized algorithms across multiple processing nodes, leveraging inter-node communication to collaboratively suppress unwanted noise. However, communication overhead can undermine algorithmic stability and degrade overall performance. To address this challenge, we propose a robust communication framework that integrates adaptive-fixed-filter switching and the mixed-gradient combi…

@… @… Hmm, executing “npx netlify-cli” seems to work right on my device (That ol’ chestnut).
npx v10.8.2 installed via node 20.19.5 using hombrew on my Mac.

Position estimation based on UWB swarm optimization and comparison against traditional trilateration
Vinish Yogesh, Bert-Jan van Beijnum, Jaap H. Buurke, Chris T. M. Baten
https://arxiv.org/abs/2509.24738

Position estimation based on UWB swarm optimization and comparison against traditional trilateration
Ultra-wideband (UWB) is a promising technology for indoor position estimation for various localization applications of object swarms, such as in 3D analysis of human movement with multiple on-body sensors or a swarm of drones in an indoor environment. However, most UWB-only position estimation methods are based on a star topology, where the position of a mobile node is estimated using distances from several fixed anchors. These approaches ignore the valuable inter-node distance estimates, possi…

Wer auf bonn.social nutzt denn #meshtastic, bzw. hat einen Node?
https://meshtastic.org/

Optimizing Version AoI in Energy-Harvesting IoT: Model-Based and Learning-Based Approaches
Erfan Delfani, Nikolaos Pappas
https://arxiv.org/abs/2510.00904 https://

Optimizing Version AoI in Energy-Harvesting IoT: Model-Based and Learning-Based Approaches
Efficient data transmission in resource-constrained Internet of Things (IoT) systems requires semantics-aware management that maximizes the delivery of timely and informative data. This paper investigates the optimization of the semantic metric Version Age of Information (VAoI) in a status update system comprising an energy-harvesting (EH) sensor and a destination monitoring node. We consider three levels of knowledge about the system model -- fully known, partially known, and unknown -- and pr…

did you know bash has builtin gettext support? i sure didn't https://www.gnu.org/software/bash/manual/html_node/Locale-Translation.html

Node v25 is here!
https://github.com/nodejs/node/releases/tag/v25.0.0

Release 2025-10-15, Version 25.0.0 (Current), @RafaelGSS · nodejs/node
Node.js 25 is here! We have upgraded V8 to 14.1, bringing major JSON.stringify performance improvements, built-in Uint8Array base64/hex conversion, and ongoing WebAssembly and JIT pipeline optimiza...

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…

Superconducting gap structures in wallpaper fermion systems
Kaito Yoda, Ai Yamakage
https://arxiv.org/abs/2509.25823 https://arxiv.org/pdf/2509.25823

Superconducting gap structures in wallpaper fermion systems
We theoretically investigate the superconducting gap structures in wallpaper fermions, which are surface states of topological nonsymmorphic crystalline insulators, based on a two-dimensional effective model. A symmetry analysis identifies six types of momentum-independent pair potentials. One hosts a point node, two host line nodes, and the remaining three are fully gapped. By classifying the Bogoliubov--de Gennes Hamiltonian in the zero-dimensional symmetry class, we show that the point and l…

Schwer gefährlich: Giftige Schwermetalle https://www.verbraucherzentrale.de/node/13363

Schwer gefährlich: Giftige Schwermetalle | Verbraucherzentrale.de
Giftige Schwermetalle wie Arsen, Cadmium, Quecksilber oder Blei können auch bei Nahrungsergänzungsmitteln ein Problem sein. So schützen Sie sich.

A Generative Model for Controllable Feature Heterophily in Graphs
Haoyu Wang, Renyuan Ma, Gonzalo Mateos, Luana Ruiz
https://arxiv.org/abs/2509.23230 https://

A Generative Model for Controllable Feature Heterophily in Graphs
We introduce a principled generative framework for graph signals that enables explicit control of feature heterophily, a key property underlying the effectiveness of graph learning methods. Our model combines a Lipschitz graphon-based random graph generator with Gaussian node features filtered through a smooth spectral function of the rescaled Laplacian. We establish new theoretical guarantees: (i) a concentration result for the empirical heterophily score; and (ii) almost-sure convergence of t…

Enhancing Cluster Scheduling in HPC: A Continuous Transfer Learning for Real-Time Optimization
Leszek Sliwko, Jolanta Mizera-Pietraszko
https://arxiv.org/abs/2509.22701 https://…

Enhancing Cluster Scheduling in HPC: A Continuous Transfer Learning for Real-Time Optimization
This study presents a machine learning-assisted approach to optimize task scheduling in cluster systems, focusing on node-affinity constraints. Traditional schedulers like Kubernetes struggle with real-time adaptability, whereas the proposed continuous transfer learning model evolves dynamically during operations, minimizing retraining needs. Evaluated on Google Cluster Data, the model achieves over 99% accuracy, reducing computational overhead and improving scheduling latency for constrained t…

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…

Fundamental Limits of Distributed Computing for Linearly Separable Functions
K. K. Krishnan Namboodiri, Elizabath Peter, Derya Malak, Petros Elia
https://arxiv.org/abs/2509.23447

Fundamental Limits of Distributed Computing for Linearly Separable Functions
This work addresses the problem of distributed computation of linearly separable functions, where a master node with access to $K$ datasets, employs $N$ servers to compute $L$ user-requested functions, each defined over the datasets. Servers are instructed to compute subfunctions of the datasets and must communicate computed outputs to the user, who reconstructs the requested outputs. The central challenge is to reduce the per-server computational load and the communication cost from servers to…

Node Classification via Simplicial Interaction with Augmented Maximal Clique Selection
Eunho Koo, Tongseok Lim
https://arxiv.org/abs/2509.23568 https://arx…

Node Classification via Simplicial Interaction with Augmented Maximal Clique Selection
Considering higher-order interactions allows for a more comprehensive understanding of network structures beyond simple pairwise connections. While leveraging all cliques in a network to handle higher-order interactions is intuitive, it often leads to computational inefficiencies due to overlapping information between higher-order and lower-order cliques. To address this issue, we propose an augmented maximal clique strategy. Although using only maximal cliques can reduce unnecessary overlap an…

X-ray view of a massive node of the Cosmic Web at z=3 II. Discovery of extended X-ray emission around a hyperluminous QSO
Andrea Travascio, Sebastiano Cantalupo, Gabriele Pezzulli, Paolo Tozzi, Luca Di Mascolo, Michela Esposito, Titouan Lazeyras, Marika Lepore, Stefano Borgani, Martin Elvis, Giuseppina Fabbiano, Marta Galbiati, Nicholas Ledos, Riccardo Middei, Antonio Pensabene, Enrico Piconcelli, Giada Quadri, Fabio Vito, Weichen Wang, Luca Zappacosta

X-ray view of a massive node of the Cosmic Web at z=3 II. Discovery of extended X-ray emission around a hyperluminous QSO
While the warm, ionized gas in the CGM at z>3 is now routinely observed around bright QSOs in Lya emission, little is known about the CGM hot phase due to its expected faintness in the X-ray band, often referred to as the ICM. Here, we report the analysis of 634 ks of Chandra X-ray observations in the MQN01 Cosmic Node, a region containing one of the brightest Lya nebulae and the largest galaxy overdensity discovered so far at z>3. We detect 66 net counts of X-ray emission in the 0.5-2 keV band…

On the Polytope Model and Near End node Isomorphisms of Type $A$ Kirillov--Reshetikhin Crystals
Dipnit Biswas, Irfan Habib
https://arxiv.org/abs/2508.19796 https://

On the Polytope Model and Near End node Isomorphisms of Type $A$ Kirillov--Reshetikhin Crystals
We prove an inductive formula to construct a path from the highest weight element to any given vertex in the crystal graph of the polytope realization of the Kirillo-Reshetikhin crystal $KR^{i,m}$ of type $A$. For $i \le 2$ or $i \geq n-1$, we provide explicit formulas of the same by only using the lowering crystal operators and in those cases, using these paths, we determine the explicit image of any polytope under the affine crystal isomorphisms between the polytope and the tableau realizatio…

Triangular neural synchronization patterns in visual impairment https://www.cureus.com/articles/409884-triangular-neural-synchronization-patterns-i…

Triangular Neural Synchronization Patterns in Visual Impairment: A Comprehensive Case Series Exploring Multi-node Network Dynamics and the Neural Triangle Index
Background: Compensatory neural plasticity in visual impairment involves complex reorganization of multi-node networks that goes beyond conventional bilateral connection analysis. Triangular synchronization patterns, representing coordinated activity among three cortical sites simultaneously, remain unexplored despite their potential to reveal fundamental mechanisms underlying compensatory neuroplasticity. Objective: This study aimed to conduct a case series examining triangular neural synchro…

Perhaps one of my next projects is to set up a Mastodon instance (may be this one) on a cluster of 3 or more Raspberry Pi's. Still no exact imagination on how to distribute the different services in a meaningful manner. An example could be:
🖥️ Node Roles
pi-master: PostgreSQL, Redis, Reverse Proxy
pi-worker1: Web (Rails), Streaming
pi-worker2: Sidekiq, Web (replica)
#mastodon

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.

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
Daniel Hathcock, R. Ravi
https://arxiv.org/abs/2510.01107 https://arxiv.org/p…

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
Given a bipartite graph that has a perfect matching, a prefect proportional allocation is an assignment of positive weights to the nodes of the right partition so that every left node is fractionally assigned to its neighbors in proportion to their weights, and these assignments define a fractional perfect matching. We prove that a bipartite graph has a perfect proportional allocation if and only if it is matching covered, by using a classical result on matrix scaling. We also present an extens…

🥳 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.
…

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 134 edges.
Tags: Social, Fictional, Weighted

IMU-Preintegrated Radar Factors for Asynchronous Radar-LiDAR-Inertial SLAM
Johan Hatleskog, Morten Nissov, Kostas Alexis
https://arxiv.org/abs/2509.22288 https://

IMU-Preintegrated Radar Factors for Asynchronous Radar-LiDAR-Inertial SLAM
Fixed-lag Radar-LiDAR-Inertial smoothers conventionally create one factor graph node per measurement to compensate for the lack of time synchronization between radar and LiDAR. For a radar-LiDAR sensor pair with equal rates, this strategy results in a state creation rate of twice the individual sensor frequencies. This doubling of the number of states per second yields high optimization costs, inhibiting real-time performance on resource-constrained hardware. We introduce IMU-preintegrated rada…

A Node-Aware Dynamic Quantization Approach for Graph Collaborative Filtering
Lin Li, Chunyang Li, Yu Yin, Xiaohui Tao, Jianwei Zhang
https://arxiv.org/abs/2508.16516 https://

A Node-Aware Dynamic Quantization Approach for Graph Collaborative Filtering
In the realm of collaborative filtering recommendation systems, Graph Neural Networks (GNNs) have demonstrated remarkable performance but face significant challenges in deployment on resource-constrained edge devices due to their high embedding parameter requirements and computational costs. Using common quantization method directly on node embeddings may overlooks their graph based structure, causing error accumulation during message passing and degrading the quality of quantized embeddings.To…

email_eu: Email network (EU research inst.)
An email network (anonymized) from a large European research institution, collected from October 2003 to May 2005 (18 months). Each node corresponds to an email address, and a directed edge exists between nodes i and j, if i sent at least one message to j.
This network has 265214 nodes and 420045 edges.
Tags: Social, Communication, Unweighted

fly_larva: Drosophila larva brain (2023)
A complete synaptic map of the brain connectome of the larva of the fruit fly Drosophila melanogaster. Nodes are neurons, and edges are synaptic connections, traced individually from brain image sections using three-dimensional electron microscopy–based reconstruction. Node metadata include the neuron hempisphere, hemispherical homologue, cell type, annotations, and inferred cluster. Edge metadata include the type of interaction (`'aa'`,…

just found a node_modules folder that's inside a node_modules folder that's inside a node_modules folder

Zigzag Codes Revisited: From Optimal Rebuilding to Small Skip Cost and Small Fields
Wenqin Zhang, Han Mao Kiah, Son Hoang Dau
https://arxiv.org/abs/2509.23090 https://

Zigzag Codes Revisited: From Optimal Rebuilding to Small Skip Cost and Small Fields
We revisit zigzag array codes, a family of MDS codes known for achieving optimal access and optimal rebuilding ratio in single-node repair. In this work, we endow zigzag codes with two new properties: small field size and low skip cost. First, we prove that when the row-indexing group is $\mathcal{G} = \mathbb{Z}_2^m$ and the field has characteristic two, explicit coefficients over any field with $|\mathcal{F}|\ge N$ guarantee the MDS property, thereby decoupling the dependence among …

M3HG: Multimodal, Multi-scale, and Multi-type Node Heterogeneous Graph for Emotion Cause Triplet Extraction in Conversations
Qiao Liang, Ying Shen, Tiantian Chen, Lin Zhang
https://arxiv.org/abs/2508.18740

M3HG: Multimodal, Multi-scale, and Multi-type Node Heterogeneous Graph for Emotion Cause Triplet Extraction in Conversations
Emotion Cause Triplet Extraction in Multimodal Conversations (MECTEC) has recently gained significant attention in social media analysis, aiming to extract emotion utterances, cause utterances, and emotion categories simultaneously. However, the scarcity of related datasets, with only one published dataset featuring highly uniform dialogue scenarios, hinders model development in this field. To address this, we introduce MECAD, the first multimodal, multi-scenario MECTEC dataset, comprising 989 …

Accelerating Dynamic Image Graph Construction on FPGA for Vision GNNs
Anvitha Ramachandran, Dhruv Parikh, Viktor Prasanna
https://arxiv.org/abs/2509.25121 https://

Accelerating Dynamic Image Graph Construction on FPGA for Vision GNNs
Vision Graph Neural Networks (Vision GNNs, or ViGs) represent images as unstructured graphs, achieving state of the art performance in computer vision tasks such as image classification, object detection, and instance segmentation. Dynamic Image Graph Construction (DIGC) builds image graphs by connecting patches (nodes) based on feature similarity, and is dynamically repeated in each ViG layer following GNN based patch (node) feature updates. However, DIGC constitutes over 50% of end to end ViG…

Hierarchical Analysis and Control of Epidemic Spreading over Networks using Dissipativity and Mesh Stability
Shirantha Welikala, Hai Lin, Panos J. Antsaklis
https://arxiv.org/abs/2509.24665

Hierarchical Analysis and Control of Epidemic Spreading over Networks using Dissipativity and Mesh Stability
Analyzing and controlling spreading processes are challenging problems due to the involved non-linear node (subsystem) dynamics, unknown disturbances, complex interconnections, and the large-scale and multi-level nature of the problems. The dissipativity concept provides a practical framework for addressing such concerns, thanks to the energy-based representation it offers for subsystems and the compositional properties it provides for the analysis and control of interconnected (networked) syst…

Impact of Environmental Factors on LoRa 2.4 GHz Time of Flight Ranging Outdoors
Yiqing Zhou, Xule Zhou, Zecan Cheng, Chenao Lu, Junhan Chen, Jiahong Pan, Yizhuo Liu, Sihao Li, Kyeong Soo Kim
https://arxiv.org/abs/2509.23125

Impact of Environmental Factors on LoRa 2.4 GHz Time of Flight Ranging Outdoors
In WSN/IoT, node localization is essential to long-running applications for accurate environment monitoring and event detection, often covering a large area in the field. Due to the lower time resolution of typical WSN/IoT platforms (e.g., 1 microsecond on ESP32 platforms) and the jitters in timestamping, packet-level localization techniques cannot provide meter-level resolution. For high-precision localization as well as world-wide interoperability via 2.4-GHz ISM band, a new variant of LoRa, …

Partial Parameter Updates for Efficient Distributed Training
Anastasiia Filippova, Angelos Katharopoulos, David Grangier, Ronan Collobert
https://arxiv.org/abs/2509.22418 https:…

Partial Parameter Updates for Efficient Distributed Training
We introduce a memory- and compute-efficient method for low-communication distributed training. Existing methods reduce communication by performing multiple local updates between infrequent global synchronizations. We demonstrate that their efficiency can be significantly improved by restricting backpropagation: instead of updating all the parameters, each node updates only a fixed subset while keeping the remainder frozen during local steps. This constraint substantially reduces peak memory us…

Understanding How Network Geometry Influences Diffusion Processes in Complex Networks: A Focus on Cryptocurrency Blockchains and Critical Infrastructure Networks
S M Mustaquim, Asim K. Dey, Abhijit Mandal
https://arxiv.org/abs/2509.23450

Understanding How Network Geometry Influences Diffusion Processes in Complex Networks: A Focus on Cryptocurrency Blockchains and Critical Infrastructure Networks
This study provides essential insights into how diffusion processes unfold in complex networks, with a focus on cryptocurrency blockchains and infrastructure networks. The structural properties of these networks, such as hub-dominated, heavy-tailed topology, network motifs, and node centrality, significantly influence diffusion speed and reach. Using epidemic diffusion models, specifically the Kertesz threshold model and the Susceptible-Infected (SI) model, we analyze key factors affecting diff…

physician_trust: Physician trust network (1966)
A network of trust relationships among physicians in four midwestern (USA) cities in 1966. Edge direction indicates that node i trusts or asks for advice from node j. Each of the four components represent the network within a given city.
This network has 241 nodes and 1098 edges.
Tags: Social, Offline, Unweighted

Evading Overlapping Community Detection via Proxy Node Injection
Dario Loi, Matteo Silvestri, Fabrizio Silvestri, Gabriele Tolomei
https://arxiv.org/abs/2509.21211 https://

Evading Overlapping Community Detection via Proxy Node Injection
Protecting privacy in social graphs requires preventing sensitive information, such as community affiliations, from being inferred by graph analysis, without substantially altering the graph topology. We address this through the problem of \emph{community membership hiding} (CMH), which seeks edge modifications that cause a target node to exit its original community, regardless of the detection algorithm employed. Prior work has focused on non-overlapping community detection, where trivial stra…

Relay Selection in Wireless Networks as Restless Bandits
Mandar R. Nalavade, Ravindra S. Tomar, Gaurav S. Kasbekar
https://arxiv.org/abs/2508.20625 https://

Relay Selection in Wireless Networks as Restless Bandits
We consider a wireless network in which a source node needs to transmit a large file to a destination node. The direct wireless link between the source and the destination is assumed to be blocked. Multiple candidate relays are available to forward packets from the source to the destination. A holding cost is incurred for each packet stored at every relay in each time slot. The objective is to design a policy for selecting a relay in each time slot to which the source attempts to send a packet,…

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

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

Community detection robustness of graph neural networks
Jaidev Goel, Pablo Moriano, Ramakrishnan Kannan, Yulia R. Gel
https://arxiv.org/abs/2509.24662 https://

Community detection robustness of graph neural networks
Graph neural networks (GNNs) are increasingly widely used for community detection in attributed networks. They combine structural topology with node attributes through message passing and pooling. However, their robustness or lack of thereof with respect to different perturbations and targeted attacks in conjunction with community detection tasks is not well understood. To shed light into latent mechanisms behind GNN sensitivity on community detection tasks, we conduct a systematic computationa…

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

paris_transportation: Paris Transportation (2016)
A multiplex transportation network of Ile-de-France, jointly representing the road network, train network, and subway network. Nodes are intersections, rail stations or metro stations. Different modes of transportation are given by different layers. Within-layer edges represent direct transference by a particular mode of transportation, and between-layer edges represent the conjunction of those layers at that node.
This network ha…

Robustness of One-to-Many Interdependent Higher-order Networks Against Cascading Failures
Cheng Qian, Dandan Zhao, Bo Zhang, Ming Zhong, Jianmin Han, Shenghong Li, Hao Peng, Wei Wang
https://arxiv.org/abs/2509.23716

Robustness of One-to-Many Interdependent Higher-order Networks Against Cascading Failures
In the real world, the stable operation of a network is usually inseparable from the mutual support of other networks. In such an interdependent network, a node in one layer may depend on multiple nodes in another layer, forming a complex one-to-many dependency relationship. Meanwhile, there may also be higher-order interactions between multiple nodes within a layer, which increases the connectivity within the layer. However, existing research on one-to-many interdependence often neglects intra…

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

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

physician_trust: Physician trust network (1966)
A network of trust relationships among physicians in four midwestern (USA) cities in 1966. Edge direction indicates that node i trusts or asks for advice from node j. Each of the four components represent the network within a given city.
This network has 241 nodes and 1098 edges.
Tags: Social, Offline, Unweighted

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

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 40 nodes and 152 edges.
Tags: Social, Fictional, 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 34613 nodes and 202167 edges.
Tags: Informational, Legal, Unweighted, Metadata, Temporal

yahoo_ads: Yahoo! advertisement words
A network of words extracted from phrases on which advertisers bid, in Yahoo! advertisements. A node is a word and a directed edge (i, j) denotes word i comes after the word j.
This network has 653260 nodes and 2931708 edges.
Tags: Informational, Language, Unweighted
https://

fly_larva: Drosophila larva brain (2023)
A complete synaptic map of the brain connectome of the larva of the fruit fly Drosophila melanogaster. Nodes are neurons, and edges are synaptic connections, traced individually from brain image sections using three-dimensional electron microscopy–based reconstruction. Node metadata include the neuron hempisphere, hemispherical homologue, cell type, annotations, and inferred cluster. Edge metadata include the type of interaction (`'aa'`,…

soc_net_comms: Networks with group metadata
Snapshots of LiveJournal, Friendster, Orkut, and YouTube online social networks, as well as DBLP and Amazon. Node metadata represents a post hoc definition of a 'community' that a node belongs to, derived from topical labels of the node or interest-based 'groups' that a node links to.
This network has 334863 nodes and 925872 edges.
Tags: Online, Social, Collaboration, Informational, Relatedness, Unweighted, Metadat…

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

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

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 …

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, 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-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, 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-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

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

contact: Haggle human proximity network (2006)
A network of human proximities, as measured by carried wireless devices. Each node represents a person, and an edge denotes when two people were within a certain proximity of each other, as measured by a wireless protocol (Bluetooth or Wifi). The edges are timestamped.
This network has 274 nodes and 28244 edges.
Tags: Social, Offline, Unweighted, Timestamps

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 3347 nodes and 172663 edges.
Tags: Social, Online, Unweighted, Metadata

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 3870 nodes and 469544 edges.
Tags: Social, Online, Unweighted, Metadata

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

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

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

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 …

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 …

yahoo_ads: Yahoo! advertisement words
A network of words extracted from phrases on which advertisers bid, in Yahoo! advertisements. A node is a word and a directed edge (i, j) denotes word i comes after the word j.
This network has 653260 nodes and 2931708 edges.
Tags: Informational, Language, Unweighted
https://

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

fly_larva: Drosophila larva brain (2023)
A complete synaptic map of the brain connectome of the larva of the fruit fly Drosophila melanogaster. Nodes are neurons, and edges are synaptic connections, traced individually from brain image sections using three-dimensional electron microscopy–based reconstruction. Node metadata include the neuron hempisphere, hemispherical homologue, cell type, annotations, and inferred cluster. Edge metadata include the type of interaction (`'aa'`,…

paris_transportation: Paris Transportation (2016)
A multiplex transportation network of Ile-de-France, jointly representing the road network, train network, and subway network. Nodes are intersections, rail stations or metro stations. Different modes of transportation are given by different layers. Within-layer edges represent direct transference by a particular mode of transportation, and between-layer edges represent the conjunction of those layers at that node.
This network ha…

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

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

soc_net_comms: Networks with group metadata
Snapshots of LiveJournal, Friendster, Orkut, and YouTube online social networks, as well as DBLP and Amazon. Node metadata represents a post hoc definition of a 'community' that a node belongs to, derived from topical labels of the node or interest-based 'groups' that a node links to.
This network has 334863 nodes and 925872 edges.
Tags: Online, Social, Collaboration, Informational, Relatedness, Unweighted, Metadat…

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

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 …

contact: Haggle human proximity network (2006)
A network of human proximities, as measured by carried wireless devices. Each node represents a person, and an edge denotes when two people were within a certain proximity of each other, as measured by a wireless protocol (Bluetooth or Wifi). The edges are timestamped.
This network has 274 nodes and 28244 edges.
Tags: Social, Offline, Unweighted, Timestamps

yahoo_ads: Yahoo! advertisement words
A network of words extracted from phrases on which advertisers bid, in Yahoo! advertisements. A node is a word and a directed edge (i, j) denotes word i comes after the word j.
This network has 653260 nodes and 2931708 edges.
Tags: Informational, Language, Unweighted
https://