Tootfinder

The first MS-A2 node is up and it only took the entire day. After fixing a ton of networking issues across the homelab I've got all the VMs running on the new node. The old nodes have been decomissioned which kinda marks a milestone. Still need to get the other two new nodes into the cluster, but should be fairly straightforward and can wait until tomorrow.
#homelab

ShyLU node: On-node Scalable Solvers and Preconditioners Recent Progresses and Current Performance
Ichitaro Yamazaki, Nathan Ellingwood, Sivasankaran Rajamanickam
https://arxiv.org/abs/2506.05793

ShyLU node: On-node Scalable Solvers and Preconditioners Recent Progresses and Current Performance
ShyLU-node is an open-source software package that implements linear solvers and preconditioners on shared-memory multicore CPUs or on a GPU. It is part of the Trilinos software framework and designed to provide a robust and efficient solution of large-scale linear systems from real-world applications on the current and emerging computers. In this paper, we discuss two sparse direct solvers, Basker and Tacho, and an algebraic preconditioner, FastILU, in ShyLU-node package. These ShyLU solvers a…

Terabyte-Scale Analytics in the Blink of an Eye
Bowen Wu, Wei Cui, Carlo Curino, Matteo Interlandi, Rathijit Sen
https://arxiv.org/abs/2506.09226 https://

Terabyte-Scale Analytics in the Blink of an Eye
For the past two decades, the DB community has devoted substantial research to take advantage of cheap clusters of machines for distributed data analytics -- we believe that we are at the beginning of a paradigm shift. The scaling laws and popularity of AI models lead to the deployment of incredibly powerful GPU clusters in commercial data centers. Compared to CPU-only solutions, these clusters deliver impressive improvements in per-node compute, memory bandwidth, and inter-node interconnect pe…

Generic Chiral Anomaly and Planar Hall Effect in a Non-Weyl System
Yongjian Wang, Alexander Wowchik, Thomas Boemerich, A. A. Taskin, Achim Rosch, Yoichi Ando
https://arxiv.org/abs/2506.09756

Generic Chiral Anomaly and Planar Hall Effect in a Non-Weyl System
The condensed-matter version of the chiral anomaly describes how electrons are pumped from a Weyl node with negative chirality to a Weyl node with positive chirality using parallel electric and magnetic fields. Key experimental signatures are a negative longitudinal magnetoresistance (LMR) and the planar Hall effect (PHE), both of which have been experimentally observed. Here, we show that the chiral anomaly explains key features of magnetotransport in the nodal-line semimetal ZrTe$_5$ despite …

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…

Malicious node aware wireless multi hop networks: a systematic review of the literature and recommendations for future research
Shahram Pourdehghan, Nahideh Derakhshanfard
https://arxiv.org/abs/2506.05742

Malicious node aware wireless multi hop networks: a systematic review of the literature and recommendations for future research
Wireless communication provides great advantages that are not available through their wired counterparts such as flexibility, ease of deployment and use, cost reductions, and convenience. Wireless multi-hop networks (WMN) do not have any centralized management infrastructure. Wireless multi-hop networks have many benefits since proposed. In such networks when a node wants to send a packet to a destination where is not in the transmission range, depend on some intermediate nodes. In this type of…

Graph signal aware decomposition of dynamic networks via latent graphs
Bishwadeep Das, Andrei Buciulea, Antonio G. Marques, Elvin Isufi
https://arxiv.org/abs/2506.08519

Graph signal aware decomposition of dynamic networks via latent graphs
Dynamics on and of networks refer to changes in topology and node-associated signals, respectively and are pervasive in many socio-technological systems, including social, biological, and infrastructure networks. Due to practical constraints, privacy concerns, or malfunctions, we often observe only a fraction of the topological evolution and associated signal, which not only hinders downstream tasks but also restricts our analysis of network evolution. Such aspects could be mitigated by moving …

Fast Geometric Embedding for Node Influence Maximization
Alexander Kolpakov, Igor Rivin
https://arxiv.org/abs/2506.07435 https://arxi…

Fast Geometric Embedding for Node Influence Maximization
Computing classical centrality measures such as betweenness and closeness is computationally expensive on large-scale graphs. In this work, we introduce an efficient force layout algorithm that embeds a graph into a low-dimensional space, where the radial distance from the origin serves as a proxy for various centrality measures. We evaluate our method on multiple graph families and demonstrate strong correlations with degree, PageRank, and paths-based centralities. As an application, it turns …

Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings
Daniel P. Bossaller, Hiram H. L\'opez
https://arxiv.org/abs/2506.09017

Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings
Codes over rings, especially over Galois rings, have been extensively studied for nearly three decades due to their similarity to linear codes over finite fields. A distributed storage system uses a linear code to encode a large file across several nodes. If one of the nodes fails, a linear exact repair scheme efficiently recovers the failed node by accessing and downloading data from the rest of the servers of the storage system. In this article, we develop a linear repair scheme for free maxi…

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
Hadley Black, Arya Mazumdar, Barna Saha, Yinzhan Xu
https://arxiv.org/abs/2506.08405

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
The graph reconstruction problem has been extensively studied under various query models. In this paper, we propose a new query model regarding the number of connected components, which is one of the most basic and fundamental graph parameters. Formally, we consider the problem of reconstructing an $n$-node $m$-edge graph with oracle queries of the following form: provided with a subset of vertices, the oracle returns the number of connected components in the induced subgraph. We show $Θ(\frac…

I’ve been working on a fork of @…’s MeshInfo for PugetMesh. If you’re interested in #Meshtastic in the Puget Sound area, check it out. It shows chat messages, neighboring nodes, node details, and a mesh map.
I added mapping for message and traceroute propagatio…

Age of Information in Unreliable Tandem Queues
Muthukrishnan Senthilkumar, Aresh Dadlani, Hina Tabassum
https://arxiv.org/abs/2506.09245 https://

Age of Information in Unreliable Tandem Queues
Stringent demands for timely information delivery, driven by the widespread adoption of real-time applications and the Internet of Things, have established the age of information (AoI) as a critical metric for quantifying data freshness. Existing AoI models often assume multi-hop communication networks with fully reliable nodes, which may not accurately capture scenarios involving node transmission failures. This paper presents an analytical framework for two configurations of tandem queue syst…

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

This https://arxiv.org/abs/2412.04325 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Clustering-induced localization of quantum walks on networks
Quantum walks on networks are a paradigmatic model in quantum information theory. Quantum-walk algorithms have been developed for various applications, including spatial-search problems, element-distinctness problems, and node centrality analysis. Unlike their classical counterparts, the evolution of quantum walks is unitary, so they do not converge to a stationary distribution. However, for many applications, it is important to understand the long-time behavior of quantum walks and the impact …

Wow. I guess that article* by @…
amounted to an advertisement for slimeball “residential proxy” vendors.
I have ~15 times as many *new* networks (by route) caught trying to get my users’ mail today than is normal. I’m up to blocking 4771 (includes some aggregation) and some days don’t get *ANY* new ones.
Today’s batch are from around th…

Cybercriminals turn to “residential proxy” services to hide malicious traffic
"You cannot technically distinguish which traffic in a node is bad and which traffic is good." For years, gray market services known as “bulletproof” …

This https://arxiv.org/abs/2506.03940 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

Depermissioning Web3: a Permissionless Accountable RPC Protocol for Blockchain Networks
In blockchain networks, so-called "full nodes" serve data to and relay transactions from clients through an RPC interface. This serving layer enables integration of "Web3" data, stored on blockchains, with "Web2" mobile or web applications that cannot directly participate as peers in a blockchain network. In practice, the serving layer is dominated by a small number of centralized services ("node providers") that offer permissioned access to RPC endpoints. Clients register with these providers …

Engineering Cryogenic FETs: Addressing SCEs and Impact of Interface Traps Down to 2 K Temperature
Nilesh Pandey, Dipanjan Basu, Yogesh Singh Chauhan, Leonard F. Register, Sanjay K. Banerjee
https://arxiv.org/abs/2506.09356

Engineering Cryogenic FETs: Addressing SCEs and Impact of Interface Traps Down to 2 K Temperature
This paper presents a comprehensive design and benchmarking of cryogenic bulk-FET using a calibrated TCAD model integrating 2-D electrostatics and interface trap effects across temperatures from T = 2 K to 300 K. For a 28-nm node FET, transport appears predominately ballistic at T = 2 K, shifting toward quasi-ballistic transport with increasing temperature. Short-channel effects (SCEs) dominate cryogenic benefits at Lg = 25 nm for T < 25 K, as evidenced by a modest improvement in the minimum su…

Synchronization in Anonymous Networks Under Continuous Dynamics
Rida Bazzi, Anya Chaturvedi, Andr\'ea W. Richa, Peter Vargas
https://arxiv.org/abs/2506.08661

Strongly Consistent Community Detection in Popularity Adjusted Block Models
Quan Yuan, Binghui Liu, Danning Li, Lingzhou Xue
https://arxiv.org/abs/2506.07224

Strongly Consistent Community Detection in Popularity Adjusted Block Models
The Popularity Adjusted Block Model (PABM) provides a flexible framework for community detection in network data by allowing heterogeneous node popularity across communities. However, this flexibility increases model complexity and raises key unresolved challenges, particularly in effectively adapting spectral clustering techniques and efficiently achieving strong consistency in label recovery. To address these challenges, we first propose the Thresholded Cosine Spectral Clustering (TCSC) algor…

Model-Driven Graph Contrastive Learning
Ali Azizpour, Nicolas Zilberstein, Santiago Segarra
https://arxiv.org/abs/2506.06212 https://…

Model-Driven Graph Contrastive Learning
We propose $\textbf{MGCL}$, a model-driven graph contrastive learning (GCL) framework that leverages graphons (probabilistic generative models for graphs) to guide contrastive learning by accounting for the data's underlying generative process. GCL has emerged as a powerful self-supervised framework for learning expressive node or graph representations without relying on annotated labels, which are often scarce in real-world data. By contrasting augmented views of graph data, GCL has demonstrat…

Silly #LinkedOpenData contribution of the day (month? year?): adding #Caltech’s iconic Fleming Cannon to #OpenStreetMap and #Wikidata

Node: ‪Fleming Cannon‬ (‪12880607063‬)
OpenStreetMap is a map of the world, created by people like you and free to use under an open license.

rant on software dev practices
What is it with P5js and virtually all its ecosystem (like Q5js) that, still today, didn't manage to _properly_ package their libraries to be distributed and used via package managers?
Same with their insistence to push global resources and state everywhere... and of course virtually not documenting any of the truly delicate details, just the trivial stuff that could be auto-discovered by relying on auto-complete tools.
I kind of understand wanting to keep the vanilla experience alive, making it "easy" for novices... but that shouldn't be at odds with more "professionalized" production pipelines, at least *not that much*.
For example, with Q5js:
- The NPM packages could be mentioned in their documentation (they are not, even though they are official)
- The NPM packages could define proper exports (same for the JS modules themselves), not forcing us to rely on relative paths to files in node_modules... 🤦
- Globals could be at least namespaced... of course, it would be much, much better if they didn't exist at all.
I'm writing this in 2025, not 1993... and I'm... "triggered".
At this point I'll have to check if I have any other neuro-condition beyond ADHD that makes me "obsessed" with technical flaws, because it seems to be a "me problem" when either virtually nobody sees that as a huge collection of fatal design flaws... or they see it and don't care at all.

I built a solar #meshtastic node
Now, I need to find a place to put it

Neighborhood Overlap-Aware High-Order Graph Neural Network for Dynamic Graph Learning
Ling Wang
https://arxiv.org/abs/2506.06728 https://

Neighborhood Overlap-Aware High-Order Graph Neural Network for Dynamic Graph Learning
Dynamic graph learning (DGL) aims to learn informative and temporally-evolving node embeddings to support downstream tasks such as link prediction. A fundamental challenge in DGL lies in effectively modeling both the temporal dynamics and structural dependencies of evolving graph topologies. Recent advances in Dynamic Graph Neural Networks (DGNNs) have obtained remarkable success by leveraging message-passing mechanisms to capture pairwise node interactions. However, these approaches often over…

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…

The discontinuous planar piecewise linear system with two nodes has at most two limit cycles
Lu Chen, Changjian Liu
https://arxiv.org/abs/2506.07716 https:…

The discontinuous planar piecewise linear system with two nodes has at most two limit cycles
This paper investigates the multiplicity and the number of limit cycles for planar piecewise linear system divided into two regions by a straight line and each linear subsystem has a node. Through constructing Poincare half maps and a successor function, and analyzing the properties of the successor function, we can derive that this system has at most two limit cycles, counting the multiplicities of limit cycles.

Balancing Fixed Number of Nodes Among Multiple Fixed Clusters
Paritosh Ranjan, Surajit Majumder, Prodip Roy, Bhuban Padhan
https://arxiv.org/abs/2506.08715

Balancing Fixed Number of Nodes Among Multiple Fixed Clusters
Cloud infrastructure users often allocate a fixed number of nodes to individual container clusters (e.g., Kubernetes, OpenShift), resulting in underutilization of computing resources due to asynchronous and variable workload peaks across clusters. This research proposes a novel system and method for dynamic rebalancing of a fixed total number of nodes among multiple fixed clusters based on real-time resource utilization thresholds. By introducing a Node Balancing Cluster Group (NBCG), clusters …

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 …

require(esm) was just enabled by default in the latest Node v20!
Node v18 LTS support ends on April 30th, and as of that date you'll officially be able to use ESM & CommonJS together easily in all supported versions ♥️
#nodejs #esm

Release 2025-03-13, Version 20.19.0 'Iron' (LTS), @marco-ippolito · nodejs/node
Notable Changes require(esm) is now enabled by default Support for loading native ES modules using require() had been available on v20.x under the command line flag --experimental-require-module, a...

Hey @… you seem to know a bunch about SMPSes.
Any idea why a buck converter (STM32H735 integrated SMPS) would call for a 220 pF cap from the switch node to ground *before* the inductor?

This https://arxiv.org/abs/2412.00418 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

Mixture of Experts for Node Classification
Nodes in the real-world graphs exhibit diverse patterns in numerous aspects, such as degree and homophily. However, most existent node predictors fail to capture a wide range of node patterns or to make predictions based on distinct node patterns, resulting in unsatisfactory classification performance. In this paper, we reveal that different node predictors are good at handling nodes with specific patterns and only apply one node predictor uniformly could lead to suboptimal result. To mitigate …

This https://arxiv.org/abs/2409.12829 has been replaced.
initial toot: https://mastoxiv.page/@a…

Altermagnetic Weyl node-network semimetals protected by spin symmetry
Symmetry protected topology has been studied extensively in the past twenty years, but the topology protected by spin symmetry has just begun to be studied. In this work, based on spin symmetry analysis, we propose that a class of Weyl nodal line semimetals is protected by the spin symmetry. Then, by the first-principles electronic structure calculations, we predict that both altermagnetic $\rm Nb_2FeB_2$ and $\rm Ta_2FeB_2$ are node-network semimetals protected by the spin symmetry. Moreover, …

This https://arxiv.org/abs/2308.13818 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Packet Header Recognition Utilizing an All-Optical Reservoir Based on Reinforcement-Learning-Optimized Double-Ring Resonator
Optical packet header recognition is an important signal processing task of optical communication networks. In this work, we propose an all-optical reservoir, consisting of integrated double-ring resonators (DRRs) as nodes, for fast and accurate optical packet header recognition. As the delay-bandwidth product (DBP) of the node is a key figure-of-merit in the reservoir, we adopt a deep reinforcement learning algorithm to maximize the DBPs for various types of DRRs, which has the advantage of fu…

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…

Design Tradeoffs in Photonically Linked Qubit Networks
Ely Novakoski, Jungsang Kim
https://arxiv.org/abs/2506.06268 https://arxiv.org…

Design Tradeoffs in Photonically Linked Qubit Networks
Quantum networking can be realized by distributing pairs of entangled qubits between remote quantum processing nodes. Devoted communication qubits within each node can naturally interface with photons which bus quantum information between nodes. With the introduction of CQED to enhance interactions between communication qubits and photons, advanced protocols capable of achieving high entanglement distribution rates with high fidelity become feasible. In this paper, we consider two such protocol…

Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Alonso Espinoza, Eric Goles, Marco Montalva-Medel
https://arxiv.org/abs/2506.02525

Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. The streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of cri…

Well that was an interesting one to debug... My blocky DNS service was down after a cluster restart
A given #metallb speaker won’t advertise the service if:
- the service has externalTrafficPolicy=local and there are no running endpoints on the speaker’s node
To use externalTrafficPolicy=local, the tolerations on metallb pods must match the tolerations on the destination pods…

This https://arxiv.org/abs/2412.17779 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Ergodic Network Stochastic Differential Equations
We propose a novel framework for Network Stochastic Differential Equations (N-SDE), where each node in a network is governed by an SDE influenced by interactions with its neighbors. The evolution of each node is driven by the interplay of three key components: the node's intrinsic dynamics (\emph{momentum effect}), feedback from neighboring nodes (\emph{network effect}), and a \emph{stochastic volatility} term modeled by Brownian motion. Our primary objective is to estimate the parameters of th…

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…

This https://arxiv.org/abs/2411.06268 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Constraints and Variables Reduction for Optimal Power Flow Using Hierarchical Graph Neural Networks with Virtual Node-Splitting
Power system networks are often modeled as homogeneous graphs, which limits the ability of graph neural network (GNN) to capture individual generator features at the same nodes. By introducing the proposed virtual node-splitting strategy, generator-level attributes like costs, limits, and ramp rates can be fully captured by GNN models, improving GNN's learning capacity and prediction accuracy. Optimal power flow (OPF) problem is used for real-time grid operations. Limited timeframe motivates st…

This https://arxiv.org/abs/2505.05370 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDC_…

Walrus: An Efficient Decentralized Storage Network
Decentralized storage systems face a fundamental trade-off between replication overhead, recovery efficiency, and security guarantees. Current approaches either rely on full replication, incurring substantial storage costs, or employ trivial erasure coding schemes that struggle with efficient recovery especially under high storage-node churn. We present Walrus, a novel decentralized blob storage system that addresses these limitations through multiple technical innovations. At the core of Walru…

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 34 nodes and 96 edges.
Tags: Social, Fictional, Weighted

This https://arxiv.org/abs/2406.01094 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Joint Learning of Linear Dynamical Systems under Smoothness Constraints
We consider the problem of joint learning of multiple linear dynamical systems. This has received significant attention recently under different types of assumptions on the model parameters. The setting we consider involves a collection of $m$ linear systems, each of which resides on a node of a given undirected graph $G = ([m], \mathcal{E})$. We assume that the system matrices are marginally stable, and satisfy a smoothness constraint w.r.t $G$ -- akin to the quadratic variation of a signal on…

This https://arxiv.org/abs/2501.09805 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qbi…

Multiplex Nodal Modularity: A novel network metric for the regional analysis of amnestic mild cognitive impairment during a working memory binding task
Modularity is a well-established concept for assessing community structures in various single and multi-layer networks, including those in biological and social domains. Brain networks are known to exhibit community structure at local, meso, and global scale. However, modularity is limited as a metric to a global scale describing the overall strength of community structure, overlooking important variations in community structure at node level. To address this limitation, we extended modularity …

This https://arxiv.org/abs/2402.16887 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

A Comprehensive Survey on Artificial Intelligence for Complex Network: Potential, Methodology and Application
Complex networks pervade various real-world systems, from the natural environment to human societies. The essence of these networks is in their ability to transition and evolve from microscopic disorder-where network topology and node dynamics intertwine-to a macroscopic order characterized by certain collective behaviors. Over the past two decades, complex network science has significantly enhanced our understanding of the statistical mechanics, structures, and dynamics underlying real-world n…

The Guide to #Hashing I Wish I Had When I Started
https://banjocode.com/post/cs/hashing

This https://arxiv.org/abs/2505.11396 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Finding Counterfactual Evidences for Node Classification
Counterfactual learning is emerging as an important paradigm, rooted in causality, which promises to alleviate common issues of graph neural networks (GNNs), such as fairness and interpretability. However, as in many real-world application domains where conducting randomized controlled trials is impractical, one has to rely on available observational (factual) data to detect counterfactuals. In this paper, we introduce and tackle the problem of searching for counterfactual evidences for the GNN…

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…

A Reinforcement Learning-Based Telematic Routing Protocol for the Internet of Underwater Things
Mohammadhossein Homaei, Mehran Tarif, Agustin Di Bartolo, Oscar Mogollon Gutierrez, Mar Avila
https://arxiv.org/abs/2506.00133

A Reinforcement Learning-Based Telematic Routing Protocol for the Internet of Underwater Things
The Internet of Underwater Things (IoUT) faces major challenges such as low bandwidth, high latency, mobility, and limited energy resources. Traditional routing protocols like RPL, which were designed for land-based networks, do not perform well in these underwater conditions. This paper introduces RL-RPL-UA, a new routing protocol that uses reinforcement learning to improve performance in underwater environments. Each node includes a lightweight RL agent that selects the best parent node based…

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…

EMetaNode: Electromechanical Metamaterial Node for Broadband Vibration Attenuation and Self-powered Sensing
Bao Zhao, Lorenzo Di Manici, Raffaele Ardito, Eleni Chatzi, Andrea Colombi, Songye Zhu
https://arxiv.org/abs/2506.02960

EMetaNode: Electromechanical Metamaterial Node for Broadband Vibration Attenuation and Self-powered Sensing
Recent advances in mechanical metamaterials and piezoelectric energy harvesting provide exciting opportunities to guide and convert the mechanical energy in electromechanical systems for autonomous sensing and vibration control. However, practical realizations remain rare due to the lack of advanced modeling methods and interdisciplinary barriers. By integrating mechanical metamaterials with power electronics-based interface circuits, this paper makes a breakthrough with an electromechanical fr…

This https://arxiv.org/abs/2412.16387 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Information Limits of Joint Community Detection and Finite Group Synchronization
The emerging problem of joint community detection and group synchronization, with applications in signal processing and machine learning, has been extensively studied in recent years. Previous research has predominantly focused on a statistical model that extends the stochastic block model~(SBM) by incorporating additional group transformations. In its simplest form, the model randomly generates a network of size $n$ that consists of two equal-sized communities, where each node $i$ is associate…

Beyond the Buzz: A Pragmatic Take on Inference Disaggregation
Tiyasa Mitra, Ritika Borkar, Nidhi Bhatia, Ramon Matas, Shivam Raj, Dheevatsa Mudigere, Ritchie Zhao, Maximilian Golub, Arpan Dutta, Sailaja Madduri, Dharmesh Jani, Brian Pharris, Bita Darvish Rouhani
https://arxiv.org/abs/2506.05508

Beyond the Buzz: A Pragmatic Take on Inference Disaggregation
As inference scales to multi-node deployments, disaggregation - splitting inference into distinct phases - offers a promising path to improving the throughput-interactivity Pareto frontier. Despite growing enthusiasm and a surge of open-source efforts, practical deployment of disaggregated serving remains limited due to the complexity of the optimization search space and system-level coordination. In this paper, we present the first systematic study of disaggregated inference at scale, evaluati…

Real-Time Sounding in ISAC networks: Design and Implementation of a Multi-Node Testbed with Synchronized Airborne and Ground-Based Sensors
Julia Beuster, Carsten Andrich, Sebastian Giehl, Marc Miranda, Lorenz Mohr, Dieter Novotny, Tom Kaufmann, Christian Schneider, Reiner S. Thom\"a
https://arxiv.org/abs/2506.00624

Real-Time Sounding in ISAC networks: Design and Implementation of a Multi-Node Testbed with Synchronized Airborne and Ground-Based Sensors
As integrated sensing and communication (ISAC) capabilities become more prevalent in the mobile 6G radio landscape, there is a substantial opportunity to enhance situational awareness across diverse applications through multi-static radar sensing within meshed ISAC networks. To facilitate the development and testing of detection and localization algorithms across diverse scenarios, this paper introduces a synchronized distributed channel sounding testbed with airborne and ground-based multi-cha…

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…

Critical demand in a stochastic model of flows in supply networks
Yannick Feld, Marc Barthelemy
https://arxiv.org/abs/2505.24813 https://

Critical demand in a stochastic model of flows in supply networks
Supply networks are essential for modern production, yet their critical properties remain understudied. We present a stochastic model with random production capacities to analyze material flow to a root node, focusing on topology and buffer stocks. The critical demand, where unsatisfied demand diverges, is examined mostly through numerical simulations. Without stocks, minimal production dictates behavior, making topology irrelevant. With stocks, memory effects arise, making topology crucial. In…

tl;dr: Block logins from Tor Exit Nodes using Conditional Access
One thing we (as a community) lost when we started using IdP’s like #EntraID was the ability to easily block networks and IP addresses from accessing your login pages. The work-around with Entra is to create Conditional Access Network Locations along with a policy to block successful logins from those IPs and networks.

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…

Got some batteries, and now my prototype solar node is ready for being tested in the field.
#meshtastic

Fast-Converging Distributed Signal Estimation in Topology-Unconstrained Wireless Acoustic Sensor Networks
Paul Didier, Toon van Waterschoot, Simon Doclo, J\"org Bitzer, Marc Moonen
https://arxiv.org/abs/2506.02797

Fast-Converging Distributed Signal Estimation in Topology-Unconstrained Wireless Acoustic Sensor Networks
This paper focuses on distributed signal estimation in topology-unconstrained wireless acoustic sensor networks (WASNs) where sensor nodes only transmit fused versions of their local sensor signals. For this task, the topology-independent (TI) distributed adaptive node-specific signal estimation (DANSE) algorithm (TI-DANSE) has previously been proposed. It converges towards the centralized signal estimation solution in non-fully connected and time-varying network topologies. However, the applic…

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs
Timothy LaRock, Renaud Lambiotte
https://arxiv.org/abs/2506.01479 https://

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs
Hypergraphs extend traditional networks by capturing multi-way or group interactions. Given the complexity of hypergraph data and the wide range of methodology available for pairwise network analysis, hypergraph data is often projected onto a weighted and undirected network. The simplest of these projections, often referred to as a node co-occurrence matrix, is known to be non-unique, as distinct non-isomorphic hypergraphs can produce the same weighted adjacency matrix. This non-uniqueness rais…

This https://arxiv.org/abs/2408.14058 has been replaced.
initial toot: https://mastoxiv.page/@arXi…

Phantom chain simulations for fracture of star polymer networks on the effect of arm molecular weight
This study investigated the fracture of star polymer networks made from prepolymers with various arm molecular weights in the range $2 \leq N_a \leq 0$, for node functionalities $3 \leq f \leq 8$ and conversion ratios $0.6\leqϕ_c\leq0.95$ by phantom chain simulations. The networks were created via end-linking reactions of star polymers dispersed in a simulation box with a fixed monomer density $ρ=8$. The resultant networks were alternatively subjected to energy minimization and uniaxial stret…

Perfect Matching with Few Link Activations
Hugo Mirault, Peter Robinson, Ming Ming Tan, Xianbin Zhu
https://arxiv.org/abs/2506.06102 https://

Perfect Matching with Few Link Activations
We consider the problem of computing a perfect matching problem in a synchronous distributed network, where the network topology corresponds to a complete bipartite graph. The communication between nodes is restricted to activating communication links, which means that instead of sending messages containing a number of bits, each node can only send a pulse over some of its incident links in each round. In the port numbering model, where nodes are unaware of their neighbor's IDs, we give a rando…

Moved the switch power cables to the outside of the rack and used the red "loops" to route the cable down to the PDU. I should have enough space in the basement for the Proxmox node power bricks.
#homelab #minirack

Got my #meshtastic node up on the roof in a temporary location for testing. It's not as high as I'd like, but the sewer vent pipe was the best non-invasive option I had available.
RAK Wisblock 19007 RAK4631, Alfa AOA-915-5ACM 5 dbi antenna, 5000 mAh battery. This should survive a few weeks buried in the snow that Washington never gets.

us_agencies: U.S. government agency websites (2018)
50 networks, one for each U.S. state, representing the web-based links between their associated government agencies websites. A node is an entire agency website and a directed edge (i,j) represents the existence of a hyperlink from any webpage in website i to some webpage in website j. Data was collected with a crawler. Nodes are annotated with the number of webpages per website, website name (related to its government function) and U…

Sensor Fusion Methods for Gaussian Mixture Models
Ishan Paranjape, Islam Hussein, Jeremy Murray-Krezan, Sean Phillips, Suman Chakravorty
https://arxiv.org/abs/2506.00383

Sensor Fusion Methods for Gaussian Mixture Models
Consensus is a popular technique for distributed state estimation. This formulation allows networks of connected agents or sensors to exchange information about the distribution of a set of targets with their immediate neighbors without the need of a centralized node or layer. We present decentralized consensus-based fusion techniques for a system whose target prior estimates are a weighted mixture of Gaussian probability density functions (PDFs) for the following cases: 1) in which all agents …

Distributed gradient methods under heavy-tailed communication noise
Manojlo Vukovic, Dusan Jakovetic, Dragana Bajovic, Soummya Kar
https://arxiv.org/abs/2505.24464

Distributed gradient methods under heavy-tailed communication noise
We consider a standard distributed optimization problem in which networked nodes collaboratively minimize the sum of their locally known convex costs. For this setting, we address for the first time the fundamental problem of design and analysis of distributed methods to solve the above problem when inter-node communication is subject to \emph{heavy-tailed} noise. Heavy-tailed noise is highly relevant and frequently arises in densely deployed wireless sensor and Internet of Things (IoT) network…

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

Cascades on Constrained Multiplex Networks
Christian Kluge, Christian Kuehn
https://arxiv.org/abs/2505.24631 https://arxiv.org/pdf/25…

Cascades on Constrained Multiplex Networks
We consider a version of the Watts cascade model on directed multiplex configuration model networks, and present a detailed analysis of the cascade size, single-seed cascade probability and cascade condition. We then introduce a smaller class of network models that we call constrained multiplex networks, which allows us to induce patterns in the node activity, i.e. in the participation of nodes on different layers. We find that the choice of induced patterns affects the phase transitions of the…

HARNode: A Time-Synchronised, Open-Source, Multi-Device, Wearable System for Ad Hoc Field Studies
Philipp Lepold, Tobias R\"oddiger, Michael Beigl
https://arxiv.org/abs/2506.03219

HARNode: A Time-Synchronised, Open-Source, Multi-Device, Wearable System for Ad Hoc Field Studies
Research into human activity recognition (HAR) suffers from a lack of comprehensive, freely available field data. Commercial systems are rarely open source, offer little expandability, and have shortcomings in node synchronisation, data throughput, placement clarity, setup complexity, and cost. As a result, only a few intuitively placed sensors are often used, and field trials are generally reduced. HARNode addresses these obstacles as a fully open-source hardware and software platform for rapi…

This https://arxiv.org/abs/2410.00023 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Self-Tuning Spectral Clustering for Speaker Diarization
Spectral clustering has proven effective in grouping speech representations for speaker diarization tasks, although post-processing the affinity matrix remains difficult due to the need for careful tuning before constructing the Laplacian. In this study, we present a novel pruning algorithm to create a sparse affinity matrix called spectral clustering on p-neighborhood retained affinity matrix (SC-pNA). Our method improves on node-specific fixed neighbor selection by allowing a variable number …

This https://arxiv.org/abs/2411.04564 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

A Generalisation of Voter Model: Influential Nodes and Convergence Properties
Consider an undirected graph G, representing a social network, where each node is blue or red, corresponding to positive or negative opinion on a topic. In the voter model, in discrete time rounds, each node picks a neighbour uniformly at random and adopts its colour. Despite its significant popularity, this model does not capture some fundamental real-world characteristics such as the difference in the strengths of individuals connections, individuals with neutral opinion on a topic, and indiv…

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

Self-Sustaining Multi-Sensor LoRa-Based Activity Monitoring for Community Workout Parks
Victor Luder, Michele Magno
https://arxiv.org/abs/2506.03203 https:…

Self-Sustaining Multi-Sensor LoRa-Based Activity Monitoring for Community Workout Parks
With the rise of the Internet of Things (IoT), more sensors are deployed around us, covering a wide range of applications from industry and agriculture to urban environments such as smart cities. Throughout these applications the sensors collect data of various characteristics and support city planners and decision-makers in their work processes, ultimately maximizing the impact of public funds. This paper introduces the design and implementation of a self-sustaining wireless sensor node design…

Modeling the Path of Structural Strategic Deterrence: A Sand Table Simulation and Research Report on China's Military-Industrial Capability System against the United States Based on Rare Earth Supply Disconnection
Wei Meng
https://arxiv.org/abs/2505.21579

Modeling the Path of Structural Strategic Deterrence: A Sand Table Simulation and Research Report on China's Military-Industrial Capability System against the United States Based on Rare Earth Supply Disconnection
This study proposes a systematic non-kinetic deterrence path modeling framework based on strategic rare earth supply cut-off, aiming to assess the strategic effects of China's export control policy against the United States at the military system level. The model adopts a four-layer structure of "policy input -- resource node -- equipment system -- capability output" and integrates path dependency modeling, degradation function design, and capability lag prediction mechanisms to form a strategi…

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…

This https://arxiv.org/abs/2505.12304 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

Pre-trained Prompt-driven Community Search
The "pre-train, prompt" paradigm is widely adopted in various graph-based tasks and has shown promising performance in community detection. Most existing semi-supervised community detection algorithms detect communities based on known ones, and the detected communities typically do not contain the given query node. Therefore, they are not suitable for searching the community of a given node. Motivated by this, we adopt this paradigm into the semi-supervised community search for the first time a…

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

This https://arxiv.org/abs/2502.02165 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDC_…

Broadcast in Almost Mixing Time
We study the problem of broadcasting multiple messages in the CONGEST model. In this problem, a dedicated source node $s$ possesses a set $M$ of messages with every message of size $O(\log n)$ where $n$ is the total number of nodes. The objective is to ensure that every node in the network learns all messages in $M$. The execution of an algorithm progresses in rounds, and we focus on optimizing the round complexity of broadcasting multiple messages. Our primary contribution is a randomized al…

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

Energy-Efficient Integrated Communication and Computation via Non-Terrestrial Networks with Uncertainty Awareness
Xiao Tang, Yudan Jiang, Ruonan Zhang, Qinghe Du, Jinxin Liu, Naijin Liu
https://arxiv.org/abs/2506.01243

Energy-Efficient Integrated Communication and Computation via Non-Terrestrial Networks with Uncertainty Awareness
Non-terrestrial network (NTN)-based integrated communication and computation empowers various emerging applications with global coverage. Yet this vision is severely challenged by the energy issue given the limited energy supply of NTN nodes and the energy-consuming nature of communication and computation. In this paper, we investigate the energy-efficient integrated communication and computation for the ground node data through a NTN, incorporating an unmanned aerial vehicle (UAV) and a satell…

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

Supervised Link Prediction in Co-Authorship Networks Based on Author Node-Based Features
Doaa Hassan, Mohammad Al Hasan
https://arxiv.org/abs/2505.21673 ht…

Supervised Link Prediction in Co-Authorship Networks Based on Author Node-Based Features
Predicting the emergence of future research collaborations between authors in academic social networks (SNs) is a very effective example that demonstrates the link prediction problem. This problem refers to predicting the potential existence or absence of a link between a pair of nodes (authors) on the co-authorship network. Various similarity and aggregation metrics were proposed in the literature for predicting the potential link between two authors on such networks. However, the relevant res…

Rethinking Dynamic Networks and Heterogeneous Computing with Automatic Parallelization
Ruilong Wu, Xinjiao Li, Yisu Wang, Xinyu Chen, Dirk Kutscher
https://arxiv.org/abs/2506.02787

Rethinking Dynamic Networks and Heterogeneous Computing with Automatic Parallelization
Hybrid parallelism techniques are essential for efficiently training large language models (LLMs). Nevertheless, current automatic parallel planning frameworks often overlook the simultaneous consideration of node heterogeneity and dynamic network topology changes, limiting their effectiveness in practical applications. In this paper, we address these limitations by modeling heterogeneous nodes within dynamically changing network environments and leveraging simulation-based strategies to determ…

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

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

D-Rex: Heterogeneity-Aware Reliability Framework and Adaptive Algorithms for Distributed Storage
Maxime Gonthier (University of Chicago, Argonne National Laboratory), Dante D. Sanchez-Gallegos (Universidad Carlos III de Madrid), Haochen Pan (University of Chicago), Bogdan Nicolae (Argonne National Laboratory), Sicheng Zhou (Southern University of Science and Technology), Hai Duc Nguyen (University of Chicago, Argonne National Laboratory), Valerie Hayot-Sasson (University of Chicago, Ar…

D-Rex: Heterogeneity-Aware Reliability Framework and Adaptive Algorithms for Distributed Storage
The exponential growth of data necessitates distributed storage models, such as peer-to-peer systems and data federations. While distributed storage can reduce costs and increase reliability, the heterogeneity in storage capacity, I/O performance, and failure rates of storage resources makes their efficient use a challenge. Further, node failures are common and can lead to data unavailability and even data loss. Erasure coding is a common resiliency strategy implemented in storage systems to mi…

spanish_highschools: Spanish high schools (2023)
Directed networks of friendships obtained through a social survey of spanish high school students.
This network has 458 nodes and 7613 edges.
Tags: Social, Offline, Weighted, Metadata
https://networks.skewed.de/net/spanish

us_agencies: U.S. government agency websites (2018)
50 networks, one for each U.S. state, representing the web-based links between their associated government agencies websites. A node is an entire agency website and a directed edge (i,j) represents the existence of a hyperlink from any webpage in website i to some webpage in website j. Data was collected with a crawler. Nodes are annotated with the number of webpages per website, website name (related to its government function) and U…

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

Hybrid Learning for Cold-Start-Aware Microservice Scheduling in Dynamic Edge Environments
Jingxi Lu, Wenhao Li, Jianxiong Guo, Xingjian Ding, Zhiqing Tang, Tian Wang, Weijia Jia
https://arxiv.org/abs/2505.22424

Hybrid Learning for Cold-Start-Aware Microservice Scheduling in Dynamic Edge Environments
With the rapid growth of IoT devices and their diverse workloads, container-based microservices deployed at edge nodes have become a lightweight and scalable solution. However, existing microservice scheduling algorithms often assume static resource availability, which is unrealistic when multiple containers are assigned to an edge node. Besides, containers suffer from cold-start inefficiencies during early-stage training in currently popular reinforcement learning (RL) algorithms. In this pape…

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

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

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

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

Homologous nodes in annotated complex networks
Sung Soo Moon, Sebastian E. Ahnert
https://arxiv.org/abs/2505.23668 https://arxiv.org/…

Homologous nodes in annotated complex networks
Many real-world networks have associated metadata that assigns categorical labels to nodes. Analysis of these annotations can complement the topological analysis of complex networks. Annotated networks have typically been used to evaluate community detection approaches. Here, we introduce an approach that combines the quantitative analysis of annotations and network structure, which groups nodes according to similar distributions of node annotations in their neighbourhoods. Importantly the node…

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…

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…

spanish_highschools: Spanish high schools (2023)
Directed networks of friendships obtained through a social survey of spanish high school students.
This network has 534 nodes and 12812 edges.
Tags: Social, Offline, Weighted, Metadata
https://networks.skewed.de/net/spanish