Abstract
Online social networks are currently experiencing a peak and they resemble real platforms of social conversion and content delivery. Indeed, they are exploited in many ways: from conducting public opinion polls about any political issue to planning big social events for a large public. To securely perform these large-scale computations, current protocols use a simple secret sharing scheme which enables users to obfuscate their inputs. However, these protocols require a minimum number of friends, i.e. the minimum degree of the social graph should be not smaller than a given threshold. Often this condition is not satisfied by all social graphs. Yet we can reuse these graphs after some structural modifications consisting in adding new friendship relations. In this paper, we provide the first definition and theoretical analysis of the “adding friends” problem. We formally describe this problem that, given a graph G and parameter c, asks for the graph satisfying the threshold c that results from G with the minimum of edge-addition operations. We present algorithms for solving this problem in centralized social networks. An experimental evaluation on real-world social graphs demonstrates that our protocols are accurate and inside the theoretical bounds.
Funded by ANR Streams project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anstee, R.P.: A polynomial algorithm for b-matchings: An alternative approach. Inf. Process. Lett. 24(3), 153–157 (1987)
Brandes, P., Wattenhofer, R.: On finding better friends in social networks. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 266–278. Springer, Heidelberg (2012)
Cornuéjols, G.: General factors of graphs. J. Comb. Theo. 45(2), 185–198 (1988)
Echenique, F., Oviedo, J.: A Theory of Stability in Many-to-many Matching Markets. Theoretical Economics (2006)
Floréen, P., Kaski, P., Polishchuk, V., Suomela, J.: Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58(1), 102–118 (2010)
Gale, D., Shapley, L.S.: College Admissions and the Stability of Marriage. The Amer. Math. Month. 69(1), 9–15 (1962)
Gambs, S., Guerraoui, R., Harkous, H., Huc, F., Kermarrec, A.-M.: Scalable and secure polling in dynamic distributed networks. In: SRDS, pp. 181–190 (2012)
Giurgiu, A., Guerraoui, R., Huguenin, K., Kermarrec, A.-M.: Computing in Social Networks. J. Infor. and Comp.(2013)
Guerraoui, R., Huguenin, K., Kermarrec, A.-M., Monod, M.: Decentralized Polling with Respectable Participants. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 144–158. Springer, Heidelberg (2009)
Guerraoui, R., Huguenin, K., Kermarrec, A.-M., Monod, M., Vigfusson, Y.: Decentralized polling with respectable participants. JPDC 72(1), 13–26 (2012)
Hay, M., Miklau, G., Jensen, D., Towsley, D.F., Li, C.: Resisting structural re-identification in anonymized social networks. VLDB J. 19(6), 797–823 (2010)
Hoang, B.-T., Imine, A.: On the Polling Problem for Social Networks. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 46–60. Springer, Heidelberg (2012)
Hoang, B.-T., Imine, A.: On Constrained Adding Friends in Social Networks. Report (2013), https://sites.google.com/site/hbthienosn/full_socinfo.pdf
Jack, E.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. of Stand. Sec. B 69, 125–130 (1965)
Kelso Jr., A.S., Crawford, V.P.: Job matching, coalition formation, and gross substitutes. Econometric da 50(6), 1483–1504 (1982)
Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. TCS 127(2), 255–267 (1994)
Korte, B., Vygen, J.: Combinatorial optimization. Alg. Comb. 21 (2008)
Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD Conference, pp. 93–106 (2008)
Lovász, L.: The factorization of graphs. Act. Ma. Aca. Sc. Hung. 23, 223–246 (1972)
Mathieson, L., Szeider, S.: Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci. 78(1), 179–191 (2012)
Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and Analysis of Online Social Networks. In: IMC (2007)
Morales, G.D.F., Gionis, A., Sozio, M.: Social content matching in mapreduce. PVLDB 4(7), 460–469 (2011)
Samarati, P., Sweeney, L.: Generalizing Data to Provide Anonymity when Disclosing Information. In: PODS (1998)
Sommer, C.: Dblp graph, http://www.sommer.jp/graphs/
Tamir, A., Mitchell, J.S.B.: A maximum b-matching problem arising from median location models with applications to the roommates problem. Math. Program. 80, 171–194 (1998)
Tutte, W.T.: A short proof of the factor problem for finite graphs. Canad. J. Math. 6, 347–352 (1954)
Vu, L.-H., Aberer, K., Buchegger, S., Datta, A.: Enabling Secure Secret Sharing in Distributed Online Social Networks. In: ACSAC, pp. 419–428 (2009)
Zhou, B., Pei, J.: Preserving Privacy in Social Networks Against Neighborhood Attacks. In: ICDE (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Hoang, BT., Imine, A. (2013). On Constrained Adding Friends in Social Networks. In: Jatowt, A., et al. Social Informatics. SocInfo 2013. Lecture Notes in Computer Science, vol 8238. Springer, Cham. https://doi.org/10.1007/978-3-319-03260-3_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-03260-3_40
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03259-7
Online ISBN: 978-3-319-03260-3
eBook Packages: Computer ScienceComputer Science (R0)