Cited By
View all- Guo ZWang XTang JLiu XXu ZWu MKaashoek MZhang Z(2008)R2Proceedings of the 8th USENIX conference on Operating systems design and implementation10.5555/1855741.1855755(193-208)Online publication date: 8-Dec-2008
Islands in the MSN messenger buddy network
Authors: 
Yu Chen, Tracy Chen, Ming Chen, Zheng ZhangAuthors Info & Claims
Pages 13 - 18
Abstract
The MSN messenger buddy network comprises a giant component and many small islands. Being curious about the existence of the small islands, we study their topologies and find that they favor part of the possible topologies. Specifically, fully connected and star-shape topologies become more and more popular as the size of the islands increases. The tendency towards certain topologies suggests specific ways of interactions between users in the islands. Using egonetworks as a tool, we also compare the local structures in islands and those in the giant component. The comparison shows that the giant component ego-networks are larger but sparser than those in the islands. The difference implies different interaction behaviors between users in the islands and the giant component.
References
[1]
nauty. http://cs.anu.edu.au/~bdm/nauty.
[2]
R. Albert and A.-L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 2002.
[3]
R. Albert, H. Jeong, and A.-L. Barabasi. Internet: Diameter of the World-Wide Web. Nature, 401:130, 1999.
[4]
V. Batagelj and M. Zaversnik. Generalized cores. CoRR, cs.DS/0202039, 2002.
[5]
D. Fisher. Using egocentric networks to understand communication. IEEE Internet Computing, 9(5):20--28, 2005.
[6]
L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40:35--41, 1977.
[7]
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC, pages 29--42. ACM, 2007.
[8]
M. E. J. Newman. Assortative mixing in networks. Physical Review Letters, 89(20), November 2002.
[9]
M. E. J. Newman. A measure of betweenness centrality based on random walks. arXiv:cond-mat/0309045, 2003.
[10]
C. R. Palmer, P. B. Gibbons, and C. Faloutsos. ANF: A fast and scalable tool for data mining in massive graphs. In KDD, pages 81--90. ACM, 2002.
[11]
G. Sabidussi. The centrality index of a graph. Psychometrika, 31:581--603, 1966.
[12]
J. Tyler, D. Wilkinson, and B. A. Huberman. Email as spectroscopy: Automated discovery of community structure within organizations. Technical report, Hewlett-Packard Labs, 2003.
[13]
D. J. Watts and S. H. Strogatz. Collective dynamics of 'small world' networks. Nature, 393:440--442, 1998.
Recommendations
Tuning Parameters of Differential Evolution: Self-adaptation, Parallel Islands, or Co-operation
IJCCI 2019: Proceedings of the 11th International Joint Conference on Computational IntelligenceIn this paper, we raise a question of tuning parameters of Evolutionary Algorithms (EAs) and consider three alternative approaches to tackle this problem. Since many different self-adaptive EAs have been proposed so far, it has led to another problem of ...
Funnel report mining for the MSN network
KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data miningData mining research has long concentrated on the five main areas: clustering, association discovery, classification, forecasting and sequential patterns. Web data mining projects are concerned mainly with text mining, user segmentation, forecasting web ...
From cells to islands: an unified model of cellular parallel genetic algorithms
ACRI'06: Proceedings of the 7th international conference on Cellular Automata for Research and IndustryThis paper presents the Anisotropic selection scheme for cellular Genetic Algorithms (cGA) This new scheme allows to enhance diversity and to control the selective pressure which are two important issues in Genetic Algorithms, especially when trying to ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 2008
Check for updates
Qualifiers
- Research-article
Conference
Eurosys '08
Sponsor:
Upcoming Conference
EuroSys '25
- Sponsor:
- sigops
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 156Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Reflects downloads up to 22 Nov 2024
Other Metrics
Citations
Cited By
View all- Guo ZWang XTang JLiu XXu ZWu MKaashoek MZhang Z(2008)R2Proceedings of the 8th USENIX conference on Operating systems design and implementation10.5555/1855741.1855755(193-208)Online publication date: 8-Dec-2008
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in