Skip to main content

Analysis of the Temporal and Structural Features of Threads in a Mailing-List

  • Chapter
  • First Online:
Complex Networks VII

Part of the book series: Studies in Computational Intelligence ((SCI,volume 644))

  • 1035 Accesses

Abstract

A link stream is a collection of triplets (tuv) indicating that an interaction occurred between u and v at time t. Link streams model many real-world situations like email exchanges between individuals, connections between devices, and others. Much work is currently devoted to the generalization of classical graph and network concepts to link streams. In this paper, we generalize the existing notions of intra-community density and inter-community density. We focus on emails exchanges in the Debian mailing-list and show that threads of emails, like communities in graphs, are dense subsets loosely connected from a link stream perspective.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Dorat, R., Latapy, M., Conein, B., Auray, N.: Multi-level analysis of an interaction network between individuals in a mailing-list. In: Annales des télécommunications, vol. 62, pp. 325–349. Springer (2007)

    Google Scholar 

  2. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  3. Sowe, S., Stamelos, I., Angelis, L.: Identifying knowledge brokers that yield software engineering knowledge in OSS projects. Inf. Softw. Technol. 48(11), 1025–1033 (2006)

    Article  Google Scholar 

  4. SPI. Debian mailing-list archive: https://lists.debian.org/debian-user/

  5. Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’07, pp. 687–696, New York, NY, USA. ACM (2007)

    Google Scholar 

  6. Viard, J., Latapy, M.: Identifying roles in an ip network with temporal and structural density. In: 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 801–806. IEEE (2014)

    Google Scholar 

  7. Wang, Q.: Link prediction and threads in email networks. In: 2014 International Conference on Data Science and Advanced Analytics (DSAA), pp. 470–476. IEEE (2014)

    Google Scholar 

Download references

Acknowledgments

This work is supported in part by the French Direction Générale de l’Armement (DGA), by the Thales company, by the CODDDE ANR-13-CORD-0017-01 grant from the Agence Nationale de la Recherche, and by grant O18062-44430 of the French program PIA—Usages, services et contenus innovants.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Noé Gaumont .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gaumont, N., Viard, T., Fournier-S’niehotta, R., Wang, Q., Latapy, M. (2016). Analysis of the Temporal and Structural Features of Threads in a Mailing-List. In: Cherifi, H., Gonçalves, B., Menezes, R., Sinatra, R. (eds) Complex Networks VII. Studies in Computational Intelligence, vol 644. Springer, Cham. https://doi.org/10.1007/978-3-319-30569-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30569-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30568-4

  • Online ISBN: 978-3-319-30569-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics