Early Access ArticlesEarly 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.
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»
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(n2) where n is the number of nodes in the network; in this paper we present an O(n + e) algorithm, where e is the number of edges. View full abstract»
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»
The theory of random graphs has been applied in recent years to model neural interactions in the brain. While the probabilistic properties of random graphs has been extensively studied, the development of statistical inference methods for this class of objects has received less attention. In this work we propose a non-parametric test of hypotheses to test if a sample of random graphs was generated... View full abstract»
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»
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»
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»
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.
Meet Our Editors
Dapeng Oliver Wu
University of Florida
Dept. of Electrical & Computer Engineering
P. O. Box 116130
Gainesville, FL 32611