Cited By
View all- Gao S(2022)Fixed-Point Centrality for Networks2022 IEEE 61st Conference on Decision and Control (CDC)10.1109/CDC51059.2022.9993307(1628-1635)Online publication date: 6-Dec-2022
Centrality with Diversity
Pages 644 - 652
Abstract
Graph centrality measures use the structure of a network to quantify central or "important" nodes, with applications in web search, social media analysis, and graphical data mining generally. Traditional centrality measures such as the well known PageRank interpret a directed edge as a vote in favor of the importance of the linked node. We study the case where nodes may belong to diverse communities or interests and investigate centrality measures that can identify nodes that are simultaneously important to many such diverse communities. We propose a family of diverse centrality measures formed as fixed point solutions to a generalized nonlinear eigenvalue problem. Our measure can be efficiently computed on large graphs by iterated best response and we study its normative properties on both random graph models and real-world data. We find that we are consistently and efficiently able to identify the most important diverse nodes of a graph, that is, those that are simultaneously central to multiple communities.
References
[1]
2019. https://www.govtrack.us/congress/members/report-cards/2019/senate/ cosponsored-other-party
[2]
Lada A. Adamic and Natalie Glance. 2005. The political blogosphere and the 2004 U.S. election. In LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery (KDD '05). 36--43.
[3]
Réka Albert and Albert-László Barabási. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 74 (Jan 2002), 47--97. Issue 1.
[4]
J. Angwin, J. Larson, S. Mattu, and L. Kirchner. 2016. Machine bias: There's software used across the country to predict future criminals. And it's biased against blacks. ProPublica (May 2016). https://www.propublica.org/article/ machine-bias-risk-assessments-in-criminal-sentencing
[5]
Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, 10 (oct 2008).
[6]
Ulrik Brandes. 2001. A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology 25, 2 (2001), 163--177. https://doi.org/10.1080/0022250X. 2001.9990249 arXiv:https://doi.org/10.1080/0022250X.2001.9990249
[7]
E. Budish. 2011. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes. J. Political Economy 119, 6 (2011), 1061 -- 1103.
[8]
Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, and Junxing Wang. 2019. The Unreasonable Fairness of Maximum Nash Welfare. ACM Trans. Econ. Comput. 7, 3, Article 12 (Sept. 2019), 32 pages. https: //doi.org/10.1145/3355902
[9]
Raffaele Chiappinelli. 2018. What Do You Mean by ?Nonlinear Eigenvalue Problems'' Axioms 7 (06 2018), 39.
[10]
M. H. DeGroot. 1974. Reaching a consensus. J. American Statistical Association 69 (1974), 118--121.
[11]
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard S. Zemel. 2012. Fairness through awareness. In Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8--10, 2012. 214--226.
[12]
P. Erdös and A. Rényi. 1959. On Random Graphs I. Publicationes Mathematicae Debrecen 6 (1959), 290.
[13]
M. G. Everett and S. P. Borgatti. 1999. The centrality of groups and classes. The Journal of Mathematical Sociology 23, 3 (1999), 181--201.
[14]
Linton C Freeman. 1977. A set of measures of centrality based on betweenness. Sociometry (1977), 35--41.
[15]
N. E. Friedkin and E. C. Johnsen. 1990. Social Influence and Opinions. J. Mathematical Sociology 15, 3--4 (1990), 193--205.
[16]
Tatsunori Hashimoto, Megha Srivastava, Hongseok Namkoong, and Percy Liang. 2018. Fairness Without Demographics in Repeated Loss Minimization. In Proceedings of the 35th International Conference on Machine Learning (ICML). 1929--1938.
[17]
Taher H. Haveliwala. 2002. Topic-Sensitive PageRank. In Proceedings of the 11th International Conference on World Wide Web (Honolulu, Hawaii, USA) (WWW '02). Association for Computing Machinery, New York, NY, USA, 517--526.
[18]
R. Hegselmann and U. Krause. 2002. Opinion dynamics and bounded confidence models, analysis, and simulation. Artificial Societies and Social Simulations 5, 3 (2002).
[19]
J. E. Hirsch. 2005. An index to quantify an individual's scientific research output. Proceedings of the National Academy of Sciences 102, 46 (2005), 16569--16572.
[20]
Mathieu Jacomy, Tommaso Venturini, Sebastien Heymann, and Mathieu Bastian. 2014. ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software. PLOS ONE 9, 6 (06 2014), 1--12.
[21]
Glen Jeh and Jennifer Widom. 2003. Scaling Personalized Web Search. In Proceedings of the 12th International Conference on World Wide Web (Budapest, Hungary) (WWW '03). Association for Computing Machinery, New York, NY, USA, 271--279.
[22]
Jianbo Shi and J. Malik. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 8 (2000), 888--905.
[23]
Xue-Mei Jiang, Gui-Rong Xue, Wen-Guan Song, Hua-Jun Zeng, Zheng Chen, and Wei-Ying Ma. 2004. Exploiting PageRank at Different Block Level. In Web Information Systems -- WISE 2004, Xiaofang Zhou, Stanley Su, Mike P. Papazoglou, Maria Elzbieta Orlowska, and Keith Jeffery (Eds.). 241--252.
[24]
Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. 2003. Extrapolation Methods for Accelerating PageRank Computations. In Proceedings of the 12th International Conference on World Wide Web (WWW '03). Association for Computing Machinery, 261--270.
[25]
Przemys?aw Kazienko and Tomasz Kajdanowicz. 2012. Label-dependent node classification in the network. Neurocomputing 75 (01 2012), 199--209.
[26]
Jon M. Kleinberg, Sendhil Mullainathan, and Manish Raghavan. 2016. Inherent Trade-Offs in the Fair Determination of Risk Scores. CoRR abs/1609.05807 (2016). http://arxiv.org/abs/1609.05807
[27]
Isabel M. Kloumann, Johan Ugander, and Jon Kleinberg. 2017. Block models and personalized PageRank. Proceedings of the National Academy of Sciences 114, 1 (2017), 33--38.
[28]
Silvio Lattanzi and D. Sivakumar. 2009. Affiliation Networks. In Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing (STOC '09). Association for Computing Machinery, New York, NY, USA, 427--434.
[29]
Jure Leskovec, Kevin J. Lang, and Michael Mahoney. 2010. Empirical Comparison of Algorithms for Network Community Detection. In Proceedings of the 19th International Conference on World Wide Web (WWW '10). 631--640.
[30]
Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999- 66. Stanford InfoLab. http://ilpubs.stanford.edu:8090/422/ Previous number = SIDL-WP-1999-0120.
[31]
Geoff Pleiss, Manish Raghavan, Felix Wu, Jon Kleinberg, and Kilian Q Weinberger. 2017. On Fairness and Calibration. In Advances in Neural Information Processing Systems (NIPS). 5680--5689.
[32]
Keith T. Poole and Howard Rosenthal. 1985. A Spatial Model for Legislative Roll Call Analysis. American Journal of Political Science 29, 2 (1985), 357--384.
[33]
H. R. Varian. 1976. Two problems in the theory of fairness. Journal of Public Economics 5, 3--4 (1976), 249--260.
[34]
G. Weisbuch, G. Deffuant, F. Amblard, and J-P. Nadal. 2002. Meet, discuss and Segregate! Complexity 7, 3 (2002), 55--63.
[35]
Jierui Xie, Stephen Kelley, and Boleslaw K. Szymanski. 2013. Overlapping Community Detection in Networks: The State-of-the-Art and Comparative Study. ACM Comput. Surv. 45, 4 (Aug. 2013).
[36]
J. Yang, J. McAuley, and J. Leskovec. 2013. Community Detection in Networks with Node Attributes. In Proc. IEEE Intl. Conf. Data Mining. 1151--1156.
Recommendations
A Family of Centrality Measures for Graph Data Based on Subgraphs
We present the theoretical foundations and first experimental study of a new approach in centrality measures for graph data. The main principle is straightforward: the more relevant subgraphs around a vertex, the more central it is in the network. We ...
Laplacian centrality: A new centrality measure for weighted networks
The centrality of vertices has been a key issue in network analysis. For unweighted networks where edges are just present or absent and have no weight attached, many centrality measures have been presented, such as degree, betweenness, closeness, ...
Power walk: revisiting the random surfer
ADCS '13: Proceedings of the 18th Australasian Document Computing SymposiumMeasurement of graph centrality provides us with an indication of the importance or popularity of each vertex in a graph. When dealing with graphs that are not centrally controlled (such as the Web, social networks and academic citation graphs), ...
Comments
Information & Contributors
Information
Published In
March 2021
1192 pages
ISBN:9781450382977
DOI:10.1145/3437963
- General Chairs:
- Liane Lewin-Eytan,
- David Carmel,
- Elad Yom-Tov,
- Program Chairs:
- Eugene Agichtein,
- Evgeniy Gabrilovich
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 March 2021
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining
March 8 - 12, 2021
Virtual Event, Israel
Acceptance Rates
Overall Acceptance Rate 498 of 2,863 submissions, 17%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 319Total Downloads
- Downloads (Last 12 months)74
- Downloads (Last 6 weeks)10
Reflects downloads up to
Other Metrics
Citations
Cited By
View all- Gao S(2022)Fixed-Point Centrality for Networks2022 IEEE 61st Conference on Decision and Control (CDC)10.1109/CDC51059.2022.9993307(1628-1635)Online publication date: 6-Dec-2022
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in