2009, French, Article edition: Un algorithme stable de décomposition pour l'analyse des réseaux sociaux dynamiques Bourqui, Romain; Simonetto, Paolo; Jourdan, Fabien

User activity

Share to:
 
Bookmark: http://trove.nla.gov.au/version/207763
Physical Description
  • text
Published
  • HAL - CCSD
  • 2009
Language
  • French

Edition details

Title
  • Un algorithme stable de décomposition pour l'analyse des réseaux sociaux dynamiques
Author
  • Bourqui, Romain
  • Simonetto, Paolo
  • Jourdan, Fabien
Published
  • HAL - CCSD
  • 2009
Physical Description
  • text
Subjects
Notes
  • Dynamical networks raise new analysis problems. An efficient analysis tool has to not only allow to split the network into groups of \og similar~\fg{} elements but also allow to detect changes in the network structure. In this article, we describe a new method for analyzing such dynamical networks. This technique is based on an algorithm of decomposition of graph into overlapping clusters. Time complexity of this algorithm is $O(|E| \cdot deg_{max}^2 + |V| \cdot log(|V|)))$. The stability of that algorithm allows to detect the changes of the studied network over the time.
  • HAL:hal-00406437, version 1
  • HAL:http:/​/​hal.archives-ouvertes.fr/​hal-00406437/​en/​
Language
  • French
Contributed by
OAIster

Get this edition

  • Set up My libraries

    How do I set up "My libraries"?

    In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.

  • All (1)
  • Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this edition

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this version

Add a comment