Umeå University's logo

umu.sePublications
System disruptions
There are recurring service disruptions on some of the search portals due to high traffic. We are working to resolve the issue, you may temporarily encounter an error message.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Community discovery on dynamic graphs with edge local differential privacy
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Nausicca)ORCID iD: 0000-0001-6561-997X
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Nausicca)ORCID iD: 0000-0001-5116-9971
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Nausicca)ORCID iD: 0000-0002-0368-8037
Faculty of Computer Science, Multimedia and Telecommunications, Universitat Oberta de Catalunya, Barcelona, Spain.
2025 (English)In: Complex Systems, ISSN 0891-2513, Vol. 34, no 2, p. 203-215Article in journal (Refereed) Published
Abstract [en]

Interactions among different elements of complex networks are organized in a structured manner. The collective behavior of the elements of these networks is organized according to community structure. Several methods have been defined to automatically detect these substructures in the field known as community discovery. Most of the methods have been applied to static or aggregated data. Recently the identification of evolving communities has gained more attention. Studying the relations among individuals yields insights on how communities form and evolve, but there are some limits that should be enforced to respect individuals’ privacy while sharing and collecting their data. Privacy-protection techniques have been commonly applied to static data, while there are few methods that work on dynamic data. Recently, there have been some approaches to protect dynamic graphs with local edge-differential privacy that have been tested for community discovery applications. However, the evolution of the communities over time has not been evaluated on the privacy-protected data. We test the utility considering community discovery and evolution in time-varying networks for such localedge-ϵ-differential privacy methods. We show empirically how these algorithms can provide privacy while preserving the community lifecycles, for their privacy-aware study.

Place, publisher, year, edition, pages
Complex Systems Publications , 2025. Vol. 34, no 2, p. 203-215
Keywords [en]
edge local differential privacy, dynamic graphs, community discovery
National Category
Security, Privacy and Cryptography
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-239142DOI: 10.25088/ComplexSystems.34.2.203Scopus ID: 2-s2.0-105008946420OAI: oai:DiVA.org:umu-239142DiVA, id: diva2:1960711
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP), 570011356Swedish Research Council, 2022-04645Available from: 2025-05-23 Created: 2025-05-23 Last updated: 2025-11-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Paul, SudiptaSadjadi, FatemehTorra, Vicenç

Search in DiVA

By author/editor
Paul, SudiptaSadjadi, FatemehTorra, Vicenç
By organisation
Department of Computing Science
Security, Privacy and Cryptography

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 183 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf