Related papers: Fundamental Theories in Node Failure Localization

Persistent homology has recently emerged as a powerful technique in topological data analysis for analyzing the emergence and disappearance of topological features throughout a filtered space, shown via persistence diagrams. Additionally,…

Robustness in response to unexpected events is always desirable for real-world networks. To improve the robustness of any networked system, it is important to analyze vulnerability to external perturbation such as random failures or…

Motivated by the growing number of mobile devices capable of connecting and exchanging messages, we propose a methodology aiming to model and analyze node mobility in networks. We note that many existing solutions in the literature rely on…

Motivated in part by understanding average case analysis of fundamental algorithms in computer science, and in part by the wide array of network data available over the last decade, a variety of random graph models, with corresponding…

In this paper, we take a unified approach for network information theory and prove a coding theorem, which can recover most of the achievability results in network information theory that are based on random coding. The final single-letter…

Present theoretical predictions for the entanglement entropy through topological defects are violated by numerical simulations. In order to resolve this, we introduce a paradigm shift in the preparation of reduced density matrices in the…

As robotic systems become increasingly integrated into real-world environments, ranging from autonomous vehicles to household assistants, they inevitably encounter diverse and unstructured scenarios that lead to failures. While such…

This technical report accompanies the following three papers. It contains the computations necessary to verify some of the results claimed in those papers. [1] Carolyn Chun, Deborah Chun, Dillon Mayhew, and Stefan H. M. van Zwam.…

The vivid success of the emerging wireless sensor technology (WSN) gave rise to the notion of localization in the communications field. Indeed, the interest in localization grew further with the proliferation of the wireless sensor network…

Networks in nature do not act in isolation but instead exchange information, and depend on each other to function properly. An incipient theory of Networks of Networks have shown that connected random networks may very easily result in…

We address the problem of localising a mobile terminal ("blind" node) in unknown position from a set of "anchor" nodes in known positions. The proposed method does not require any form of node synchronisation nor measurement (or control) of…

This paper introduces a method for detecting, estimating, and localising a soft fault in wired communication networks. The proposed method is based on analysing the transmission coefficients (TC) in the time domain under both fault-free and…

The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…

Accurate and robust localization is a critical enabler for emerging 5G and 6G applications, including autonomous driving, extended reality (XR), and smart manufacturing. While data-driven approaches have shown promise, most existing models…

We point out some major technical and conceptual mistakes which invalidate the conclusion drawn in "Anyonic braiding in optical lattices" by C. Zhang, V. W. Scarola, S. Tewari, and S. Das Sarma published in PNAS 104, 18415 (2007).

Large-scale decentralized learning frameworks such as federated learning (FL), require both communication efficiency and strong data security, motivating the study of secure aggregation (SA). While information-theoretic SA is well…

We respond briefly to a comment [1, arXiv:2110.15493] recently posted online on our paper [2, arXiv:2108.07893]. Complete and cluster synchronization of random networks is undoubtedly a topic of interest in the Physics, Engineering, and…

In order to provide a high resilience and to react quickly to link failures, modern computer networks support fully decentralized flow rerouting, also known as local fast failover. In a nutshell, the task of a local fast failover algorithm…

Network failure diagnosis is challenging yet critical for high-performance computing (HPC) systems. Existing methods cannot be directly applied to HPC scenarios due to data heterogeneity and lack of accuracy. This paper proposes a novel…

From data centers to IoT devices to Internet-based applications, overlay networks have become an important part of modern computing. Many of these overlay networks operate in fragile environments where processes are susceptible to faults…