[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/335305.335325acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

The small-world phenomenon: an algorithmic perspective

Published: 01 May 2000 Publication History
First page of PDF

References

[1]
L. Adamic, "The small world Web," Proceedings of the European Conf. on Digital Libraries, 1999.]]
[2]
R. Albert, H. Jeong, A.-L. Barabasi, "The diameter of the World Wide Web," Nature 401, 130 (1999).]]
[3]
P. Berman, "On-line searching and navigation," On- Line Algorithms: The State of the Art, A. Fiat and G. Woeginger, Eds., Springer, 1998.]]
[4]
B. Bollob~s, Random Graphs (Academic Press, London, 1985).]]
[5]
B. Bollob~s, F.R.K. Chung, "The diameter of a cycle plus a random matching," SIAM J. Discrete Math. 1, 328 (1988).]]
[6]
F.R.K. Chung, M.R. Garey, "Diameter bounds for altered graphs," J. Graph Theory 8, 511 (1984).]]
[7]
J. Guam, Six Degrees o/Separation: A Play (Vintage Books, New York, 1990).]]
[8]
J. Hunter and R. Shotland, "Treating data collected by the small world method as a Markov process," Social Forces 52, 321 (1974).]]
[9]
J. Kaiser, Ed., "It's a small Web after all," Science 285, 1815 (1999).]]
[10]
P. Killworth and H. Bernard, "Reverse small world experiment," Social Networks 1,159 (1978).]]
[11]
M. Kochen, Ed., The Small World (Ablex, Norwood, 1989).]]
[12]
C. Korte and S. Milgram, "Acquaintance networks between racial groups: Application of the small world method," J. Personality and Social Psych., 15, 101 (1978).]]
[13]
S. Milgram, "The small world problem," Psychology Today 1, 61 (1967).]]
[14]
R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, 1095).]]
[15]
D. Peleg, E. Upfal, "A trade-off between size and efficiency for routing tables," Journal of the A CM 36(1989).]]
[16]
I. de Sola Pool and M. Kochen, "Contacts and influence,'' Social Networks 1, 5 (1978).]]
[17]
H. Kautz, B. Selman, M. Shah, "ReferralWeb: Combining Social Networks and Collaborative Filtering,'' Communications of the A CM, 30, 3 (March 1997).]]
[18]
J. Travers and S. Milgram, "An experimental study of the small world problem," Sociometry 32, 425 (1969).]]
[19]
D. Watts and S. Strogatz, "Collective dynamics of small-world networks," Nature 393, 440 (1998).]]
[20]
H. White, "Search parameters for the small world problem," Social Forces 49, 259 (1970).]]

Cited By

View all
  • (2024)Network Agency: An Agent-based Model of Forced Migration from UkraineProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662996(1372-1380)Online publication date: 6-May-2024
  • (2024)Advancing the Social Internet of Things (SIoT): Challenges, Innovations, and Future PerspectivesMathematics10.3390/math1205071512:5(715)Online publication date: 28-Feb-2024
  • (2024)Speeding up random walk mixing by starting from a uniform vertexElectronic Journal of Probability10.1214/24-EJP109129:noneOnline publication date: 1-Jan-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing
May 2000
756 pages
ISBN:1581131844
DOI:10.1145/335305
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 May 2000

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

STOC00
Sponsor:

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1,223
  • Downloads (Last 6 weeks)148
Reflects downloads up to 30 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Network Agency: An Agent-based Model of Forced Migration from UkraineProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662996(1372-1380)Online publication date: 6-May-2024
  • (2024)Advancing the Social Internet of Things (SIoT): Challenges, Innovations, and Future PerspectivesMathematics10.3390/math1205071512:5(715)Online publication date: 28-Feb-2024
  • (2024)Speeding up random walk mixing by starting from a uniform vertexElectronic Journal of Probability10.1214/24-EJP109129:noneOnline publication date: 1-Jan-2024
  • (2024)Improving Embedding-Based Retrieval in Friend Recommendation with ANN Query ExpansionProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3661367(2930-2934)Online publication date: 10-Jul-2024
  • (2024)DApps ecosystems: mapping the network structure of smart contract interactionsEPJ Data Science10.1140/epjds/s13688-024-00497-813:1Online publication date: 27-Sep-2024
  • (2024)Refining Euclidean Obfuscatory Nodes Helps: A Joint-Space Graph Learning Method for Graph Neural NetworksIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2024.340589835:9(11720-11733)Online publication date: Sep-2024
  • (2024)Distributed Experimental Design NetworksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621241(2368-2377)Online publication date: 20-May-2024
  • (2024)A De-anonymization Attack against Downloaders in FreenetIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621209(1-10)Online publication date: 20-May-2024
  • (2024)SEGCN: a subgraph encoding based graph convolutional network model for social bot detectionScientific Reports10.1038/s41598-024-54809-z14:1Online publication date: 19-Feb-2024
  • (2024)MFCSNet: A Musician–Follower Complex Social Network for Measuring Musical InfluenceEntertainment Computing10.1016/j.entcom.2023.10060148(100601)Online publication date: Jan-2024
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media