• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 468
Next 10 →

The Small-World Phenomenon: An Algorithmic Perspective

by Jon Kleinberg - in Proceedings of the 32nd ACM Symposium on Theory of Computing , 2000
"... Long a matter of folklore, the “small-world phenomenon ” — the principle that we are all linked by short chains of acquaintances — was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960’s. This work was among the first to m ..."
Abstract - Cited by 824 (5 self) - Add to MetaCart
Long a matter of folklore, the “small-world phenomenon ” — the principle that we are all linked by short chains of acquaintances — was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960’s. This work was among the first

Networks, Dynamics, and the Small-World Phenomenon

by Duncan J. Watts - American Journal of Sociology , 1999
"... The small-world phenomenon formalized in this article as the coincidence of high local clustering and short global separation, is shown to be a general feature of sparse, decentralized networks that are neither completely ordered nor completely random. Networks of this kind have received little atte ..."
Abstract - Cited by 220 (1 self) - Add to MetaCart
The small-world phenomenon formalized in this article as the coincidence of high local clustering and short global separation, is shown to be a general feature of sparse, decentralized networks that are neither completely ordered nor completely random. Networks of this kind have received little

Justifying the small-world phenomenon via . . .

by Abbas Mehrabian , 2014
"... ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract not found

Modeling the small-world phenomenon with local network flow

by Reid Andersen, Fan Chung, Linyuan Lu
"... The small-world phenomenon includes both small average distance and the clustering effect. Randomly generated graphs with a power law degree distribution are widely used to model large real-world networks, but while these graphs have small average distance, they generally do not exhibit the clusteri ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
The small-world phenomenon includes both small average distance and the clustering effect. Randomly generated graphs with a power law degree distribution are widely used to model large real-world networks, but while these graphs have small average distance, they generally do not exhibit

Understanding and Modeling the Small-World Phenomenon in Dynamic Networks Anh-Dung Nguyen

by Patrick Senac, Michel Diaz
"... The small-world phenomenon first introduced in the con-text of static graphs consists of graphs with high cluster-ing coefficient and low shortest path length. This is an in-trinsic property of many real complex static networks. Re-cent research has shown that this structure is also observ-able in d ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
The small-world phenomenon first introduced in the con-text of static graphs consists of graphs with high cluster-ing coefficient and low shortest path length. This is an in-trinsic property of many real complex static networks. Re-cent research has shown that this structure is also observ-able

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon

by David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott , 2011
"... A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as “he is a prominent lawyer in Boston ” or “she is a Freshman sociology major at Harvard”). That is, these networks have v ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a

1An Optimization Algorithm Based on the Small-World Phenomenon

by Haifeng Du, Jie Shao, Marcus W. Feldman
"... 2An Optimization Algorithm Based on the Small-World Phenomenon Abstract We propose an optimization algorithm, called the small-world algorithm (SWA), based on searching mechanisms in social networks. The SWA emphasizes local rather than global search to find the solutions for optimization problems. ..."
Abstract - Add to MetaCart
2An Optimization Algorithm Based on the Small-World Phenomenon Abstract We propose an optimization algorithm, called the small-world algorithm (SWA), based on searching mechanisms in social networks. The SWA emphasizes local rather than global search to find the solutions for optimization problems

The small world phenomenon in hybrid power law graphs

by Fan Chung, Linyuan Lu - Complex Networks, (Eds. E. Ben-Naim et. al.), Springer-Verlag , 2004
"... graphs ..."
Abstract - Cited by 16 (3 self) - Add to MetaCart
Abstract not found

A MATRIX PERTURBATION VIEW OF THE SMALL WORLD PHENOMENON

by Desmond J. Higham , 2003
"... We use techniques from applied matrix analysis to study small world cutoff in a Markov chain. Our model consists of a periodic random walk plus uniform jumps. This has a direct interpretation as a teleporting random walk, of the type used by search engines to locate web pages, on a simple ring netw ..."
Abstract - Cited by 12 (1 self) - Add to MetaCart
We use techniques from applied matrix analysis to study small world cutoff in a Markov chain. Our model consists of a periodic random walk plus uniform jumps. This has a direct interpretation as a teleporting random walk, of the type used by search engines to locate web pages, on a simple ring

A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs

by Pierre Fraigniaud , 2005
"... Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg (2000) gave formal support to this so-called “small world phenomenon” by using meshes augmented with long-range links chose ..."
Abstract - Cited by 16 (0 self) - Add to MetaCart
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg (2000) gave formal support to this so-called “small world phenomenon” by using meshes augmented with long-range links
Next 10 →
Results 1 - 10 of 468
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University