Related papers: Partial Network Identifiability: Theorem Proof and…
This technical report provides proofs for the claims in the paper "A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments".
The network of networks(NON) research is focused on studying the properties of n interdependent networks which is ubiquitous in the real world. Identifying the influential nodes in the network of networks is theoretical and practical…
We first present a determinant inequality related to partial traces for positive semidefinite block matrices. Our result extends a result of Lin [Czech. Math. J. 66 (2016)] and improves a result of Kuai [Linear Multilinear Algebra 66…
This paper deals with the design of Excitation and Measurement Patterns (EMPs) for the identification of dynamical networks, when the objective is to identify only a subnetwork embedded in a larger network. Recent results have shown how to…
In this paper, we prove the existence of fundamental relations between information theory and estimation theory for network-coded flows. When the network is represented by a directed graph G=(V, E) and under the assumption of uncorrelated…
In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs.…
Quantum nonlocality can be demonstrated without inputs (i.e. each party using a fixed measurement setting) in a network with independent sources. Here we consider this effect on ring networks, and show that the underlying quantum strategy…
This paper extends previous work with network fragments and situation-specific network construction. We formally define the asymmetry network, an alternative representation for a conditional probability table. We also present an…
In the paper are proved theorems, which amplify the results of my paper "On the difference equation of Poincare type (Part 3)", Max-Plank-Institut fuer Mathematik, Bonn, Preprint Series, 2004, 09, 1-34.
Tensor networks provide extremely powerful tools for the study of complex classical and quantum many-body problems. Over the last two decades, the increment in the number of techniques and applications has been relentless, and especially…
This paper introduces a novel problem, distributional information embedding, motivated by the practical demands of multi-bit watermarking for large language models (LLMs). Unlike traditional information embedding, which embeds information…
Identifiability of a single module in a network of transfer functions is determined by whether a particular transfer function in the network can be uniquely distinguished within a network model set, on the basis of data. Whereas previous…
When neural networks are employed for high-stakes decision-making, it is desirable that they provide explanations for their prediction in order for us to understand the features that have contributed to the decision. At the same time, it is…
In this note, we prove a conjecture proposed by Tao Zhang, Shuxing Li, Tao Feng and Gennian Ge, IEEE Transaction on Information Theory, vol. 60, no. 5, May 2014. This conjecture is about the cross correlation distribution of ternary…
With the widespread use of information technologies, information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks,…
We derive a general framework that connects every positive map with a corresponding witness for partial separability in multipartite quantum systems. We show that many previous approaches were intimately connected to the witnesses derived…
As machine learning technology gets applied to actual products and solutions, new challenges have emerged. Models unexpectedly fail to generalize to small changes in the distribution, tend to be confident on novel data they have never seen,…
Our objective in this note is to comment briefly on the newly emerging literature on computer-aided proofs in Social Choice Theory. We shall specifically comment on two papers, one by Tang and Lin (2009) and another by Geist and Endriss…
Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is…
We propose a novel method for network inference from partially observed edges using a node-specific degree prior. The degree prior is derived from observed edges in the network to be inferred, and its hyper-parameters are determined by…