De-Anonymization of Networks with Communities: When Quantifications Meet Algorithms
暂无分享,去创建一个
[1] Shouling Ji,et al. Structural Data De-anonymization: Quantification, Practice, and Implications , 2014, CCS.
[2] Xinbing Wang,et al. Spectrum Trading in Cognitive Radio Networks: A Contract-Theoretic Modeling Approach , 2011, IEEE Journal on Selected Areas in Communications.
[3] Silvio Lattanzi,et al. An efficient reconciliation algorithm for social networks , 2013, Proc. VLDB Endow..
[4] Matthias Grossglauser,et al. On the privacy of anonymized networks , 2011, KDD.
[5] Cristopher Moore,et al. Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Y. Aflalo,et al. On convex relaxation of graph isomorphism , 2015, Proceedings of the National Academy of Sciences.
[7] Rong Yan,et al. Social influence in social advertising: evidence from field experiments , 2012, EC '12.
[8] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[9] Fan Chung Graham,et al. The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..
[10] Xinbing Wang,et al. Delay and Capacity Tradeoff Analysis for MotionCast , 2011, IEEE/ACM Transactions on Networking.
[11] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[12] Vitaly Shmatikov,et al. De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.
[13] Paul Erdös,et al. On random graphs, I , 1959 .
[14] Xinbing Wang,et al. MAP: Multiauctioneer Progressive Auction for Dynamic Spectrum Access , 2011, IEEE Transactions on Mobile Computing.
[15] J. Bunch. The weak and strong stability of algorithms in numerical linear algebra , 1987 .
[16] Daniel Cullina,et al. Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching , 2016, SIGMETRICS.