String Network from M-theory

We study the three string junctions and string networks in Type IIB string theory by explicity constructing the holomorphic embeddings of the M-theory membrane that describe such configurations. The main feature of them such as supersymmetry, charge conservation and balance of tensions are derived in a more unified manner. We calculate the energy of the string junction and show that there is no binding energy associated with the junction.Comment: 16 pages, harvmac, 2 figures, references adde

Microscopic theory of network glasses

A molecular theory of the glass transition of network forming liquids is developed using a combination of self-consistent phonon and liquid state approaches. Both the dynamical transition and the entropy crisis characteristic of random first order transitions are mapped out as a function of the degree of bonding and the density. Using a scaling relation for a soft-core model to crudely translate the densities into temperatures, the theory predicts that the ratio of the dynamical transition temperature to the laboratory transition temperature rises as the degree of bonding increases, while the Kauzmann temperature falls relative to the laboratory transition. These results indicate why highly coordinated liquids should be "strong" while van der Waals liquids without coordination are "fragile".Comment: slightly revised version that has been accepted for publication in Phys. Rev. Let

Lecture Notes on Network Information Theory

These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/

What do we need to add to a social network to get a society? answer: something like what we have to add to a spatial network to get a city

Recent years have seen great advances in social network analysis. Yet, with a few exceptions, the field of network analysis remains remote from social theory. As a result, much social network research, while technically accomplished and theoretically suggestive, is essentially descriptive. How then can social networks be linked to social theory ? Here we pose the question in its simplest form: what must we add to a social network to get a society ? We begin by showing that one reason for the disconnection between network theory and society theory is that because it exists in spacetime, the concept of social network raises the issue of space in a way that is problematical for social theory. Here we turn the problem on its head and make the problem of space in social network theory explicit by proposing a surprising analogy with the question: what do you have to add to an urban space network to get a city. We show first that by treating a city as a naïve spatial network in the first instance and allowing it to acquire two formal properties we call reflexivity and nonlocality, both mediated through a mechanism we call description retrieval, we can build a picture of the dynamics processes by which collections of the buildings become living cities. We then show that by describing societies initially as social networks in space-time and adding similar properties, we can construct a plausible ontology of a simple human society

Polar codes in network quantum information theory

Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information processing, for tasks such as classical communication, private classical communication, and quantum communication. In the present work, we apply the polar coding method to network quantum information theory, by making use of recent advances for related classical tasks. In particular, we consider problems such as the compound multiple access channel and the quantum interference channel. The main result of our work is that it is possible to achieve the best known inner bounds on the achievable rate regions for these tasks, without requiring a so-called quantum simultaneous decoder. Thus, our work paves the way for developing network quantum information theory further without requiring a quantum simultaneous decoder.Comment: 18 pages, 2 figures, v2: 10 pages, double column, version accepted for publicatio

Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity

The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents. However, the theory for nonlinear agents using probing inputs is less developed and relies on dynamics linearization. We use global convergence properties of the network, which can be assured using passivity theory, to present a network identification method for nonlinear agents. We do so by linearizing the steady-state equations rather than the dynamics, achieving a sub-cubic time algorithm for network identification. We also study the problem of network identification from a complexity theory standpoint, showing that the presented algorithms are optimal in terms of time complexity. We also demonstrate the presented algorithm in two case studies.Comment: 12 pages, 3 figure

Duality and Network Theory in Passivity-based Cooperative Control

This paper presents a class of passivity-based cooperative control problems that have an explicit connection to convex network optimization problems. The new notion of maximal equilibrium independent passivity is introduced and it is shown that networks of systems possessing this property asymptotically approach the solutions of a dual pair of network optimization problems, namely an optimal potential and an optimal flow problem. This connection leads to an interpretation of the dynamic variables, such as system inputs and outputs, to variables in a network optimization framework, such as divergences and potentials, and reveals that several duality relations known in convex network optimization theory translate directly to passivity-based cooperative control problems. The presented results establish a strong and explicit connection between passivity-based cooperative control theory on the one side and network optimization theory on the other, and they provide a unifying framework for network analysis and optimal design. The results are illustrated on a nonlinear traffic dynamics model that is shown to be asymptotically clustering.Comment: submitted to Automatica (revised version