相关论文: On the reachability and observability of path and …
Observability of an array of identical LTI systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is…
In this paper we investigate the controllability and observability properties of a family of linear dynamical systems, whose structure is induced by the Laplacian of a grid graph. This analysis is motivated by several applications in…
It is well known that if a network topology is a path or line and the states of vertices or nodes evolve according to the consensus policy, then the network is Laplacian controllable by an input connected to its terminal vertex. In this…
In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic graph. Individual edges within this network may fail according…
The probabilistic graphs framework models the uncertainty inherent in real-world domains by means of probabilistic edges whose value quantifies the likelihood of the edge existence or the strength of the link it represents. The goal of this…
This paper continues the study of local detectability and observability requirements on components of distributed observers networks to ensure detectability properties of the network. First, we present a sketch of an elementary proof of the…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
A dynamical network, a graph whose nodes are dynamical systems, is usually characterized by a large dimensional space which is not always accesible due to the impossibility of measuring all the variables spanning the state space. Therefore,…
Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…
We use real-world contact sequences, time-ordered lists of contacts from one person to another, to study how fast information or disease can spread across network of contacts. Specifically we measure the reachability time -- the average…
The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility,…
An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his…
Let $P$ be a set of $n$ points in the plane where each point $p$ of $P$ is associated with a radius $r_p>0$.The transmission graph $G=(P,E)$ of $P$ is defined as the directed graph such that $E$ contains an edge from $p$ to $q$ if and only…
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet strict criteria. Since such graphs nevertheless seem to…
An accessibility graph of a network contains a link, wherever there is a path of arbitrary length between two nodes. We generalize the concept of accessibility to temporal networks. Building an accessibility graph by consecutively adding…
Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…
Reachability and other path-based measures on temporal graphs can be used to understand spread of infection, information, and people in modelled systems. Due to delays and errors in reporting, temporal graphs derived from data are unlikely…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
In this paper, we study networks of discrete-time linear time-invariant subsystems. Our focus is on situations where subsystems are connected to each other through a time-invariant topology and where there exists a base-station whose aim is…
Network properties govern the rate and extent of various spreading processes, from simple contagions to complex cascades. Recently, the analysis of spreading processes has been extended from static networks to temporal networks, where nodes…