Related papers: Link Identifiability with Two Monitors: Proof of S…
This is a perspective on "k-stretchability of entanglement, and the duality of k-separability and k-producibility" by Szil\'ard Szalay, published in Quantum 3, 204 (2019).
Rejoinder: Monitoring Networked Applications With Incremental Quantile Estimation [arXiv:0708.0302]
In 2006 Qian [J. Qian, Degree complete graphs; Discrete Mathematics 306 (2006), 533--537] introduced the concept of degree complete graphs for labeled graphs. He also gave a characterization of these graphs in terms of two forbidden…
Over the past years, embedding learning on networks has shown tremendous results in link prediction tasks for complex systems, with a wide range of real-life applications. Learning a representation for each node in a knowledge graph allows…
An outline of recent work on complex networks is given from the point of view of a physicist. Motivation, achievements and goals are discussed with some of the typical applications from a wide range of academic fields. An introduction to…
In this paper, we show how informativity and identifiability for networks of dynamical systems can be investigated using Gr\"obner bases. We provide a sufficient condition for informativity in terms of positive definiteness of the spectrum…
It is well known how the linking number and framing can be extracted from the degree 1 part of the (framed) Kontsevich integral. This note gives a general formula expressing any product of powers of these two invariants as combination of…
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…
We give a new and short proof of a theorem on k-hypertournament losing scores due to Zhou et al. [G. Zhou, T. Yao, K. Zhang, On score sequences of k-tournaments, European J. Comb., 21, 8 (2000) 993-1000.]
This is a short note that formally presents the matching model for the theoretical study of self-adjusting networks as initially proposed in [1].
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and…
In the article "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.2643-2654), published in 2001, we studied the linearizability problem for 3-webs on a 2-dimensional manifold. Four years after the publication of our…
Many studies have sought to identify interdisciplinary research as a function of the diversity of disciplines identified in an article's references or citations. However, given the constant evolution of the scientific landscape,…
I show that the conclusions of [Hwang, Chavez, Amann, & Boccaletti, PRL 94, 138701 (2005); Chavez, Hwang, Amann, Hentschel, & Boccaletti, PRL 94, 218701 (2005)] are closely related to those of previous publications.
Fully connected quantum networks enable scalable quantum communication, yet reliable entanglement characterization without trusting measurement devices remains challenging. Here we experimentally demonstrate measurement-device-independent…
We present a geometric proof for the duality theorem of linear programming. Besides being self-contained and simple, the present approach also provides a transparent way for understanding this fundamental result.
Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…
This paper has been submitted to Science. It summarizes the experimental evidence for (and against) the interlayer theory. It was delayed in posting by clerical error.
An argument of Y. Nikonorov completes the proof of Theorem 2.5 in "Bounded Isometries and Homogeneous Quotients", JGA 27 (2017), 56--64 [arXiv:1502.04276].
The paper investigates epistemic properties of information flow under communication protocols with a given topological structure of the communication network. The main result is a sound and complete logical system that describes all such…