987,303 research outputs found
Marketing Impact on Diffusion in Social Networks
The paper proposes a way to add marketing into the standard threshold model
of social networks. Within this framework, the paper studies logical properties
of the influence relation between sets of agents in social networks. Two
different forms of this relation are considered: one for promotional marketing
and the other for preventive marketing. In each case a sound and complete
logical system describing properties of the influence relation is proposed.
Both systems could be viewed as extensions of Armstrong's axioms of functional
dependency from the database theory
Effect of Unfolding on the Spectral Statistics of Adjacency Matrices of Complex Networks
Random matrix theory is finding an increasing number of applications in the
context of information theory and communication systems, especially in studying
the properties of complex networks. Such properties include short-term and
long-term correlation. We study the spectral fluctuations of the adjacency of
networks using random-matrix theory. We consider the influence of the spectral
unfolding, which is a necessary procedure to remove the secular properties of
the spectrum, on different spectral statistics. We find that, while the spacing
distribution of the eigenvalues shows little sensitivity to the unfolding
method used, the spectral rigidity has greater sensitivity to unfolding.Comment: Complex Adaptive Systems Conference 201
VANET Connectivity Analysis
Vehicular Ad Hoc Networks (VANETs) are a peculiar subclass of mobile ad hoc
networks that raise a number of technical challenges, notably from the point of
view of their mobility models. In this paper, we provide a thorough analysis of
the connectivity of such networks by leveraging on well-known results of
percolation theory. By means of simulations, we study the influence of a number
of parameters, including vehicle density, proportion of equipped vehicles, and
radio communication range. We also study the influence of traffic lights and
roadside units. Our results provide insights on the behavior of connectivity.
We believe this paper to be a valuable framework to assess the feasibility and
performance of future applications relying on vehicular connectivity in urban
scenarios
Outward Influence and Cascade Size Estimation in Billion-scale Networks
Estimating cascade size and nodes' influence is a fundamental task in social,
technological, and biological networks. Yet this task is extremely challenging
due to the sheer size and the structural heterogeneity of networks. We
investigate a new influence measure, termed outward influence (OI), defined as
the (expected) number of nodes that a subset of nodes will activate,
excluding the nodes in S. Thus, OI equals, the de facto standard measure,
influence spread of S minus |S|. OI is not only more informative for nodes with
small influence, but also, critical in designing new effective sampling and
statistical estimation methods.
Based on OI, we propose SIEA/SOIEA, novel methods to estimate influence
spread/outward influence at scale and with rigorous theoretical guarantees. The
proposed methods are built on two novel components 1) IICP an important
sampling method for outward influence, and 2) RSA, a robust mean estimation
method that minimize the number of samples through analyzing variance and range
of random variables. Compared to the state-of-the art for influence estimation,
SIEA is times faster in theory and up to several orders of
magnitude faster in practice. For the first time, influence of nodes in the
networks of billions of edges can be estimated with high accuracy within a few
minutes. Our comprehensive experiments on real-world networks also give
evidence against the popular practice of using a fixed number, e.g. 10K or 20K,
of samples to compute the "ground truth" for influence spread.Comment: 16 pages, SIGMETRICS 201
Scaling theory of transport in complex networks
Transport is an important function in many network systems and understanding
its behavior on biological, social, and technological networks is crucial for a
wide range of applications. However, it is a property that is not
well-understood in these systems and this is probably due to the lack of a
general theoretical framework. Here, based on the finding that renormalization
can be applied to bio-networks, we develop a scaling theory of transport in
self-similar networks. We demonstrate the networks invariance under length
scale renormalization and we show that the problem of transport can be
characterized in terms of a set of critical exponents. The scaling theory
allows us to determine the influence of the modular structure on transport. We
also generalize our theory by presenting and verifying scaling arguments for
the dependence of transport on microscopic features, such as the degree of the
nodes and the distance between them. Using transport concepts such as diffusion
and resistance we exploit this invariance and we are able to explain, based on
the topology of the network, recent experimental results on the broad flow
distribution in metabolic networks.Comment: 8 pages, 6 figure
- …