Related papers: Non-associative key establishment for left distrib…
In this article, we propose the use of partitioning and clustering methods as an alternative to Gaussian quadrature for stochastic collocation. The key idea is to use cluster centers as the nodes for collocation. In this way, we can extend…
Finding an optimal key assignment (subject to given constraints) for a key predistribution scheme in wireless sensor networks is a difficult task. Hence, most of the practical schemes are based on probabilistic key assignment, which leads…
Analyzing the geometry of correlation sets constrained by general causal structures is of paramount importance for foundational and quantum technology research. Addressing this task is generally challenging, prompting the development of…
Unambiguous state discrimination (USD) is one of the major obstacles for practical quantum key distribution (QKD). Often overlooked, it allows efficient eavesdropping in majority of practical systems, provided the overall channel loss is…
We consider probability distributions with constant rate on partially ordered sets, generalizing distributions in the usual reliability setting that have constant failure rate. In spite of the minimal algebraic structure, there is a…
This paper gives convex conditions for synthesis of a distributed control system for large-scale networked nonlinear dynamic systems. It is shown that the technique of control contraction metrics (CCMs) can be extended to this problem by…
Conformal field theories with sl(2)_{-1/2} symmetry are studied with a view to investigating logarithmic structures. Applying the parafermionic coset construction to the non-logarithmic theory, a part of the structure of the triplet model…
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…
In this talk the class of multi-fields reductions of the KP and super-KP hierarchies (leading to non-purely differential Lax operators) is revisited from the point of view of coset construction. This means in particular that all the…
We introduce the concept of a semigroup coupled cell network and show that the collection of semigroup network vector fields forms a Lie algebra. This implies that near a dynamical equilibrium the local normal form of a semigroup network is…
A "biased expansion" of a graph is a kind of branched covering graph with additional structure related to combinatorial homotopy of circles. Some but not all biased expansions are constructed from groups ("group expansions"); these include…
This paper is the first of a sequence papers ([Z4]--[Z7]) on the {\it ${\mathcal N}$CS $(\text{noncommutative symmetric})$ systems} over differential operator algebras in commutative or noncommutative variables ([Z4]); the ${\mathcal N}$CS…
We define a new homotopy algebraic structure, that we call a braided $L_\infty$-algebra, and use it to systematically construct a new class of noncommutative field theories, that we call braided field theories. Braided field theories have…
This paper presents a new Bayesian non-parametric model by extending the usage of Hierarchical Dirichlet Allocation to extract tree structured word clusters from text data. The inference algorithm of the model collects words in a cluster if…
Key establishment is a crucial primitive for building secure channels: in a multi-party setting, it allows two parties using only public authenticated communication to establish a secret session key which can be used to encrypt messages.…
We study the problem of leader selection in leader-follower multi-agent systems that are subject to stochastic disturbances. This problem arises in applications such as vehicle formation control, distributed clock synchronization, and…
A new method for analyzing high-dimensional categorical data, Linear Latent Structure (LLS) analysis, is presented. LLS models belong to the family of latent structure models, which are mixture distribution models constrained to satisfy the…
The paper studies distributed Dictionary Learning (DL) problems where the learning task is distributed over a multi-agent network with time-varying (nonsymmetric) connectivity. This formulation is relevant, for instance, in big-data…
We consider the Eschenauer-Gligor key predistribution scheme under the condition of partial visibility with i.i.d. on-off links between pairs of nodes. This situation is modeled as the intersection of two random graphs, namely a random key…
We here present the rate analysis and a proof of principle realization of a device-independent quantum key distribution (QKD) protocol requiring the lowest detection efficiency necessary to achieve a secure key compared to…