Analysis of Contractions in System Graphs: Application to State Estimation
Observability and estimation are closely tied to the system structure, which can be visualized as a system graph--a graph that captures the inter-dependencies within the state variables. For example, in social system graphs such inter-dependencies represent the social interactions of different individuals. It was recently shown that contractions, a key concept from graph theory, in the system graph are critical to system observability, as (at least) one state measurement in every contraction is necessary for observability. Thus, the size and number of contractions are critical in recovering for loss of observability. In this paper, the correlation between the average-size/number of contractions and the global clustering coefficient (GCC) of the system graph is studied. Our empirical results show that estimating systems with high GCC requires fewer measurements, and in case of measurement failure, there are fewer possible options to find substitute measurement that recovers the system's observability. This is significant as by tuning the GCC, we can improve the observability properties of large-scale engineered networks, such as social networks and smart grid.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringState EstimationSimilar Papers 제목 키워드 기반
Recovering the Structural Observability of Composite Networks via Cartesian Product
Observability is a fundamental concept in system inference and estimation. This paper is focused on structural observability analysis of Cartesian product networks. Cartesian product networks emerge in variety of applica…
Contractions: To Align or Not to Align, That Is the Question
This paper performs a detailed analysis on the alignment of Portuguese contractions, based on a previously aligned bilingual corpus. The alignment task was performed manually in a subset of the English-Portuguese CLUE4Tr…
Machine TranslationTranslationUterine muscle networks: Connectivity analysis of the EHG during pregnancy and Labor
In this paper, we propose a new framework to analyze the electrical activity of the uterus recorded by electrohysterography (EHG), from abdominal electrodes (a grid of 4x4 electrodes) during pregnancy and labor. We evalu…
Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells
Persistent homology (PH) encodes global information, such as cycles, and is thus increasingly integrated into graph neural networks (GNNs). PH methods in GNNs typically traverse an increasing sequence of subgraphs. In th…
Graph Representation LearningFinite-Time Bounds for Two-Time-Scale Stochastic Approximation with Arbitrary Norm Contractions and Markovian Noise
Two-time-scale Stochastic Approximation (SA) is an iterative algorithm with applications in reinforcement learning and optimization. Prior finite time analysis of such algorithms has focused on fixed point iterations wit…
Q-Learningreinforcement-learningReinforcement Learning