Improving the characterization of P-stability for applications in network privacy

DOI10.1016/j.dam.2016.01.025zbMath1342.68258OpenAlexW2286896031MaRDI QIDQ277631

Julián Salas, Vincenç Torra

Publication date: 2 May 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.025

zbMATH Keywords

P-stabilitydegree sequence\(k\)-anonymityFPRASfully polynomial-time randomized approximation schemegraphic sequencerapidly mixing Markov chain

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20) Random walks on graphs (05C81)

Related Items

Some basics on privacy techniques, anonymization and their big data challenges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast uniform generation of regular graphs
• Random generation of combinatorial structures from a uniform distribution
• Approximate counting, uniform generation and rapidly mixing Markov chains
• A note on a theorem of Erdős and Gallai
• Managing and mining graph data
• Graphic sequences, distances and \(k\)-degree anonymity
• Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
• A remark concerning graphical sequences
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Seven criteria for integer sequences being graphic
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY