Cascaded Coded Distributed Computing on Heterogeneous Networks

Coded distributed computing (CDC) introduced by Li et al. in 2015 offers an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. For the more general cascaded CDC, Map computations are repeated at $r$ nodes to significantly reduce the communication load among nodes tasked with computing $Q$ Reduce functions $s$ times. While an achievable cascaded CDC scheme was proposed, it only operates on homogeneous networks, where the storage, computation load and communication load of each computing node is the same. In this paper, we address this limitation by proposing a novel combinatorial design which operates on heterogeneous networks where nodes have varying storage and computing capabilities. We provide an analytical characterization of the computation-communication trade-off and show that it is optimal within a constant factor and could outperform the state-of-the-art homogeneous schemes.Comment: Submitted to ISIT 201

Towards Practical File Packetizations in Wireless Device-to-Device Caching Networks

We consider wireless device-to-device (D2D) caching networks with single-hop transmissions. Previous work has demonstrated that caching and coded multicasting can significantly increase per user throughput. However, the state-of-the-art coded caching schemes for D2D networks are generally impractical because content files are partitioned into an exponential number of packets with respect to the number of users if both library and memory sizes are fixed. In this paper, we present two combinatorial approaches of D2D coded caching network design with reduced packetizations and desired throughput gain compared to the conventional uncoded unicasting. The first approach uses a "hypercube" design, where each user caches a "hyperplane" in this hypercube and the intersections of "hyperplanes" represent coded multicasting codewords. In addition, we extend the hypercube approach to a decentralized design. The second approach uses the Ruzsa-Szem\'eredi graph to define the cache placement. Disjoint matchings on this graph represent coded multicasting codewords. Both approaches yield an exponential reduction of packetizations while providing a per-user throughput that is comparable to the state-of-the-art designs in the literature. Furthermore, we apply spatial reuse to the new D2D network designs to further reduce the required packetizations and significantly improve per user throughput for some parameter regimes.Comment: 32 pages, 5 figure

Modeling Dynamic Transport Network with Matrix Factor Models: with an Application to International Trade Flow

International trade research plays an important role to inform trade policy and shed light on wider issues relating to poverty, development, migration, productivity, and economy. With recent advances in information technology, global and regional agencies distribute an enormous amount of internationally comparable trading data among a large number of countries over time, providing a goldmine for empirical analysis of international trade. Meanwhile, an array of new statistical methods are recently developed for dynamic network analysis. However, these advanced methods have not been utilized for analyzing such massive dynamic cross-country trading data. International trade data can be viewed as a dynamic transport network because it emphasizes the amount of goods moving across a network. Most literature on dynamic network analysis concentrates on the connectivity network that focuses on link formation or deformation rather than the transport moving across the network. We take a different perspective from the pervasive node-and-edge level modeling: the dynamic transport network is modeled as a time series of relational matrices. We adopt a matrix factor model of \cite{wang2018factor}, with a specific interpretation for the dynamic transport network. Under the model, the observed surface network is assumed to be driven by a latent dynamic transport network with lower dimensions. The proposed method is able to unveil the latent dynamic structure and achieve the objective of dimension reduction. We applied the proposed framework and methodology to a data set of monthly trading volumes among 24 countries and regions from 1982 to 2015. Our findings shed light on trading hubs, centrality, trends and patterns of international trade and show matching change points to trading policies. The dataset also provides a fertile ground for future research on international trade.Comment: arXiv admin note: text overlap with arXiv:1710.0632

Private Information Retrieval from Heterogeneous Uncoded Storage Constrained Databases with Reduced Sub-Messages

We propose capacity-achieving schemes for private information retrieval (PIR) from uncoded databases (DBs) with both homogeneous and heterogeneous storage constraints. In the PIR setting, a user queries a set of DBs to privately download a message, where privacy implies that no one DB can infer which message the user desires. In general, a PIR scheme is comprised of storage placement and delivery designs. Previous works have derived the capacity, or infimum download cost, of PIR with uncoded storage placement and also sufficient conditions of a storage placement design to meet capacity. However, the currently proposed storage placement designs require splitting each message into an exponential number of sub-messages with respect to the number of DBs. In this work, when DBs have the same storage constraint, we propose two simple storage placement designs that satisfy the capacity conditions. Then, for more general heterogeneous storage constraints, we translate the storage placement design process into a "filling problem". We design an iterative algorithm to solve the filling problem where, in each iteration, messages are partitioned into sub-messages and stored at subsets of DBs. All of our proposed storage placement designs require a number of sub-messages per message at most equal to the number of DBs.Comment: arXiv admin note: text overlap with arXiv:1901.0749

Factor Models for High-Dimensional Dynamic Networks: with Application to International Trade Flow Time Series 1981-2015

Dynamic network analysis has found an increasing interest in the literature because of the importance of different kinds of dynamic social networks, biological networks, and economic networks. Most available probability and statistical models for dynamic network data are deduced from random graph theory where the networks are characterized on the node and edge level. They are often very restrictive for applications and unscalable to high-dimensional dynamic network data which is very common nowadays. In this paper, we take a different perspective: The evolving sequence of networks are treated as a time series of network matrices. We adopt a matrix factor model where the observed surface dynamic network is assumed to be driven by a latent dynamic network with lower dimensions. The linear relationship between the surface network and the latent network is characterized by unknown but deterministic loading matrices. The latent network and the corresponding loadings are estimated via an eigenanalysis of a positive definite matrix constructed from the auto-cross-covariances of the network times series, thus capturing the dynamics presenting in the network. The proposed method is able to unveil the latent dynamic structure and achieve the objective of dimension reduction. Different from other dynamic network analytical methods that build on latent variables, our approach imposes neither any distributional assumptions on the underlying network nor any parametric forms on its covariance function. The latent network is learned directly from the data with little subjective input. We applied the proposed method to the monthly international trade flow data from 1981 to 2015. The results unveil an interesting evolution of the latent trading network and the relations between the latent entities and the countries

Coded Distributed Computing with Heterogeneous Function Assignments

Coded distributed computing (CDC) introduced by Li et. al. is an effective technique to trade computation load for communication load in a MapReduce framework. CDC achieves an optimal trade-off by duplicating map computations at $r$ computing nodes to yield multicasting opportunities such that $r$ nodes are served simultaneously in the Shuffle phase. However, in general, the state-of-the-art CDC scheme is mainly designed only for homogeneous networks, where the computing nodes are assumed to have the same storage, computation and communication capabilities. In this work, we explore two novel approaches of heterogeneous CDC design. First, we study CDC schemes which operate on multiple, collaborating homogeneous computing networks. Second, we allow heterogeneous function assignment in the CDC design, where nodes are assigned a varying number of reduce functions. Finally, we propose an expandable heterogeneous CDC scheme where $r-1$ nodes are served simultaneously in the Shuffle phase. In comparison to the state-of-the-art homogeneous CDC scheme with an equivalent computation load, we find our newly proposed heterogeneous CDC scheme has a smaller communication load in some cases

Representations of bicircular lift matroids

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are minimal with respect to this property. The main result of this paper is a characterization of when two graphs give rise to the same bicircular lift matoid, which answers a question proposed by Irene Pivotto. In particular, aside from some appropriately defined "small" graphs, two graphs have the same bicircular lift matroid if and only if they are $2$-isomorphic in the sense of Whitney

Valence quark distributions of the proton from maximum entropy approach

We present an attempt of maximum entropy principle to determine valence quark distributions in the proton at very low resolution scale $Q_0^2$. The initial three valence quark distributions are obtained with limited dynamical information from quark model and QCD theory. Valence quark distributions from this method are compared to the lepton deep inelastic scattering data, and the widely used CT10 and MSTW08 data sets. The obtained valence quark distributions are consistent with experimental observations and the latest global fits of PDFs. Maximum entropy method is expected to be particularly useful in the case where relatively little information from QCD calculation is given.Comment: 6 pages, 6 figure

Threshold factor models for high-dimensional time series

We consider a threshold factor model for high-dimensional time series in which the dynamics of the time series is assumed to switch between different regimes according to the value of a threshold variable. This is an extension of threshold modeling to a high-dimensional time series setting under a factor structure. Specifically, within each threshold regime, the time series is assumed to follow a factor model. The regime switching mechanism creates structural change in the factor loading matrices. It provides flexibility in dealing with situations that the underlying states may be changing over time, as often observed in economic time series and other applications. We develop the procedures for the estimation of the loading spaces, the number of factors and the threshold value, as well as the identification of the threshold variable, which governs the regime change mechanism. The theoretical properties are investigated. Simulated and real data examples are presented to illustrate the performance of the proposed method

Biased graphs with no two vertex-disjoint unbalanced cycles

Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general, describing signed graphs with no two vertex-disjoint negative cycles. A biased graph is a graph with a distinguished set of cycles (called balanced) with the property that any theta subgraph does not contain exactly two balanced cycles. In this paper we characterise the structure of biased graphs with no two vertex-disjoint unbalanced cycles, answering a question by Zaslavsky and generalising the results of Lov\'asz and Slilaty