2,471 research outputs found
Local Search in Unstructured Networks
We review a number of message-passing algorithms that can be used to search
through power-law networks. Most of these algorithms are meant to be
improvements for peer-to-peer file sharing systems, and some may also shed some
light on how unstructured social networks with certain topologies might
function relatively efficiently with local information. Like the networks that
they are designed for, these algorithms are completely decentralized, and they
exploit the power-law link distribution in the node degree. We demonstrate that
some of these search algorithms can work well on real Gnutella networks, scale
sub-linearly with the number of nodes, and may help reduce the network search
traffic that tends to cripple such networks.Comment: v2 includes minor revisions: corrections to Fig. 8's caption and
references. 23 pages, 10 figures, a review of local search strategies in
unstructured networks, a contribution to `Handbook of Graphs and Networks:
From the Genome to the Internet', eds. S. Bornholdt and H.G. Schuster
(Wiley-VCH, Berlin, 2002), to be publishe
Rhythms of social interaction: messaging within a massive online network
We have analyzed the fully-anonymized headers of 362 million messages
exchanged by 4.2 million users of Facebook, an online social network of college
students, during a 26 month interval. The data reveal a number of strong daily
and weekly regularities which provide insights into the time use of college
students and their social lives, including seasonal variations. We also
examined how factors such as school affiliation and informal online friend
lists affect the observed behavior and temporal patterns. Finally, we show that
Facebook users appear to be clustered by school with respect to their temporal
messaging patterns
Search in Power-Law Networks
Many communication and social networks have power-law link distributions,
containing a few nodes which have a very high degree and many with low degree.
The high connectivity nodes play the important role of hubs in communication
and networking, a fact which can be exploited when designing efficient search
algorithms. We introduce a number of local search strategies which utilize high
degree nodes in power-law graphs and which have costs which scale sub-linearly
with the size of the graph. We also demonstrate the utility of these strategies
on the Gnutella peer-to-peer network.Comment: 17 pages, 14 figure
Economics-Based Optimization of Unstable Flows
As an example for the optimization of unstable flows, we present an
economics-based method for deciding the optimal rates at which vehicles are
allowed to enter a highway. It exploits the naturally occuring fluctuations of
traffic flow and is flexible enough to adapt in real time to the transient flow
characteristics of road traffic. Simulations based on realistic parameter
values show that this strategy is feasible for naturally occurring traffic, and
that even far from optimality, injection policies can improve traffic flow.
Moreover, the same method can be applied to the optimization of flows of gases
and granular media.Comment: Revised version of ``Optimizing Traffic Flow'' (cond-mat/9809397).
For related work see http://www.parc.xerox.com/dynamics/ and
http://www.theo2.physik.uni-stuttgart.de/helbing.htm
Quantum Portfolios
Quantum computation holds promise for the solution of many intractable
problems. However, since many quantum algorithms are stochastic in nature they
can only find the solution of hard problems probabilistically. Thus the
efficiency of the algorithms has to be characterized both by the expected time
to completion {\it and} the associated variance. In order to minimize both the
running time and its uncertainty, we show that portfolios of quantum algorithms
analogous to those of finance can outperform single algorithms when applied to
the NP-complete problems such as 3-SAT.Comment: revision includes additional data and corrects minor typo
- …