English
Related papers

Related papers: Failure Localization Capability: Theorem Proof and…

200 papers

In applications such as seismic acquisition, the position information of sensor nodes, that are deployed in a linear topology, is desired with sub-meter accuracy in the presence of a limited number of anchor nodes. This can be achieved with…

Signal Processing · Electrical Eng. & Systems 2020-07-13 V. A. Reddy , A. Bazzi , G. L. Stuber , S. Al-Dharrab , W. Mesbah , A. H. Muqaibel

This manuscript summarizes the work and showcases the impact of the doctoral thesis by introducing novel, cost-efficient methods for assessing and enhancing the reliability of DNN hardware accelerators. A comprehensive Systematic Literature…

Hardware Architecture · Computer Science 2026-03-11 Mahdi Taheri

We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the…

Discrete Mathematics · Computer Science 2018-09-10 Jianan Zhang , Eytan Modiano

This paper reviews the main network analysis methods used to measure structural power, which refers to the ability to shape outcomes through network position and influence, and the ability to affect others through network connections. These…

Climate change increases the number of extreme weather events (wind and snowstorms, heavy rains, wildfires) that compromise power system reliability and lead to multiple equipment failures. Real-time and accurate detecting of potential line…

Signal Processing · Electrical Eng. & Systems 2022-09-05 Aleksandra Burashnikova , Wenting Li , Massih Amini , Deepjoyti Deka , Yury Maximov

We study verification (decision) problems for graph properties in distributed networks under the locally checkable labeling framework, where nodes use labels (proofs) and local neighborhoods to decide acceptance or rejection. Our focus is…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-24 Paweł Garncarek , Tomasz Jurdzinski , Dariusz Kowalski , Subhajit Pramanick

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

Combinatorics · Mathematics 2012-07-11 Reinhard Diestel

Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving…

Physics and Society · Physics 2015-05-20 Linyuan Lu , Tao Zhou

Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…

Discrete Mathematics · Computer Science 2026-04-14 Hande Tuncel Golpek , Mehmet Ali Bilici , Aysun Aytac

Personalized learning systems are almost universally designed around a single objective: help people acquire knowledge and skills more efficiently. We argue this framing misses the more consequential problem. The most damaging failures in…

Artificial Intelligence · Computer Science 2026-04-14 Yuan Sun , Hong Yi , Jinyuan Liu

Localization phenomena permeate many branches of physics playing a fundamental role on dynamical processes evolving on heterogeneous networks. These localization analyses are frequently grounded, for example, on eigenvectors of adjacency or…

Physics and Society · Physics 2020-11-24 Diogo H. Silva , Silvio C. Ferreira

Fault Tree (FT) is a standard failure modeling technique that has been extensively used to predict reliability, availability and safety of many complex engineering systems. In order to facilitate the formal analysis of FT based analyses, a…

Logic in Computer Science · Computer Science 2016-08-24 Waqar Ahmed , Osman Hasan

This technical report provides proofs for the claims in the paper "A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments".

Information Theory · Computer Science 2025-06-13 Philipp Bär , Moe T. Wynn , Sander J. J. Leemans

We study maximal identifiability, a measure recently introduced in Boolean Network Tomography to characterize networks' capability to localize failure nodes in end-to-end path measurements. We prove tight upper and lower bounds on the…

Data Structures and Algorithms · Computer Science 2019-10-25 Nicola Galesi , Fariba Ranjbar

In this paper we consider the question of sensor network coverage for a 2-dimensional domain. We seek to compute the probability that a set of sensors fails to cover given only non-metric, local (who is talking to whom) information and a…

Computational Geometry · Computer Science 2016-04-12 Elizabeth Munch , Michael Shapiro , John Harer

We continue the work of [4, 2, 3], in which we discuss published assertions that are incorrect or incorrectly proven; that are severely limited or reduce to triviality; or that we improve upon.

Geometric Topology · Mathematics 2020-01-31 Laurence Boxer

Discussion of "Feature Matching in Time Series Modeling" by Y. Xia and H. Tong [arXiv:1104.3073]

Methodology · Statistics 2012-01-09 Qiwei Yao

Discussion of "Feature Matching in Time Series Modeling" by Y. Xia and H. Tong [arXiv:1104.3073]

Methodology · Statistics 2012-01-09 Edward L. Ionides

Discussion of "Feature Matching in Time Series Modeling" by Y. Xia and H. Tong [arXiv:1104.3073]

Methodology · Statistics 2012-01-09 Kung-Sik Chan , Ruey S. Tsay

Discussion of "Feature Matching in Time Series Modeling" by Y. Xia and H. Tong [arXiv:1104.3073]

Methodology · Statistics 2012-01-09 Bruce E. Hansen