Tootfinder

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.

Historic Tokyo Bridge Liberated from Concrete Overpass Will Shine Again Thanks to Grassroots Campaign https://www.goodnewsnetwork.org/historic-tokyo-bridge-pulled-out-from-under-highway-overpass-following-gra…

Historic Tokyo Bridge Liberated from Concrete Overpass Will Shine Again Thanks to Grassroots Campaign
The Nihonbashi Bridge was considered the first reference node of the entire Japanese national road network at the time. 

Computing Tree Structures in Anonymous Graphs via Mobile Agents
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla
https://arxiv.org/abs/2506.19365 ht…

Computing Tree Structures in Anonymous Graphs via Mobile Agents
Minimum Spanning Tree (MST) and Breadth-First Search (BFS) tree constructions are classical problems in distributed computing, traditionally studied in the message-passing model, where static nodes communicate via messages. This paper investigates MST and BFS tree construction in an agent-based network, where mobile agents explore a graph and compute. Each node hosts one agent, and communication occurs when agents meet at a node. We consider $n$ agents initially dispersed (one per node) in an a…

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

On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
Liyuan Liang, Gan Luo, Kun Yuan
https://arxiv.org/abs/2506.18075

On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
The linear speedup property is essential for demonstrating the advantage of distributed algorithms over their single-node counterparts. In this paper, we study the stochastic Push-Pull method, a widely adopted decentralized optimization algorithm over directed graphs (digraphs). Unlike methods that rely solely on row-stochastic or column-stochastic mixing matrices, Push-Pull avoids nonlinear correction and has shown superior empirical performance across a variety of settings. However, its theor…

In-Memory Sorting-Searching with Cayley Tree
Subrata Paul, Sukanta Das, Biplab K Sikdar
https://arxiv.org/abs/2506.19379 https://arxi…

In-Memory Sorting-Searching with Cayley Tree
This work proposes a computing model to reduce the workload of CPU. It relies on the data intensive computation in memory, where the data reside, and effectively realizes an in-memory computing (IMC) platform. Each memory word, with additional logic, acts as a tiny processing element which forms the node of a Cayley tree. The Cayley tree in turn defines the framework for solving the data intensive computational problems. It finds the solutions for in-memory searching, computing the max (min) in…

Well, after having lots of fun and success #VibeCoding my own #Obsidian clone, I finally went back to Obsidian. Having someone else do the work is great :)
…

GitHub - DennisFaucher/ToastNotes: A simple, browser-based Markdown note-taking app with a modern UI, built using [Toast UI Editor](https://ui.toast.com/tui-editor), Node.js, and Docker. Notes are saved as Markdown files on the server and can be created, edited, renamed, deleted, printed, or exported.
A simple, browser-based Markdown note-taking app with a modern UI, built using [Toast UI Editor](https://ui.toast.com/tui-editor), Node.js, and Docker. Notes are saved as Markdown files on the serv...

STM32-Based IoT Framework for Real-Time Environmental Monitoring and Wireless Node Synchronization
Ahmed Faizul Haque Dhrubo, Sazid Hasan, Mohammad Abdul Qayum
https://arxiv.org/abs/2506.17295

STM32-Based IoT Framework for Real-Time Environmental Monitoring and Wireless Node Synchronization
The fast pace of technological growth has created a heightened need for intelligent, autonomous monitoring systems in a variety of fields, especially in environmental applications. This project shows the design process and implementation of a proper dual node (master-slave) IoT-based monitoring system using STM32F103C8T6 microcontrollers. The structure of the wireless monitoring system studies the environmental conditions in real-time and can measure parameters like temperature, humidity, soil …

Resonances of recurrence time of monitored quantum walks
Ruoyu Yin, Qingyuan Wang, Sabine Tornow, Eli Barkai
https://arxiv.org/abs/2506.19832 https://

Resonances of recurrence time of monitored quantum walks
The recurrence time is the time a process first returns to its initial state. Using quantum walks on a graph, the recurrence time is defined through stroboscopic monitoring of the arrival of the particle to a node of the system. When the time interval between repeated measurements is tuned in such a way that eigenvalues of the unitary become degenerate, the mean recurrence time exhibits resonances. These resonances imply faster mean recurrence times, which were recorded on quantum computers. Th…

Empowering Iterative Graph Alignment Using Heat Diffusion
Boyan Wang, Weijie Feng, Jinyang Huang, Dan Guo, Zhi Liu
https://arxiv.org/abs/2506.17640 https:/…

Empowering Iterative Graph Alignment Using Heat Diffusion
Unsupervised plain graph alignment (UPGA) aims to align corresponding nodes across two graphs without any auxiliary information. Existing UPGA methods rely on structural consistency while neglecting the inherent structural differences in real-world graphs, leading to biased node representations. Moreover, their one-shot alignment strategies lack mechanisms to correct erroneous matches arising from inaccurate anchor seeds. To address these issues, this paper proposes IterAlign, a novel parameter…

Fractality of Wireless Mesh Networks: Dimensional Effects on Network Performance
Marat Zaidyn, Sayat Akhtanov, Dana Turlykozhayeva, Symbat Temesheva, Almat Akhmetali, Alisher Skabylov, Nurzhan Ussipov
https://arxiv.org/abs/2506.19366

Fractality of Wireless Mesh Networks: Dimensional Effects on Network Performance
Wireless mesh networks (WMNs) depend on the spatial distribution of nodes, which directly influences connectivity, routing efficiency, and overall network performance. Conventional models typically assume uniform or random node placement, which inadequately represent the complex, hierarchical spatial patterns observed in practical deployments. In this study, we present a novel algorithm that constructs WMN topologies with tunable fractal dimensions, allowing precise control over spatial self-si…

The Laplacian matrix of weighted threshold graphs
Yingyue Ke, Willem H. Haemers, Piet Van Mieghem
https://arxiv.org/abs/2506.16839 https://

The Laplacian matrix of weighted threshold graphs
Threshold graphs are generated from one node by repeatedly adding a node that links to all existing nodes or adding a node without links. In the weighted threshold graph, we add a new node in step $i$, which is linked to all existing nodes by a link of weight $w_i$. In this work, we consider the set ${\cal A}_N$ that contains all Laplacian matrices of weighted threshold graphs of order $N$. We show that ${\cal A}_N$ forms a commutative algebra. Using this, we find a common basis of eigenvectors…

[Beat-to-beat AV nodal assessment] ECG-based beat-to-beat assessment of AV node conduction properties during AF
Mattias Karlsson, Felix Plappert, Pyotr G Platonov, Sten \"Ostenson, Mikael Wallman, Frida Sandberg
https://arxiv.org/abs/2506.19427

[Beat-to-beat AV nodal assessment] ECG-based beat-to-beat assessment of AV node conduction properties during AF
The refractory period and conduction delay of the atrioventricular (AV) node play a crucial role in regulating the heart rate during atrial fibrillation (AF). Beat-to-beat variations in these properties are known to be induced by the autonomic nervous system (ANS) but have previously not been assessable during AF. Assessing these could provide novel information for improved diagnosis, prognosis, and treatment on an individual basis. To estimate AV nodal conduction properties with beat-to-beat…

Jutro chyba wejdę na Śnieżkę.
Śnieżka: https://www.openstreetmap.org/node/3889241996#map=14/51.44064/16.24380

Jumping between node (my blog) and python (frontmatter changes) today was fun but I made an oops with #activepieces 😂 which then required more python (bulk deletes) which then required making edits to mastodon/config/initializers
/rack_attack.rb
Sorry to those I spammed on the #Fediverse

SEP-GCN: Leveraging Similar Edge Pairs with Temporal and Spatial Contexts for Location-Based Recommender Systems
Tan Loc Nguyen, Tin T. Tran
https://arxiv.org/abs/2506.16003

SEP-GCN: Leveraging Similar Edge Pairs with Temporal and Spatial Contexts for Location-Based Recommender Systems
Recommender systems play a crucial role in enabling personalized content delivery amidst the challenges of information overload and human mobility. Although conventional methods often rely on interaction matrices or graph-based retrieval, recent approaches have sought to exploit contextual signals such as time and location. However, most existing models focus on node-level representation or isolated edge attributes, underutilizing the relational structure between interactions. We propose SEP-GC…

Estimating Multiple Weighted Networks with Node-Sparse Differences and Shared Low-Rank Structure
Hao Yan, Keith Levin
https://arxiv.org/abs/2506.15915 http…

Estimating Multiple Weighted Networks with Node-Sparse Differences and Shared Low-Rank Structure
We study the problem of modeling multiple symmetric, weighted networks defined on a common set of nodes, where networks arise from different groups or conditions. We propose a model in which each network is expressed as the sum of a shared low-rank structure and a node-sparse matrix that captures the differences between conditions. This formulation is motivated by practical scenarios, such as in connectomics, where most nodes share a global connectivity structure while only a few exhibit condit…

A many-body characterization of the fundamental gap in monolayer CrI$_3$
Daniel Staros, Abdulgani Annaberdiyev, Kevin Gasperich, Anouar Benali, Panchapakesan Ganesh, Brenda Rubenstein
https://arxiv.org/abs/2506.17038

A many-body characterization of the fundamental gap in monolayer CrI$_3$
The many-body fixed-node and fixed-phase spin-orbit Diffusion Monte Carlo (DMC) methods are applied to accurately predict the fundamental gap of monolayer CrI$_3$ - the first experimentally-realized 2D material with intrinsic magnetism. The fundamental gap obtained, 2.9(1)~eV, agrees well with the highest peak in optical spectroscopy measurements and a previous $GW$ result. We numerically show that as expected in DMC the same value of the fundamental gap is obtained in the thermodynamic limit u…

A family of graph GOSPA metrics for graphs with different sizes
Jinhao Gu, \'Angel F. Garc\'ia-Fern\'andez, Robert E. Firth, Lennart Svensson
https://arxiv.org/abs/2506.17316

A family of graph GOSPA metrics for graphs with different sizes
This paper proposes a family of graph metrics for measuring distances between graphs of different sizes. The proposed metric family defines a general form of the graph generalised optimal sub-pattern assignment (GOSPA) metric and is also proved to satisfy the metric properties. Similarly to the graph GOSPA metric, the proposed graph GOSPA metric family also penalises the node attribute costs for assigned nodes between the two graphs, and the number of unassigned nodes. However, the proposed fam…

Brain-inspired interpretable reservoir computing with resonant recurrent neural networks
Mark A. Kramer
https://arxiv.org/abs/2506.17083 https://

Brain-inspired interpretable reservoir computing with resonant recurrent neural networks
Traditional artificial neural networks consist of nodes with non-oscillatory dynamics. Biological neural networks, on the other hand, consist of oscillatory components embedded in an oscillatory environment. Motivated by this feature of biological neurons, we describe a reservoir computing framework with explicit damped, oscillatory node dynamics. We express the oscillatory dynamics using two history dependent terms to connect these dynamics with existing artificial neural network approaches an…

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

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

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

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…

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

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

Scalable quantum current source on commercial 22-nm CMOS process technology
Ajit Dash, Suyash Pati Tripathi, Dimitrios Georgakopoulos, MengKe Feng, Steve Yianni, Ensar Vahapoglu, Md Mamunur Rahman, Shai Bonen, Owen Brace, Jonathan Y. Huang, Wee Han Lim, Kok Wai Chan, Will Gilbert, Arne Laucht, Andrea Morello, Andre Saraiva, Christopher C. Escott, Sorin P. Voinigescu, Andrew S. Dzurak, Tuomo Tanttu

Scalable quantum current source on commercial 22-nm CMOS process technology
Utilizing quantum effects in nanoscopic devices has in the past mostly been accessible through academic cleanrooms and research foundries. Opening the quantum frontier for wider industrial applications likely requires the scale of well-established complementary metal-oxide-semiconductor (CMOS) foundries for manufacturing transistor-based quantum devices operable above subkelvin temperatures. Here, we operate a commercial 22-nm-node fully depleted silicon-on-insulator (FDSOI) CMOS device as dual…

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

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

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

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

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

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

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.

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

In Saint Josse ten Noode / Sint Joost ten Node (BXL) finden sich interessante Kulturarrangements.

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

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

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

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

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

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

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

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

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

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

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

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…

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

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

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…

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

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

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…

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…

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…

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

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

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

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

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 …

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

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

projects in the near future:
1. my mac-mini server runs ubuntu server and need apps. I'm thinking about Heimdall and a next cloud instance that I can reach via tailscale. I will also use it as an exit node for my tailscale network.
2. Making the server sleep when not in use and use an old RPi to 'wake it up' also over tailscale.
3. Making a portable router out of a Radxa Rock 4c that also use tailscale as a vpn alternative using the exit node.

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

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

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 307 nodes and 11283 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 1589 nodes and 99347 edges.
Tags: Social, Online, Unweighted, Metadata

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

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

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

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

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

Quantum secret sharing in a triangular superconducting quantum network
Haoxiong Yan, Allen Zang, Joel Grebel, Xuntao Wu, Ming-Han Chou, Gustav Andersson, Christopher R. Conner, Yash J. Joshi, Shiheng Li, Jacob M. Miller, Rhys G. Povey, Hong Qiao, Eric Chitambar, Andrew N. Cleland
https://arxiv.org/abs/2506.10878

Quantum secret sharing in a triangular superconducting quantum network
We present a three-node quantum communication testbed with a triangular topology, each side of the triangle formed by a 1.3-meter-long transmission line. We demonstrate state transfer and entanglement generation between any two nodes, generate genuine multipartite entangled GHZ states, and implement quantum secret sharing (QSS) of classical information. Our experiments show that the QSS protocol can effectively detect eavesdropping, ensuring the secure sharing of secrets. This device forms a te…

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

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

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…

Alright, gonna do a quick test. I have the encode numbers for the `encoderXX` workers running Ubuntu 24.04 LTS and they're not great. Gonna build a node using CachyOS and see if that changes things.
#linux #homelab

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

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

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…

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…

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

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 …

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

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

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…

Things I enjoy: adding a new ring address across the cluster. Since I added the migration network post-cluster creation it couldn't being used by `corosync` in case something tragic happened. Also, it meant that if you added a new node to the cluster it wouldn't verify that the migration network was online on the new node when it brought it into the cluster. However, solved that pretty fast by just adding it as a `ringX` entry (in this case `ring3`) to all the nodes and enabled it…

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

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…

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 …

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'`,…

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 …

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 …

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

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

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

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…

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 …

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

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…

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

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

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

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…

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

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

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

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

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

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

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 …

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 25 nodes and 91 edges.
Tags: Social, Fictional, Weighted

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

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

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…

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…

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…