Skip to main content
SpringerLink
Log in

Examining Small World Problem Using KeyGraph

  • Conference paper
Soft Computing as Transdisciplinary Science and Technology

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

Summary

By modifying a format of data inputted, KeyGraph can visualize a virtual small world structure among respondents of an empirical survey with ease. This article aims at examining a major question in the small world problem: searchability by the new utilization of KeyGraph. Authors found the clear difference of a potential connector and a substantial connector among clusters of human network, and this difference implies a significant nature of our social network, which tends to be overlooked under the strong influence of the Power Law theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Watts, D. J., (2003) Six Degrees, W. W. Norton & Company, New York, NY, and London, UK

    Google Scholar 

  2. Milgram, S., (1967) ‘The Small World Problem,’ Psychology Today, vol. 1(1), 60–67

    Google Scholar 

  3. Granovetter, M., (1973) ‘The Strength of Weak Ties,’ American Journal of Sociology, vol. 78, 1360–1380

    Article  Google Scholar 

  4. Watts, D. J. and Strogatz, S. H., (1998) ‘Collective Dynamics of “Small-World” Network,’ Nature, vol. 393, 440–442

    Article  Google Scholar 

  5. Ohsawa, Y. and McBurney, P., eds, (2003) Chance Discovery, Springer Verlag

    Google Scholar 

  6. Barabasi, A. L. and Albert, R., (1999) ‘Emergence of Scaling in Random Network,’ Science, vol. 286, 509–512

    Article  MathSciNet  Google Scholar 

  7. Ohsawa, Y., Soma, H., Matsuo, Y., Matsumura, N., and Usui, M., (2002) ‘Featuring Web Communities based on World Co-occurrence Structure of Communications,’ Proceedings of WWW2002

    Google Scholar 

  8. Chance Discovery Consortium 2004, Examples of Chance Discovery, http://www.chancediscovery.com

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hakuhodo Inc., Japan

    Yuichi Washida & Hiroshi Tamura

  2. Comparative Media Studies, Massachusetts Institute of Technology, USA

    Yuichi Washida

  3. Graduate School of Business Sciences, University of Tsukuba, Tsukuba

    Yukio Ohsawa

  4. Graduate School of Information Science and Technology, The University of Tokyo, Tokyo

    Yukio Ohsawa

Authors
  1. Yuichi Washida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Tamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yukio Ohsawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Oklahoma State University, North Greenwood Avenue 700, 74106, Tulsa, USA

    Ajith Abraham

  2. Dept. of Computer Science and Systems Engineering, Muroran Institute of Technology, Mizumoto-cho 27-1, 050-8585, Muroran, Hokkaido, Japan

    Yasuhiko Dote

  3. Dept. of Computational Science and Engineering, Nagoya University, Furo-cho, Chikusa-ku, 464-8601, Nagoya, Aichi-ken, Japan

    Takeshi Furuhashi

  4. Institut für Sicherheits-/Prüftechnik, Fraunhofer IPK Berlin, Pascalstr. 8-9, 10587, Berlin, Germany

    Mario Köppen

  5. Division of Complex Systems Technology Graduate School of Engineering, University of Hokkaido, N-13, W-8 060 KITA-KU, Sapporo, Japan

    Azuma Ohuchi

  6. PRESTO Japan Science & Technology Corp. GSSM, University of Tsukuba, 3-29-1 Otsuka, Bunkyo-ku, 12-0012, Tokyo, Japan

    Yukio Ohsawa

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Washida, Y., Tamura, H., Ohsawa, Y. (2005). Examining Small World Problem Using KeyGraph. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-32391-0_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25055-5

  • Online ISBN: 978-3-540-32391-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation