Related papers: Pattern generation problems arising in multiplicat…
We present a method to derive an upper bound for the entropy density of coupled map lattices with local interactions from local observations. To do this, we use an embedding technique being a combination of time delay and spatial embedding.…
We consider entangled state production utilizing a full optomechanical arrangement, based on which we create entanglement between two far three-level V-type atoms using a quantum repeater protocol. At first, we consider eight identical…
This work has two contributions. The first one is extending the Large Deviation Principle for uniform hyper-graphons from Lubetzky and Zhao \cite{lubetzky2015replica} to the multi-relational setting where each hyper-graphon can have…
We calculate the entanglement entropy of a non-contiguous subsystem of a chain of free fermions. The starting point is a formula suggested by Jin and Korepin, \texttt{arXiv:1104.1004}, for the reduced density of states of two disjoint…
We study the entropy production rate in systems described by linear Langevin equations, containing mixed even and odd variables under time reversal. Exact formulas are derived for several important quantities in terms only of the means and…
Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…
Motivated by the established notion of storage codes, we consider sets of infinite sequences over a finite alphabet such that every $k$-tuple of consecutive entries is uniquely recoverable from its $l$-neighborhood in the sequence. We…
This paper deals with a distributed Mixed-Integer Linear Programming (MILP) set-up arising in several control applications. Agents of a network aim to minimize the sum of local linear cost functions subject to both individual constraints…
Mixed integer predictive control deals with optimizing integer and real control variables over a receding horizon. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this…
Consider a rectangular matrix describing some type of communication or transportation between a set of origins and a set of destinations, or a classification of objects by two attributes. The problem is to infer the entries of the matrix…
Multilayer networks are a powerful paradigm to model complex systems, where multiple relations occur between the same entities. Despite the keen interest in a variety of tasks, algorithms, and analyses in this type of network, the problem…
On a fine grained scale the Gibbs entropy of an isolated system remains constant throughout its dynamical evolution. This is a consequence of Liouville's theorem for Hamiltonian systems and appears to contradict the second law of…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
Based on Jaynes' maximum entropy principle, exponential random graphs provide a family of principled models that allow the prediction of network properties as constrained by empirical data (observables). However, their use is often hindered…
We develop large sample theory for merged data from multiple sources. Main statistical issues treated in this paper are (1) the same unit potentially appears in multiple datasets from overlapping data sources, (2) duplicated items are not…
A new method for the statistical analysis of 3D point processes, based on the family of Minkowski functionals, is explained and applied to modelled galaxy distributions generated by a toy-model and cosmological simulations of the…
We discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
Line intensity mapping is emerging as a novel method that can measure the collective intensity fluctuations of atomic/molecular line emission from distant galaxies. Several observational programs with various wavelengths are ongoing and…
We propose an algorithmic procedure i) to study the ``distance'' between an integrable PDE and any discretization of it, in the small lattice spacing epsilon regime, and, at the same time, ii) to test the (asymptotic) integrability…