Special Notice
IEEE Xplore is transitioning to HTTPS on 9 April 2018. Customer access via EZproxy will require version 6 or higher with TLS 1.1 or 1.2 enabled.
Review our EZproxy Upgrade Checklist to ensure uninterrupted access.

# IEEE Transactions on Network Science and Engineering

Includes the top 50 most frequently accessed documents for this publication according to the usage statistics for the month of

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

Publication Year: 2017, Page(s):248 - 260
| | PDF (1373 KB) | HTML

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):215 - 228
| | PDF (505 KB) | HTML

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 View full abstract»

• ### Network Maximal Correlation

Publication Year: 2017, Page(s):229 - 247
| | PDF (1310 KB) | HTML

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»

• ### Image and Attribute Based Convolutional Neural Network Inference Attacks in Social Networks

Publication Year: 2018, Page(s): 1
| | PDF (3978 KB)

In modern society, social networks play an important role for online users. However, one unignorable problem behind the booming of the services is privacy issues. At the same time, neural networks have been swiftly developed in recent years, and are proven to be very effective in inference attacks. This paper proposes a new framework for inference attacks in social networks, which smartly integrat... View full abstract»

• ### Graph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks

Publication Year: 2018, Page(s): 1
| | PDF (3889 KB)

Distributed line graphs were introduced by Zhang and Liu as an overlay for Peer-to-Peer networks. Distributed line graphs have some useful properties as a network topology, such as out-regular and small diameter, where the former implies that each user possesses a constant size of routing table and the latter means that a reasonably small number of hops is necessary to reach a target user. In this... View full abstract»

• ### A Resource Allocation Mechanism for Cloud Radio Access Network Based on Cell Differentiation And Integration Concept

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

A Self-Organising Cloud Radio Access Network (C-RAN) is proposed, which dynamically adapt to varying capacity demands. The Base Band Units and Remote Radio Heads are scaled semi-statically based on the concept of cell differentiation and integration (CDI) while a dynamic load balancing is formulated as an integer-based optimisation problem with constraints. A Discrete Particle Swarm Optimisation (... View full abstract»

• ### Contract Mechanism and Performance Analysis for Data Transaction in Mobile Social Networks

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

In this paper, a novel mobile data offloading method is proposed based on an external-infrastructure-free approach. Specifically, through the hotspot function of smartphones, data demands from some mobile users, who have used out the data with their monthly data plans, can be offloaded by some other mobile users who still have redundant unused data. In order to model this data transaction among mo... View full abstract»

• ### Pricing for profit in Internet of Things

Publication Year: 2018, Page(s): 1
| | PDF (4331 KB) |  Media

The economic model of the Internet of Things (IoT) consists of end users, advertisers and three different kinds of providers-IoT service provider (IoTSP), Wireless service provider (WSP) and cloud service provider (CSP). We investigate three different kinds of interactions among the providers. First, we consider that the IoTSP prices a bundled service to the end-users, and the WSP and CSP pay the ... View full abstract»

• ### Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks

Publication Year: 2014, Page(s):76 - 90
Cited by:  Papers (32)
| | PDF (1164 KB) | HTML Media

Most methods proposed to uncover communities in complex networks rely on combinatorial graph properties. Usually an edge-counting quality function, such as modularity, is optimized over all partitions of the graph compared against a null random graph model. Here we introduce a systematic dynamical framework to design and analyze a wide variety of quality functions for community detection. The qual... View full abstract»

• ### Inference of Hidden Social Power Through Opinion Formation in Complex Networks

Publication Year: 2017, Page(s):154 - 164
| | PDF (472 KB) | HTML

Social networks analysis and mining gets ever-increasing importance in various disciplines. In this context finding the most influential nodes with the highest social power is important in many applications including spreading of innovation, opinion formation, immunization, information propagation and recommendation. In this manuscript, we propose a mathematical framework in order to effectively e... View full abstract»

• ### Community Detection and Classification in Hierarchical Stochastic Blockmodels

Publication Year: 2017, Page(s):13 - 26
| | PDF (611 KB) | HTML Media

In disciplines as diverse as social network analysis and neuroscience, many large graphs are believed to be composed of loosely connected smaller graph primitives, whose structure is more amenable to analysis We propose a robust, scalable, integrated methodology for community detection and community comparison in graphs. In our procedure, we first embed a graph into an appropriate Euclidean space ... View full abstract»

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

Publication Year: 2017, Page(s):201 - 214
| | PDF (350 KB) | HTML

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 t... View full abstract»

• ### Identifying Influential Spreaders in Complex Multilayer Networks: A centrality perspective

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

Identifying influential spreaders in complex networks is of paramount importance for understanding and controlling the spreading dynamics. A challenging and yet inadequately explored task is to detect such influential nodes in multilayer networks, i.e., networks that encompass different types of connections (e.g., different relationships) among the nodes, hence facilitating a multilayer structure.... View full abstract»

• ### Scheduling Jobs across Geo-Distributed Datacenters with Max-Min Fairness

Publication Year: 2018, Page(s): 1
| | PDF (4599 KB)

It has become routine for large volumes of data to be generated, stored, and processed across geographically distributed datacenters. To run a single data analytic job on such geo-distributed data, recent research proposed to distribute its tasks across datacenters, considering both data locality and network bandwidth across datacenters. Yet, it remains an open problem in the more general case, wh... View full abstract»

• ### Influence of Clustering on Cascading Failures in Interdependent Systems

Publication Year: 2018, Page(s): 1
| | PDF (794 KB)

We study the influence of clustering, more specifically triangles, on cascading failures in interdependent networks or systems, in which we model the dependence between comprising systems using a dependence graph. First, we propose a new model that captures how the presence of triangles in the dependence graph alters the manner in which failures transmit from affected systems to others. Unlike exi... View full abstract»

• ### Node Scheduling and Compressed Sampling for Event Reporting in WSNs

Publication Year: 2018, Page(s): 1
| | PDF (9535 KB)

This work focuses on developing a node scheduling algorithm for detecting events in a sensor field such that few random samples from a set of the active sensor nodes are transmitted to the cluster head and are further used for almost complete reconstruction of the cluster data. A node scheduling algorithm is proposed to achieve maximum coverage of the physical sensor field with correlated sensor r... View full abstract»

• ### Diffusion of Innovation in Large Scale Graphs

Publication Year: 2017, Page(s):100 - 111
| | PDF (439 KB) | HTML

Will a new smartphone application diffuse deeply in the population or will it sink into oblivion soon? To predict this, we argue that common models of spread of innovations based on cascade dynamics or epidemics may not be fully adequate. In this paper, we model the spread of a new technological item in a population through a novel network dynamics where diffusion is based on the word-of-mouth and... View full abstract»

• ### Amplitude Death in Strongly Coupled Polygonal Oscillatory Networks with Sharing Branch

Publication Year: 2018, Page(s): 1
| | PDF (731 KB)

Amplitude changes and amplitude death (AD) are observed in several types of coupled polygonal oscillatory networks that suffer from strong frustration. In this paper, we confirm that the occurrence time of AD depends on the location of the oscillators in the networks. To explain the mechanism of these interesting phenomena, we conduct theoretical analysis by applying the averaging method to the pr... View full abstract»

• ### A Fair Mechanism for Private Data Publication in Online Social Networks

Publication Year: 2018, Page(s): 1
| | PDF (8314 KB)

Due to the tremendous growth of online social networks in both participants and collected contents, social data publication has provided an opportunity for numerous services. However, neglectfully publishing all the contents leads to severe disclosure of sensitive information due to diverse user behaviors. Therefore, there should be a thoroughly designed framework for data publication in online so... View full abstract»

• ### 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»

• ### Design of Self-Organizing Networks: Creating Specified Degree Distributions

Publication Year: 2016, Page(s):147 - 158
Cited by:  Papers (1)
| | PDF (483 KB) | HTML Media

A key problem in the study and design of complex systems is the apparent disconnection between the microscopic and the macroscopic. It is not straightforward to identify the local interactions that give rise to an observed global phenomenon, nor is it simple to design a system that will exhibit some desired global property using only local knowledge. Here we propose a methodology that allows for t... View full abstract»

• ### Scalable Privacy-Preserving Participant Selection for Mobile Crowdsensing Systems: Participant Grouping and Secure Group Bidding

Publication Year: 2018, Page(s): 1
| | PDF (1739 KB)

Mobile crowdsensing (MCS) has been emerging as a new sensing paradigm where vast numbers of mobile devices are used for sensing and collecting data in various applications. Auction based participant selection has been widely used for current MCS systems to achieve user incentive and task assignment optimization. However, participant selection problems solved with auction-based approaches usually i... View full abstract»

• ### On the Interplay Between Individuals’ Evolving Interaction Patterns and Traits in Dynamic Multiplex Social Networks

Publication Year: 2016, Page(s):32 - 43
Cited by:  Papers (4)
| | PDF (953 KB) | HTML Media

The interplay between individuals' social interactions and traits has been studied extensively but traditionally from static or homogeneous social network perspectives. The recent availability of dynamic and heterogeneous (multiplex) network data has introduced a variety of new challenges. Critically, novel computational models are needed that can cope with data dynamics and heterogeneity. In this... View full abstract»

Publication Year: 2018, Page(s): 1
| | PDF (1448 KB)

This paper studies a promising application in Vehicular Cyber-Physical Systems (VCPS) called roadside advertisement dissemination. Its application involves three elements: the drivers in the vehicles, Roadside Access Points (RAPs), and shopkeepers. The shopkeeper wants to attract as many customers as possible by using RAPs to disseminate advertisements to the passing vehicles. Upon receiving an ad... View full abstract»

• ### Competitive Propagation: Models, Asymptotic Behavior and Quality-Seeding Games

Publication Year: 2017, Page(s):83 - 99
Cited by:  Papers (1)
| | PDF (863 KB) | HTML

In this paper we propose a class of propagation models for multiple competing products over a social network. We consider two propagation mechanisms: social conversion and self conversion, corresponding, respectively, to endogenous and exogenous factors. A novel concept, the product-conversion graph, is proposed to characterize the interplay among competing products. According to the chronological... View full abstract»

• ### Fast Generation of Spatially Embedded Random Networks

Publication Year: 2017, Page(s):112 - 119
| | PDF (557 KB) | HTML

Spatially Embedded Random Networks such as the Waxman random graph have been used in many settings for synthesizing networks. Prior to our work, there existed no software for generating these efficiently. Existing techniques are $O(n^2)$ where ... View full abstract»

• ### The Smallest Eigenvalue of the Generalized Laplacian Matrix, with Application to Network-Decentralized Estimation for Homogeneous Systems

Publication Year: 2016, Page(s):312 - 324
Cited by:  Papers (2)
| | PDF (3593 KB) | HTML

The problem of synthesizing network-decentralized observers arises when several agents, corresponding to the nodes of a network, exchange information about local measurements to asymptotically estimate their own state. The network topology is unknown to the nodes, which can rely on information about their neighboring nodes only. For homogeneous systems, composed of identical agents, we show that a... View full abstract»

• ### An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks

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

Social networks allow rapid spread of ideas and innovations while negative information can also propagate widely. When a user receives two opposing opinions, they tend to believe the one arrives first. Therefore, once misinformation or rumor is detected, one containment method is to introduce a positive cascade competing against the rumor. Given a budget $k$, the rumo... View full abstract»

Publication Year: 2017, Page(s):129 - 139
| | PDF (696 KB) | HTML Media

Large-scale cascading failures can be triggered by very few initial failures, leading to severe damages in complex networks. This paper studies load-dependent cascading failures in random networks consisting of a large but finite number of components. Under a random single-node attack, a framework is developed to quantify the damage at each stage of a cascade. Estimations and analyses for the frac... View full abstract»

• ### Spectral properties of extended Sierpiński graphs and their applications

Publication Year: 2018, Page(s): 1
| | PDF (834 KB)

The eigenvalues of a graph present a wide range of applications in structural and dynamical aspects of the graph. Determining and analyzing spectra of a graph has been an important and exciting research topic in recent years. In this paper, we study the spectra and their applications for extended Sierpiński graphs, which are closely related to WK-recursive networks that are widely used in t... View full abstract»

• ### Distributed and Robust Fair Optimization Applied to Virus Diffusion Control

Publication Year: 2017, Page(s):41 - 54
Cited by:  Papers (1)
| | PDF (2325 KB) | HTML

This paper proposes three novel nonlinear, continuous-time, distributed algorithms to solve a class of fair resource allocation problems, which allow an interconnected group of operators to collectively minimize a global cost function subject to equality and inequality constraints. The proposed algorithms are designed to be robust so that temporary errors in communication or computation do not cha... View full abstract»

• ### Comparing the Effects of Failures in Power Grids under the AC and DC Power Flow Models

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

In this paper, we compare the effects of failures in power grids under the nonlinear AC and linearized DC power flow models. First, we numerically demonstrate that when there are no failures and the assumptions underlying the DC model are valid, the DC model approximates the AC model well in four considered test networks. Then, to evaluate the validity of the DC approximation upon failures, we num... View full abstract»

• ### The Minimum Information Dominating Set for Opinion Sampling in Social Networks

Publication Year: 2016, Page(s):299 - 311
| | PDF (894 KB) | HTML

We consider the problem of sampling a node-valued graph. The objective is to infer the values of all nodes from that of a minimum subset of nodes by exploiting correlations in node values. We first introduce the concept of information dominating set (IDS). A subset of nodes in a given graph is an IDS if the values of these nodes are sufficient to infer the values of all nodes. We focus on two fund... View full abstract»

• ### Contact Adaption during Epidemics: A Multilayer Network Formulation Approach

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

People change their physical contacts as a preventive response to infectious disease propagations. Yet, only a few mathematical models consider the coupled dynamics of the disease propagation and the contact adaptation process. This paper presents a model where each agent has a default contact neighborhood set, and switches to a different contact set once she becomes alert about infection among he... View full abstract»

• ### Information Diffusion in Social Networks in Two Phases

Publication Year: 2016, Page(s):197 - 210
Cited by:  Papers (2)
| | PDF (710 KB)

The problem of maximizing information diffusion, given a certain budget expressed in terms of the number of seed nodes, is an important topic in social networks research. Existing literature focuses on single phase diffusion where all seed nodes are selected at the beginning of diffusion and all the selected nodes are activated simultaneously. This paper undertakes a detailed investigation of the ... View full abstract»

• ### Minimizing Social Cost of Vaccinating Network SIS Epidemics

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

Reducing the economic costs (losses) as much as possible is one of the main goals of controlling virus spreading and worm propagation on complex networks. Taking into account the interactions and conflicts of interests among egoistic individuals (nodes) in a network, we introduce the zero-determinant (ZD) strategy into our proposed non-cooperative networking vaccination game with the economic ince... View full abstract»

• ### On the Emergence of Shortest Paths by Reinforced Random Walks

Publication Year: 2017, Page(s):55 - 69
| | PDF (897 KB) | HTML Media

The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate the interplay between the efficiency of network navigation (i.e., path lengths) and network structure (i.e., edge weights). We propose a simple and tractable mo... View full abstract»

• ### A Brief Survey of PageRank Algorithms

Publication Year: 2014, Page(s):38 - 42
Cited by:  Papers (3)
| | PDF (129 KB) | HTML

We examine several PageRank approximation algorithms. Quantitative analyses are provided to illustrate the extraordinary effectiveness of the PageRank computation. View full abstract»

• ### Spreading Processes in Multilayer Networks

Publication Year: 2015, Page(s):65 - 83
Cited by:  Papers (29)
| | PDF (686 KB) | HTML

Several systems can be modeled as sets of interconnected networks or networks with multiple types of connections, here generally called multilayer networks. Spreading processes such as information propagation among users of online social networks, or the diffusion of pathogens among individuals through their contact network, are fundamental phenomena occurring in these networks. However, while inf... View full abstract»

• ### Data-Driven Network Resource Allocation for Controlling Spreading Processes

Publication Year: 2015, Page(s):127 - 138
Cited by:  Papers (2)
| | PDF (453 KB) | HTML

We propose a mathematical framework, based on conic geometric programming, to control a susceptible-infected-susceptible viral spreading process taking place in a directed contact network with unknown contact rates. We assume that we have access to time series data describing the evolution of the spreading process observed by a collection of sensor nodes over a finite time interval. We propose a d... View full abstract»

• ### Threshold Models of Cascades in Large-Scale Networks

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

The spread of new beliefs, behaviors, and technologies in social and economic networks are often driven by cascading mechanisms. Global behaviors emerge from the interplay between the interconnections structure and the local agents interactions. We focus on the Threshold Model (TM) of cascades that can be interpreted as the best response dynamics in a network game. Each agent is equipped with an i... View full abstract»

• ### Information Propagation in Clustered Multilayer Networks

Publication Year: 2016, Page(s):211 - 224
Cited by:  Papers (4)
| | PDF (677 KB) | HTML

In today's world, individuals interact with each other in more complicated patterns than ever. Some individuals engage through online social networks (e.g., Facebook, Twitter), while some communicate only through conventional ways (e.g., face-to-face). Therefore, understanding the dynamics of information propagation among humans calls for a multi-layer network model where an online social network ... View full abstract»

• ### A Model for Growth of Markets of Products or Services Having Hierarchical Dependence

Publication Year: 2018, Page(s): 1
| | PDF (1056 KB)

Many products and services can only achieve their intended functions and performance when being used in conjunction with or under the operation of other products and services. Such products and services, having varying degrees of hierarchical dependence, are becoming dominant in the global market. This trend has intensified as a result of the rapid growth in the use of networked technology, and is... View full abstract»

• ### Distributed Online Convex Optimization Over Jointly Connected Digraphs

Publication Year: 2014, Page(s):23 - 37
Cited by:  Papers (7)
| | PDF (548 KB) | HTML

This paper considers networked online convex optimization scenarios from a regret analysis perspective. At each round, each agent in the network commits to a decision and incurs in a local cost given by functions that are revealed over time and whose unknown evolution model might be adversarially adaptive to the agent's behavior. The goal of each agent is to incur a cumulative cost over time with ... View full abstract»

• ### An Efficient Curing Policy for Epidemics on Graphs

Publication Year: 2014, Page(s):67 - 75
Cited by:  Papers (12)
| | PDF (218 KB) | HTML

We provide a dynamic policy for the rapid containment of a contagion process modeled as an SIS epidemic on a bounded degree undirected graph with $n$ nodes. We show that if the budget $r$ View full abstract»

• ### Analyses of the Clustering Coefficient and the Pearson Degree Correlation Coefficient of Chung's Duplication Model

Publication Year: 2016, Page(s):117 - 131
| | PDF (698 KB) | HTML

Recent advances in gene expression profiling and proteomics techniques have spawn considerable interest in duplication models for modelling the evolution and growth of biological networks. In this paper, we consider the duplication model studied by Chung et al. It seems (to the best of our knowledge) that both the clustering coefficient and the Pearson degree correlation coefficient of this model ... View full abstract»

• ### A Bi-Virus Competing Spreading Model with Generic Infection Rates

Publication Year: 2018, Page(s):2 - 13
| | PDF (1246 KB) | HTML 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»

• ### Information Cascades in Feed-Based Networks of Users with Limited Attention

Publication Year: 2017, Page(s):120 - 128
Cited by:  Papers (1)
| | PDF (1253 KB) | HTML

We build a model of information cascades on feed-based networks, taking into account the finite attention span of users, message generation rates and message forwarding rates. Through simulation of this model, we study the effect of the extent of user attention on the probability that the cascade becomes viral. In analogy with a branching process, we estimate the branching factor associated with t... View full abstract»

• ### A General Framework for Sensor Placement in Source Localization

Publication Year: 2018, Page(s): 1
| | PDF (1286 KB) |  Media

When an epidemic spreads in a given network of individuals or communities, can we detect its source using only the information provided by a small set of nodes? We propose a general framework that incorporates two dimensions. First, we can either rely exclusively on a set of selected nodes (i.e., sensors) which always reveal their state independently of any particular epidemic (these are called st... View full abstract»

• ### The Power of Quasi-Shortest Paths: $\rho$ -Geodesic Betweenness Centrality

Publication Year: 2017, Page(s):187 - 200
| | PDF (1181 KB) | HTML

Betweenness centrality metrics usually underestimate the importance of nodes that are close to shortest paths but do not exactly fall on them. In this paper, we reevaluate the importance of such nodes and propose the p-geodesic betweenness centrality, a novel metric that assigns weights to paths (and, consequently, to nodes on these paths) according to how close they are to shortest paths. The pat... 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