research-article

Open access

The Network Visibility Problem

Authors:

Khashayar Gatmiry,

Manuel Gomez-RodriguezAuthors Info & Claims

ACM Transactions on Information Systems (TOIS), Volume 40, Issue 2

Article No.: 22, Pages 1 - 42

https://doi.org/10.1145/3460475

Published: 27 September 2021 Publication History

All formats PDF

Abstract

Social media is an attention economy where broadcasters are constantly competing for attention in their followers’ feeds. Broadcasters are likely to elicit greater attention from their followers if their posts remain visible at the top of their followers’ feeds for a longer period of time. However, this depends on the rate at which their followers receive information in their feeds, which in turn depends on the broadcasters they follow. Motivated by this observation and recent calls for fairness of exposure in social networks, in this article, we look at the task of recommending links from the perspective of visibility optimization. Given a set of candidate links provided by a link recommendation algorithm, our goal is to find a subset of those links that would provide the highest visibility to a set of broadcasters. To this end, we first show that this problem reduces to maximizing a nonsubmodular nondecreasing set function under matroid constraints. Then, we show that the set function satisfies a notion of approximate submodularity that allows the standard greedy algorithm to enjoy theoretical guarantees. Experiments on both synthetic and real data gathered from Twitter show that the greedy algorithm is able to consistently outperform several competitive baselines.

References

[1]

O. Aalen, O. Borgan, and H. Gjessing. 2008. Survival and Event History Analysis: A Process Point of View. Springer.

[2]

A. Asudehy, H. Jagadishy, J. Stoyanovichz, and G. Das. 2017. Designing fair ranking schemes. arXiv preprint arXiv:1712.09752 (2017).

[3]

L. Backstrom, E. Bakshy, J. M. Kleinberg, T. M. Lento, and I. Rosenn. 2011. Center of attention: How Facebook users allocate attention across friends. In ICWSM.

[4]

A. Bian, J. Buhmann, A. Krause, and S. Tschiatschek. 2017. Guarantees for greedy maximization of non-submodular functions with applications. arXiv preprint arXiv:1703.02100 (2017).

[5]

A. Biega, K. Gummadi, and G. Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. arXiv preprint arXiv:1805.01788 (2018).

[6]

Ilija Bogunovic, Junyao Zhao, and Volkan Cevher. 2018. In AISTATS.

[7]

Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. 2011. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40, 6 (2011), 1740–1766.

Digital Library

[8]

M. Cha, H. Haddadi, F. Benevenuto, and K. Gummadi. 2010. Measuring user influence in Twitter: The million follower fallacy. In ICWSM.

[9]

Lin Chen, Moran Feldman, and Amin Karbasi. 2018. Weakly submodular maximization beyond cardinality constraints: Does randomization help greedy? In ICML.

[10]

Michele Conforti and Gérard Cornuéjols. 1984. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discr. Appl. Math. 7, 3 (1984), 251–274.

[11]

M. Crawford. 2015. The World beyond Your Head: On Becoming an individual in an Age of Distraction. Farrar, Straus and Giroux.

[12]

A. Das and D. Kempe. 2011. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In ICML.

[13]

Yuval Filmus and Justin Ward. 2012. A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. In FOCS. IEEE, 659–668.

[14]

Marshall L. Fisher, George L. Nemhauser, and Laurence A. Wolsey. 1978. An analysis of approximations for maximizing submodular set functions—II. In Polyhedral Combinatorics. Springer, 73–87.

[15]

M. Gomez-Rodriguez, K. P. Gummadi, and B. Schoelkopf. 2014. Quantifying information overload in social media and its impact on social contagions. In ICWSM.

[16]

Christopher Harshaw, Moran Feldman, Justin Ward, and Amin Karbasi. 2019. Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications. In ICML.

[17]

Hamed Hassani, Mahdi Soltanolkotabi, and Amin Karbasi. 2017. Gradient methods for submodular maximization. In NIPS.

[18]

N. Hodas and K. Lerman. 2012. How visibility and divided attention constrain social contagion. In SocialCom.

[19]

J. Kang and K. Lerman. 2015. VIP: Incorporating human cognitive biases in a probabilistic model of retweeting. In ICSC.

[20]

M. Karimi, E. Tavakoli, M. Farajtabar, L. Song, and M. Gomez-Rodriguez. 2016. Smart broadcasting: Do you want to be seen? In KDD.

[21]

E. Khalil, B. Dilkina, and L. Song. 2014. Scalable diffusion-aware optimization of network topology. In KDD.

[22]

M. Kimura, K. Saito, and H. Motoda. 2008. Solving the contamination minimization problem on networks for the linear threshold model. In PRICAI.

[23]

M. Kimura, K. Saito, and H. Motoda. 2009. Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data 3, 2 (2009), 1–23.

Digital Library

[24]

C. Kuhlman, G. Tuli, S. Swarup, M. Marathe, and S. Ravi. 2013. Blocking simple and complex contagion by edge removal. In ICDM.

[25]

E. Lawler. 2001. Combinatorial Optimization: Networks and Matroids. Courier Corporation.

[26]

Benny Lehmann, Daniel Lehmann, and Noam Nisan. 2006. Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55, 2 (2006), 270–296.

[27]

K. Lerman and T. Hogg. 2014. Leveraging position bias to improve peer recommendation. PloS One 9, 6 (2014), e98914.

[28]

L. Lü and T. Zhou. 2011. Link prediction in complex networks: A survey. Phys. A: Statist. Mechan. Applic. 390, 6 (2011), 1150–1170.

[29]

G. Nemhauser, L. Wolsey, and M. Fisher. 1978. An analysis of approximations for maximizing submodular set functions—I. Math. Prog. 14, 1 (1978), 265–294.

Digital Library

[30]

A. Singh and T. Joachims. 2018. Fairness of exposure in rankings. In KDD.

[31]

D. Snyder and M. Miller. 2012. Random Point Processes in Time and Space. Springer.

[32]

N. Spasojevic, Z. Li, A. Rao, and P. Bhattacharyya. 2015. When-to-post on social networks. In KDD.

[33]

H. Tong, B. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos. 2012. Gelling, and melting, large graphs by edge manipulation. In CIKM.

[34]

U. Upadhyay, A. De, and M. Gomez-Rodriguez. 2018. Deep reinforcement learning of marked temporal point processes. In NIPS.

[35]

Jan Vondrák. 2008. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC. ACM, 67–74.

[36]

Jan Vondrák. 2010. Submodularity and curvature: The optimal algorithm. RIMS Kokyuroku Bessatsu 23 (2010), 253–266.

[37]

K. Yang and J. Stoyanovich. 2017. Measuring fairness in ranked outputs. In ICSSDM.

[38]

A. Zarezade, A. De, U. Upadhyay, H. Rabiee, and M. Gomez-Rodriguez. 2018. Steering social activity: A stochastic optimal control point of view. J. Mach. Learn. Res. 18 (2017), 205–1.

[39]

A. Zarezade, U. Upadhyay, H. Rabiee, and M. Gomez-Rodriguez. 2017. RedQueen: An online algorithm for smart broadcasting in social networks. In WSDM.

[40]

Haifeng Zhang and Yevgeniy Vorobeychik. 2016. Submodular optimization with routing constraints. In AAAI.

Cited By

Biggs BMcMahon JBaldoni PStilwell D(2022)Non-Submodular Maximization via the Greedy Algorithm and the Effects of Limited Information in Multi-Agent Execution2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS47612.2022.9982070(10118-10125)Online publication date: 23-Oct-2022
https://doi.org/10.1109/IROS47612.2022.9982070
Zheng SLiu XXie HLui J(2022)Reposting Service in Online Social Networks: Modeling and Online Incentive Protocols2022 IEEE 30th International Conference on Network Protocols (ICNP)10.1109/ICNP55882.2022.9940336(1-11)Online publication date: 30-Oct-2022
https://doi.org/10.1109/ICNP55882.2022.9940336
He XRen ZYilmaz ENajork MChua T(2021)Graph Technologies for User Modeling and Recommendation: Introduction to the Special Issue - Part 1ACM Transactions on Information Systems10.1145/347759640:2(1-5)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1145/3477596

Index Terms

The Network Visibility Problem
1. Computing methodologies
  1. Machine learning
2. Information systems
  1. World Wide Web
    1. Web applications
      1. Social networks

Recommendations

Understanding and analysing microblogs
WWW '13 Companion: Proceedings of the 22nd International Conference on World Wide Web

Microblogging is a form of blogging where posts typically consist of short content such as quick comments, phrases, URLs, or media, like images and videos. Because of the fast and compact nature of microblogs, users have adopted them for novel purposes, ...
Network restoration under dual failures using path-protecting preconfigured cycles

This paper presents a design algorithm for networks with a restoration mechanism that provides end-to-end path protection to a set of demands with specified working routes, where demands must survive one or two failures in optical networks and these ...
Survey of resource allocation schemes and algorithms in spectrally-spatially flexible optical networking

Space division multiplexing (SDM) is a promising optical network solution with the scaling potential to overcome the possible capacity crunch problem in backbone networks. In SDM optical networks, optical signals are transmitted in parallel through ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Information Systems

ACM Transactions on Information Systems Volume 40, Issue 2

April 2022

587 pages

ISSN:1046-8188

EISSN:1558-2868

DOI:10.1145/3484931

Issue’s Table of Contents

Copyright © 2021 Copyright held by the owner/author(s).

This work is licensed under a Creative Commons Attribution International 4.0 License.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 September 2021

Accepted: 01 April 2021

Revised: 01 February 2021

Received: 01 October 2020

Published in TOIS Volume 40, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
719
Total Downloads

Downloads (Last 12 months)280
Downloads (Last 6 weeks)29

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Biggs BMcMahon JBaldoni PStilwell D(2022)Non-Submodular Maximization via the Greedy Algorithm and the Effects of Limited Information in Multi-Agent Execution2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS47612.2022.9982070(10118-10125)Online publication date: 23-Oct-2022
https://doi.org/10.1109/IROS47612.2022.9982070
Zheng SLiu XXie HLui J(2022)Reposting Service in Online Social Networks: Modeling and Online Incentive Protocols2022 IEEE 30th International Conference on Network Protocols (ICNP)10.1109/ICNP55882.2022.9940336(1-11)Online publication date: 30-Oct-2022
https://doi.org/10.1109/ICNP55882.2022.9940336
He XRen ZYilmaz ENajork MChua T(2021)Graph Technologies for User Modeling and Recommendation: Introduction to the Special Issue - Part 1ACM Transactions on Information Systems10.1145/347759640:2(1-5)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1145/3477596

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents