Related papers: Probing graph topology from local quantum measurem…
With the constant flow of data from vast sources over the past decades, a plethora of advanced analytical techniques have been developed to extract relevant information from different data types ranging from labeled data, quasi-labeled…
In order to detect patterns in real networks, randomized graph ensembles that preserve only part of the topology of an observed network are systematically used as fundamental null models. However, their generation is still problematic. The…
The results of local measurements on some composite quantum systems cannot be reproduced classically. This impossibility, known as quantum nonlocality, represents a milestone in the foundations of quantum theory. Quantum nonlocality is also…
Inferring the network topology from the dynamics is a fundamental problem with wide applications in geology, biology and even counter-terrorism. Based on the propagation process, we present a simple method to uncover the network topology.…
Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques,…
Quantum state tomography is a daunting challenge of experimental quantum computing even in moderate system size. One way to boost the efficiency of state tomography is via local measurements on reduced density matrices, but the…
We study the problem of inferring network topology from information cascades, in which the amount of time taken for information to diffuse across an edge in the network follows an unknown distribution. Unlike previous studies, which assume…
We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…
The initialization of a quantum system into a certain state is a crucial aspect of quantum information science. While a variety of measurement strategies have been developed to characterize how well the system is initialized, for a given…
We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…
Network architecture design is very important for the optimization of industrial networks. The type of network architecture can be divided into small-scale network and large-scale network according to its scale. Graph theory is an efficient…
Quantum networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to…
This work focuses on the identifiability of dynamical networks with partial excitation and measurement: a set of nodes are interconnected by unknown transfer functions according to a known topology, some nodes are subject to external…
Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the…
Characterization of real-world complex systems increasingly involves the study of their topological structure using graph theory. Among global network properties, small-world property, consisting in existence of relatively short paths…
Understanding topological features in networks is crucial for unravelling complex phenomena across fields such as neuroscience, condensed matter, and high-energy physics. However, identifying higher-order topological structures -- such as…
Subgraph counts - in particular the number of occurrences of small shapes such as triangles - characterize properties of random networks, and as a result have seen wide use as network summary statistics. However, subgraphs are typically…
We solve the problem of identifying (reconstructing) network topology from steady state network measurements. Concretely, given only a data matrix $\mathbf{X}$ where the $X_{ij}$ entry corresponds to flow in edge $i$ in configuration…
Complex interconnections between information technology and digital control systems have significantly increased cybersecurity vulnerabilities in smart grids. Cyberattacks involving data integrity can be very disruptive because of their…
Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely…