Skip to main content

Dynamic Network Motifs: Evolutionary Patterns of Substructures in Complex Networks

  • Conference paper
Web Technologies and Applications (APWeb 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6612))

Included in the following conference series:

Abstract

We propose an entirely new approach to understanding complex networks; called “dynamic network motifs (DNMs).” We define DNMs as statistically significant local evolutionary patterns of a network. We find such DNMs in the networks of two web services, Yahoo Answers and Flickr, and discuss the social dynamics of these services as indicated by their DNMs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Adamic, L., Zhang, J., Bakshy, E., Ackerman, M.: Knowledge sharing and Yahoo Answers: everyone knows something. In: Proceedings of the 17th International Conference on World Wide Web, pp. 665–674 (2008)

    Google Scholar 

  2. Inokuchi, A., Washio, T.: A fast method to mine frequent subsequences from graph sequence data. In: Proceedings of the 8th IEEE International Conference on Data Mining, pp. 303–312 (2008)

    Google Scholar 

  3. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. Journal-American Society for Information Science and Technology 58(7), 1019–1031 (2007)

    Article  Google Scholar 

  4. Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., Alon, U.: Superfamilies of evolved and designed networks. Science 303(5663), 1538–1542 (2004)

    Article  Google Scholar 

  5. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824–827 (2002)

    Article  Google Scholar 

  6. Nijssen, S., Kok, J.: A quickstart in frequent structure mining can make a difference. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 647–652 (2004)

    Google Scholar 

  7. Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 721–724 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kabutoya, Y., Nishida, K., Fujimura, K. (2011). Dynamic Network Motifs: Evolutionary Patterns of Substructures in Complex Networks. In: Du, X., Fan, W., Wang, J., Peng, Z., Sharaf, M.A. (eds) Web Technologies and Applications. APWeb 2011. Lecture Notes in Computer Science, vol 6612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20291-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20291-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20290-2

  • Online ISBN: 978-3-642-20291-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics