# IEEE Transactions on Network Science and Engineering

### Early Access Articles

Early Access articles are made available in advance of the final electronic or print versions. Early Access articles are peer reviewed but may not be fully edited. They are fully citable from the moment they appear in IEEE Xplore.

## Filter Results

Displaying Results 1 - 22 of 22
• ### Provision of Public Goods on Networks: On Existence, Uniqueness, and Centralities

Publication Year: 2017, Page(s): 1
| | PDF (417 KB)

We consider the provision of public goods on networks of strategic agents. We study different effort outcomes of these network games, namely, the Nash equilibria, Pareto efficient effort profiles, and semi-cooperative equilibria (resulting from interactions among coalitions of agents). We identify necessary and sufficient conditions on the structure of the network for the uniqueness of the Nash eq... View full abstract»

• ### Weighted Bearing-Compass Dynamics: Edge and Leader Selection

Publication Year: 2017, Page(s): 1
| | PDF (3409 KB)

This paper considers the design and effective interfaces of a distributed robotic formation running planar weighted bearing-compass dynamics. We present results which support methodologies to construct formation topologies using submodular optimization techniques. Further, a convex optimization framework is developed for the selection of edge weights which increase performance. We explore a method... View full abstract»

• ### Isomorphisms in Multilayer Networks

Publication Year: 2017, Page(s): 1
| | PDF (389 KB)

We extend the concept of graph isomorphisms to multilayer networks with any number of “aspects” (i.e., types of layering). In developing this generalization, we identify multiple types of isomorphisms. For example, in multilayer networks with a single aspect, permuting vertex labels, layer labels, and both vertex labels and layer labels each yield different isomorphism relations betw... View full abstract»

• ### A Mathematical Theory for Multistage Battery Switching Networks

Publication Year: 2017, Page(s): 1
| | PDF (4677 KB)

In this paper, we propose a mathematical theory for multistage battery switching networks. The theory aims to address several design issues in managing a large-scale battery system, including flexibility, reliability, efficiency, complexity (scalability) and sustainability. Our multistage battery switching network is constructed by a concatenation of various rectangular “shapes” of b... View full abstract»

• ### Finite-time Passivity of Coupled Neural Networks with Multiple Weights

Publication Year: 2017, Page(s): 1
| | PDF (4550 KB)

This paper respectively studies finite-time passivity of multi-weighted coupled neural networks (MWCNNs) with and without coupling delays. Firstly, based on those existing passivity definitions, several new concepts about finite-time passivity are presented. By exploiting these definitions for finite-time passivity and designing appropriate controllers, we investigate the passivity of MWCNNs with ... View full abstract»

• ### Observational Equivalence in System Estimation: Contractions in Complex Networks

Publication Year: 2017, Page(s): 1
| | PDF (3471 KB)

Observability of complex systems/networks is the focus of this paper, which is shown to be closely related to the concept of contraction. Indeed, for observable network tracking it is necessary/sufficient to have one node in each contraction measured. Therefore, nodes in a contraction are equivalent to recover for loss of observability, implying that contraction size is a key factor for observabil... View full abstract»

• ### Networking the Boids is More Robust Against Adversarial Learning

Publication Year: 2017, Page(s): 1
| | PDF (6225 KB)

Swarm behavior using Boids-like models has been studied primarily using close-proximity spatial sensory information (e.g. vision range). In this study, we propose a novel approach in which the classic definition of boids\textquoteright neighborhood that relies on sensory perception and Euclidian space locality is replaced with graph-theoretic network-based proximity mimicking communication and soc... View full abstract»

• ### A Multi-objective Evolutionary Algorithm for Promoting the Emergence of Cooperation and Controllable Robustness on Directed Networks

Publication Year: 2017, Page(s): 1
| | PDF (1996 KB)

The directedness of links is of significance in complex systems, and much attention has been paid to study the dynamics of directed networks recently. In networked systems, the emergence of cooperation and robustness are two hot issues in recent decades, and previous studies have indicated the structures for promoting these two properties are opposite, which also reveals the great impact of struct... View full abstract»

• ### Analysis of Partial Diffusion LMS for Adaptive Estimation Over Networks with Noisy Links

Publication Year: 2017, Page(s): 1
| | PDF (569 KB) |  Media

In partial diffusion-based least mean square (PDLMS) scheme, each node shares a part of its intermediate estimate vector with its neighbors at each iteration. In this paper, besides studying the general PDLMS scheme, we figure out how the noisy links deteriorate the network performance during the exchange of weight estimates. We investigate the steady state mean square deviation (MSD) and derive a... View full abstract»

• ### Cascading Failures in Interdependent Systems: Impact of Degree Variability and Dependence

Publication Year: 2017, Page(s): 1
| | PDF (453 KB)

We study cascading failures in a system comprising interdependent networks/systems, in which nodes rely on other nodes both in the same system and in other systems to perform their function. The (inter-)dependence among nodes is modeled using a dependence graph, where the degree vector of a node determines the number of other nodes it can potentially cause to fail in each system through aforementi... View full abstract»

• ### Preventive and Reactive Cyber Defense Dynamics Is Globally Stable

Publication Year: 2017, Page(s): 1
| | PDF (506 KB)

The recently proposed cybersecurity dynamics approach aims to understand cybersecurity from a holistic perspective by modeling the evolution of the global cybersecurity state.These models describe the interactions between the various kinds of cyber attacks and the various kinds of cyber defenses that take place in complex networks.In this paper, we study a particular kind of cybersecurity dynamics... View full abstract»

• ### A Robust Advantaged Node Placement Strategy for Sparse Network Graphs

Publication Year: 2017, Page(s): 1
| | PDF (2745 KB)

Establishing robust connectivity in heterogeneous networks (HetNets) is an important yet challenging problem. For a HetNet accommodating a large number of nodes, establishing perturbation-invulnerable connectivity is of utmost importance. This paper provides a robust advantaged node placement strategy best suited for sparse network graphs. In order to offer connectivity robustness, this paper mode... View full abstract»

• ### A bi-virus competing spreading model with generic infection rates

Publication Year: 2017, Page(s): 1
| | PDF (2994 KB) |  Media

Due to widespread applications, the multi-virus competing spreading dynamics has recently aroused considerable interests. To our knowledge, all previous competing spreading models assume infection rates that are each linear in the virus occupancy probabilities of the individuals in a population. As linear infection rates are overestimation of real infection rates, in some situations these models c... View full abstract»

• ### Scheduling Resource-Bounded Monitoring Devices for Event Detection and Isolation in Networks

Publication Year: 2017, Page(s): 1
| | PDF (855 KB)

In networked systems, monitoring devices such as sensors are typically deployed to monitor various target locations. Targets are the points in the physical space at which events of some interest, such as random faults or attacks, can occur. Most often, these devices have limited energy supplies, and they can operate for a limited duration. In this paper, we study optimal scheduling of monitoring d... View full abstract»

• ### Information flow in a model of policy diffusion: an analytical study

Publication Year: 2017, Page(s): 1
| | PDF (474 KB)

Networks are pervasive across science and engineering, but seldom do we precisely know their topology. The information-theoretic notion of transfer entropy has been recently proposed as a potent means to unveil connectivity patterns underlying collective dynamics of complex systems. By pairwise comparing time series of units in the network, transfer entropy promises to determine whether the units ... View full abstract»

• ### Pattern Formation over Multigraphs

Publication Year: 2017, Page(s): 1
| | PDF (1145 KB) |  Media

Two of the most common pattern formation mechanisms are Turing-patterning in reaction-diffusion systems and lateral inhibition of neighboring cells. In this paper, we introduce a broad dynamical model of interconnected modules to study the emergence of patterns, with the above mentioned two mechanisms as special cases. Our results do not restrict the number of modules or their complexity, allow mu... View full abstract»

• ### A Micro-foundation of Social Capital in Evolving Social Networks

Publication Year: 2017, Page(s): 1
| | PDF (2909 KB) |  Media

A social network confers benefits and advantages on individuals (and on groups); the literature refers to these advantages as social capital. This paper presents a micro-founded mathematical model of the evolution of a social network and of the social capital of individuals within the network. The evolution of the network is influenced by the extent to which individuals are homophilic, structurall... View full abstract»

• ### How Complex Contagions in Preferential Attachment Models and Other Time-Evolving Networks

Publication Year: 2017, Page(s): 1
| | PDF (668 KB)

The $k$-complex contagion model is a social contagion model which describes the diffusion of behaviors in networks where the successful adoption of a behavior requires influence from multiple contacts. It has been argued that $k$-complex contagions better model behavioral changes such as adoption of new beliefs, fashion trends or expensiv... View full abstract»

• ### Network Maximal Correlation

Publication Year: 2017, Page(s): 1
| | PDF (3698 KB)

We introduce Network Maximal Correlation (NMC) as a multivariate measure of nonlinear association among random variables. NMC is defined via an optimization that infers transformations of variables by maximizing aggregate inner products between transformed variables. For finite discrete and jointly Gaussian random variables, we characterize a solution of the NMC optimization using basis expansion ... View full abstract»

• ### Stochastic Subgradient Algorithms for Strongly Convex Optimization over Distributed Networks

Publication Year: 2017, Page(s): 1
| | PDF (868 KB)

We study diffusion and consensus based optimization of a sum of unknown convex objective functions over distributed networks. The only access to these functions is through stochastic gradient oracles, each of which is only available at a different node; and a limited number of gradient oracle calls is allowed at each node. In this framework, we introduce a convex optimization algorithm based on st... View full abstract»

• ### Moment-Based Spectral Analysis of Random Graphs with Given Expected Degrees

Publication Year: 2017, Page(s): 1
| | PDF (768 KB)

We analyze the eigenvalues of a random graph ensemble, proposed by Chung and Lu, in which a given sequence of expected degrees, denoted by $\overline w_n=(w^{(n)}_1,\ldots,w^{(n)}_n)$ , is prescribed on the $n$ nodes of a random graph. We focus on the eigenvalues of the normalized (random) adjacency matrix of the graph ensemble, define... View full abstract»

• ### Incompatibility boundaries for properties of community partitions

Publication Year: 2017, Page(s): 1
| | PDF (342 KB)

We prove the incompatibility of certain desirable properties of community partition quality functions. Our results generalize the impossibility result of [Kleinberg 2003] by considering sets of weaker properties. In particular, we use an alternative notion to solve the central issue of the consistency property. (The latter means that modifying the graph in a way consistent with a partition should ... View full abstract»

## Aims & Scope

The IEEE Transactions on Network Science and Engineering is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Dapeng Oliver Wu

University of Florida

Dept. of Electrical  &  Computer Engineering

P. O. Box 116130

Gainesville, FL 32611

Email: dpwu@ufl.edu