# 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 - 25 of 41
• ### On the convergence of message passing computation of harmonic influence in social networks

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

The harmonic influence is a measure of node influence in social networks that quantifies the ability of a leader node to alter the network's average opinion, acting against an adversary field node. The definition of harmonic influence assumes linear interactions between the nodes described by an undirected weighted graph; its computation is equivalent to solve, for every node, a discrete Di... 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»

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

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

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

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

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

• ### Shotgun assembly of labeled graphs

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

We consider the problem of reconstructing graphs or labeled graphs from neighborhoods of a given radius r. Special instances of this problem include DNA shotgun assembly, neural network reconstruction, and assembling random jigsaw puzzles. We provide some necessary and some sufficient conditions for correct recovery both in combinatorial terms and for some generative models including random labeli... 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»

• ### Modeling Spread of Preferences in Social Networks for Sampling-based Preference Aggregation

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

Given a large population, it is an intensive task to gather individual preferences over a set of alternatives and arrive at an aggregate or collective preference of the population. We show that social network underlying the population can be harnessed to accomplish this task effectively, by sampling preferences of a small subset of representative nodes. We first develop a Facebook app to create a ... View full abstract»

• ### Time to extinction for the SIS epidemic model: new bounds on the tail probabilities

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

In this paper, we present a novel estimation of the time to extinction of a Susceptible-Infected-Susceptible (SIS) epidemic model over a general network of interactions. Specifically, we prove that, for an effective infection rate above a threshold depending on the topology of the network, the time to extinction grows exponentially in the size of the population, with probability converging to 1 as... View full abstract»

• ### Passivity Analysis and Pinning Control of Multi-Weighted Complex Dynamical Networks

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

This paper studies a multi-weighted network model with different dimensions of output and input vectors. Firstly, we analyze passivity of proposed network model by employing some inequality techniques and Lyapunov functional method, and give a synchronization condition for output-strictly passive complex dynamical network with multi-weights (CDNMWs). Furthermore, by using pinning adaptive strategi... View full abstract»

• ### A General Method to Determine Asymptotic Capacity Upper Bounds for Wireless Networks

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

Capacity scaling laws offer fundamental understanding on the trend of user throughput behavior when the network size increases. Since the seminal work of Gupta and Kumar, there have been active research efforts in developing capacity scaling laws for ad hoc networks under various advanced physical (PHY) layer technologies. These efforts led to many custom-designed solutions, most of which were mat... 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»

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

• ### Cascading Edge Failures: A Dynamic Network Process

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

This paper studies a network process that can potentially be used to model cascading failures in networks. The Dynamic Bond Percolation (DBP) process models, through stochastic local rules, the failure or recovery of an edge (i, j) in a network. The probability that a working link fails or a failed link recovers may be independent of the state of other links or may be dependent locally on the stat... View full abstract»

• ### Modelling Spreading Process Induced by Agent Mobility in Complex Networks

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

Most conventional epidemic models assume contact-based contagion process. We depart from this assumption and study epidemic spreading process in networks caused by agents acting as carrier of infection. These agents traverse from origins to destinations following specific paths in a network and in the process, infecting the sites they travel across. We focus our work on the Susceptible-Infected-Re... View full abstract»

• ### Detecting Cascades from Weak Signatures

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

Inspired by cyber-security applications, we consider the problem of detecting an infection process in a network when the indication that any particular node is infected is extremely noisy. Instead of waiting for a single node to provide sufficient evidence that it is indeed infected, we take advantage of the graph structure to detect cascades of weak indications of failures. We view the detection ... 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»

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

• ### Belief Dynamics in Social Networks: A Fluid-Based Analysis

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

The advent and proliferation of social media have led to the development of mathematical models describing the evolution of beliefs/opinions in an ecosystem composed of socially interacting users. The goal is to gain insights into collective dominant social beliefs and into the impact of different components of the system, such as users' interactions, while being able to predict users... View full abstract»

• ### Recovering asymmetric communities in the stochastic block model

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

We consider the sparse stochastic block model in the case where the degrees are uninformative. The case where the two communities have approximately the same size has been extensively studied and we concentrate here on the community detection problem in the case of unbalanced communities. In this setting, spectral algorithms based on the non-backtracking matrix are known to solve the community det... View full abstract»

• ### Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs

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

We study the behavior of algebraic connectivity in a weighted graph that is subject to site percolation, random deletion of the vertices. Using a refined concentration inequality for random matrices we show in our main theorem that the (augmented) Laplacian of the percolated graph concentrates around its expectation. This concentration bound then provides a lower bound on the algebraic connectivit... 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»

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

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