Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Relaxed Clique Percolation and Disinformation-Resilient Domains for Social Commerce Networks (2403.14767v1)

Published 21 Mar 2024 in cs.SI

Abstract: Must we trace and block all fake content in a social commerce network so that genuine users may enjoy fake-free information? Such efforts largely fail, because, as we get better at spam detection, spammers use the same advances for anti-detection. As a fundamentally new approach, we show that an online platform can aggregate and route user-generated content in a smart personalized way, which fosters and relies on "collective social responsibility". We introduce the notion of information aggregation domain, or simply, domain: composed for a given "central" node (user account), a domain is a connected set of nodes whose user-generated content is eligible to be used to meet the central node's information needs. Admitting malicious information sources - "bad citizen" nodes - into "good citizen" nodes' domains puts the good citizens at risk for disinformation attacks. We show how a platform can limit this risk by exploiting the social link structure between its nodes without the need to know which nodes are good or bad citizens. We introduce Relaxed Clique Percolation (RCP), a class of policies to compose personalized disinformation-resilient domains. Then, we define "RCP cores" and show how they can be used to efficiently compose resilient domains for all network nodes at once. Finally, we analyze the properties of RCP domains found in real-world social networks including Slashdot, Facebook, Flickr, and Yelp, to affirm that in practice, RCP domains turn out to be large and spatially diverse.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. Adaptive social networks promote the wisdom of crowds. Proceedings of the National Academy of Sciences, 117(21):11379–11386, 2020.
  2. S. P. Borgatti and R. Cross. A relational view of information seeking and learning in social networks. Management Science, 49(4):432–445, 2003.
  3. Clique percolation in random networks. Physical Review Letters, 94, 4 2005. ISSN 00319007. doi: 10.1103/PhysRevLett.94.160202. URL https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.94.160202.
  4. S. Fortunato. Community detection in graphs. Physics Reports, 486:75–174, 2010. ISSN 03701573. doi: 10.1016/j.physrep.2009.11.002.
  5. M. Girvan and M. E. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 99:7821–7826, 6 2002. ISSN 00278424. doi: 10.1073/PNAS.122653799/ASSET/B8593464-1EFB-4723-9B55-0AAF2E3D4494/ASSETS/GRAPHIC/PQ1226537007.JPEG. URL https://www.pnas.org/doi/abs/10.1073/pnas.122653799.
  6. M. S. Granovetter. The strength of weak ties. American journal of sociology, 78:1360–1380, 1973. ISSN 15414612. doi: 10.1016/j.mnl.2018.12.011. URL https://inequality.stanford.edu/sites/default/files/media/_media/pdf/Classic_Media/Granovetter_1973_SocialNetworks.pdf.
  7. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413–423, 11 1978. ISSN 0097-5397. doi: 10.1137/0207033.
  8. T. P. Liang and E. Turban. Introduction to the special issue social commerce: A research framework for social commerce. International Journal of Electronic Commerce, 16:5–13, 1 2011. ISSN 10864415. doi: 10.2753/JEC1086-4415160201.
  9. M. E. Newman. The structure and function of complex networks. SIAM Review, 45:167–256, 2003. ISSN 00361445. doi: 10.1137/S003614450342480.
  10. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435:814–818, 2005. ISSN 00280836. doi: 10.1038/nature03607.
  11. Y. Papanastasiou. Fake news propagation and detection: A sequential model. Management Science, 66(5):1826–1846, 2020.
  12. Crowdsourcing exploration. Management Science, 64(4):1727–1746, 2018.
  13. The strength of long-range ties in population-scale social networks. Science, 362(6421):1410–1413, 2018.
  14. On clique relaxation models in network analysis. European Journal of Operational Research, 226:9–18, 4 2013. ISSN 03772217. doi: 10.1016/j.ejor.2012.10.021.
  15. H. Paul and A. Nikolaev. Fake review detection on online e-commerce platforms: a systematic literature review. Data Mining and Knowledge Discovery, 35:1830–1881, 2021. ISSN 1573-756X. doi: 10.1007/s10618-021-00772-6. URL https://doi.org/10.1007/s10618-021-00772-6.
  16. The dual effect of digital communication reinforcement drivers on purchase intention in the social commerce environment. Humanities and Social Sciences Communications, 10(1):1–12, 2023.
  17. Exploring social media network landscape of post-soviet space. IEEE Access, 7:411–426, 2018.
  18. A. T. Stephen and O. Toubia. Deriving value from social commerce networks. Journal of Marketing Research, 47:215–228, 4 2010. ISSN 00222437. doi: 10.1509/jmkr.47.2.215.

Summary

We haven't generated a summary for this paper yet.