References
- S. Milgram, "The small world problem," Psychology Today, Vol.1, No.1, pp.60-67, 1967.
- R. Solomonoff and A. Rapoport, "Connectivity of random nets," Bull. Math. Biophys., Vol.13, No.1 pp.107-117, 1951. https://doi.org/10.1007/BF02478357
- P. Erdös and A. Renyi, "On random graphs," Publicat. Math., Vol.6, No.2 pp.290-297, 1959.
- R. Albert, H. Jeong, and A.-L. Barabasi, "Internet: Diameter of the world-wide web," Nature, Vol.401, No.6749, pp.130-131, 1999. https://doi.org/10.1038/43601
- H. Jeong, S. P. Mason, A.-L. Barabasi, and Z.N. Oltvai, "Lethality and centrality in protein networks," Nature, Vol.411, No.6833, pp.41-42, 2001. https://doi.org/10.1038/35075138
- H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabasi, "The large-scale organization of metabolic networks," Nature, Vol.407, No.6804, pp.651-654, 2000. https://doi.org/10.1038/35036627
- J. Stiller, D. Nettle, and R. Dunbar, "The small world of Shakespeare's plays," Human Nature, Vol.14, No.4, pp.397-408. https://doi.org/10.1007/s12110-003-1013-1
- S. Kim, "Complex network analysis in literature: Togi,“ Sae Mulli, Vol.50, No.4, pp.267-271, 2005.
- Y. K. Lee, H. I. Shin, J. E. Ku, and H. Y. Kim, "Analysis of network dynamics from the Romance of the three kingdoms," J. Kor. Conten. Assoc., Vol.9, No.4, pp.364-371, 2009. https://doi.org/10.5392/JKCA.2009.9.4.364
- D. Liben-Nowell and J. Kleinberg, "Tracing information flow on a global scale using internet chain-letter data," PNAS, Vol.105, No.12, pp.4633-4638. https://doi.org/10.1073/pnas.0708471105
- A.-L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, Vol.286, No.5439, pp.509-512, 1999. https://doi.org/10.1126/science.286.5439.509
- B. Kang, K.-I. Goh, D.-S. Lee, and D. Kim, "Complex networks: structure and dynamics," Sae Mulli, Vol.48, No.2, pp.115-141, 2004.
- A. Clauset, C. Moore, and M. Newman, "Hierarchical structure and the prediction of missing links in networks," Nature, Vol.453, No.7191, pp.98-191, 2008. https://doi.org/10.1038/nature06830
- J. Ignacio, A. Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani, "K-core decomposition of internet graphs: Hierarchies, self-similarity and measurement biases," Networks Hetero. Media, Vol.3, No.2, pp.371-393, 2008. https://doi.org/10.3934/nhm.2008.3.371
- S. Jansom and M. J. Luczak, "A simple solution to the k-core problem," Random Structures & Algorithms, Vol.30, No.1-2. pp.50-62, 2007. https://doi.org/10.1002/rsa.20147
- S. Srivastava and R. K. Ghosh, "Distributed algorithms for finding and maintaining a k-tree core in a dynamic network," Information processing Letters, Vol.88, No.4, pp.187-194, 2003. https://doi.org/10.1016/S0020-0190(03)00365-X
- http://www.kmdb.or.kr
- J. P. Onnela, J. Saramaki, J. Hyvönen, G. Szabo, M. A. de. Menezes, K. Kaski, A.-L. Barabasi, and J. Kertesz, “Analysis of a large-scale weighted network of one-to-one human communication,” New J. Phys., Vol.9 No.6, p.179, 2007. https://doi.org/10.1088/1367-2630/9/6/179
- M. E. J. Newman and J. Park, "Why social networks are different from other types of networks," Phys. Tev. E, Vol.68, p.036122, 2003. https://doi.org/10.1103/PhysRevE.68.036122
- R. Albert and A.-L. Barabási, "Statistical mechanics of complex network," Rev. Mod. Phys., Vol.74, No.1, pp.47-97, 2002. https://doi.org/10.1103/RevModPhys.74.47
- D. S. Callaway, J. E. Hopcroft, J. M. Kleinberg, M. E. J. Newman, and S. H. Strogatz, "Are randomly grown graphs really random?" Phys. Rev. E, Vol.64, No.10, p.041902, 2001. https://doi.org/10.1103/PhysRevE.64.041902
- A.-L. Barabasi, R. Albert, and H. Jeong, “Mean-field thoery for scale-free random networks," Physica A, Vol.272, No7. pp.173-187, 1999. https://doi.org/10.1016/S0378-4371(99)00291-5
Cited by
- Analysis of Network Dynamics from Annals of the Chosun Dynasty vol.14, pp.9, 2014, https://doi.org/10.5392/JKCA.2014.14.09.529