Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/150971
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Salas Piñón, Julián | - |
dc.contributor.author | Torra, Vicenç | - |
dc.date.accessioned | 2024-07-19T22:19:17Z | - |
dc.date.available | 2024-07-19T22:19:17Z | - |
dc.date.issued | 2016-02 | - |
dc.identifier.citation | Salas, J. [Julián], & Torra, V. [Vicenç] (2016). Improving the characterization of P-stability for applications in network privacy. Discrete Applied Mathematics, 206, 109-114. | - |
dc.identifier.issn | 0166-218XMIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/150971 | - |
dc.description.abstract | Recently, we have found that the concept of P-stability has interesting applications in network privacy. In the context of Online Social Networks it may be used for obtaining a fully polynomial randomized approximation scheme for graph masking and measuring disclosure risk. Also by using the characterization for P-stable sequences from Jerrum, McKayandSinclair (1992) it is possible to obtain optimal approximations for the problem of k-degree anonymity. In this paper, we present results on P-stability considering the additional restriction that the degree sequence must not intersect the edges of an excluded graphX,improvingearlier results on P-stability. As a consequence we extend the P-stable classes of scale-free networks from Torra et al. (2015), obtain an optimal solution for k-anonymity and prove that all the known conditions for P-stability are sufficient for sequences to be graphic. | en |
dc.format.mimetype | application/pdf | ca |
dc.language.iso | eng | ca |
dc.publisher | Elsevier | ca |
dc.relation.ispartof | Discrete Applied Mathematics, 2016, 206 | ca |
dc.relation.uri | https://doi.org/10.1016/j.dam.2016.01.025 | - |
dc.rights | ©2016 Elsevier B.V. | - |
dc.subject | P-stability | en |
dc.subject | k-anonymity | en |
dc.subject | Graphic sequence | en |
dc.subject | Degree sequence | en |
dc.subject | FPRAS | en |
dc.subject | Rapidly mixing Markov chain | en |
dc.subject | Fully polynomial-time randomized approximation scheme | en |
dc.title | Improving the characterization of P-stability for applications in network privacy | ca |
dc.type | info:eu-repo/semantics/article | ca |
dc.rights.accessRights | info:eu-repo/semantics/embargoedAccess | - |
dc.identifier.doi | https://doi.org/10.1016/j.dam.2016.01.025 | - |
dc.gir.id | AR/0000005996 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO/2012/TIN2012-32757 | - |
dc.type.version | info:eu-repo/semantics/publishedVersion | - |
dc.date.embargoEndDate | info:eu-repo/date/embargoEnd/2124-12-31 | - |
Aparece en las colecciones: | Articles cientÍfics Articles |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Salas_DiscreteAppMath_Improving.pdf Until 2124-12-31 | 365,67 kB | Adobe PDF | Visualizar/Abrir Pedir una copia |
Comparte:
![]( /image/googleScholar.png)
![](/image/microsoftAcademic.png)
Los ítems del Repositorio están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.