Sudarshan Iyengar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sudarshan Iyengar has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Akrati Saxena
LIACS, Leiden University, Leiden, Netherlands
11 shared publications - Anamika Chhabra
Department of Computer Science and Engineering Indian Institute of Technology Ropar India
4 shared publications - Rishemjit Kaur
CSIR-Central Scientific Instruments Organization, Chandigarh, India
4 shared publications - Yayati Gupta
Indian Institute of Technology Ropar
4 shared publications - Maneet Singh
Indian Institute of Technology Ropar
3 shared publications - Ralucca Gera
Naval Postgraduate School
3 shared publications
Latest Publications
- 15 July 2025
- Published by Springer Nature in Journal of Computational Social Science
- Vol. 8 (3) , 1-17
Multi-opinion based method for quantifying polarization on social networks
- 15 July 2025
- Published by Springer Nature in Journal of Computational Social Science
- Vol. 8 (3) , 1-17
Multi-opinion based method for quantifying polarization on social networks
- Open Access
A Multi-Opinion Based Method for Quantifying Polarization on Social Networks
Social media platforms have emerged as a hub for political and social interactions, and analyzing the polarization of opinions has been gaining attention. In this study, we have proposed a measure to quantify polarization on social networks. The proposed metric, unlike state-of-the-art methods, does not assume a two-opinion case and applies to multiple opinions. We tested our metric on different networks with a multi-opinion scenario and varying degrees of polarization. The scores obtained from the proposed metric were comparable to state-of-the-art methods on binary opinion-based benchmark networks. The technique also differentiated among networks with different levels of polarization in a multi-opinion scenario. We also quantified polarization in a retweet network obtained from Twitter regarding the usage of drugs like hydroxychloroquine or chloroquine in treating COVID-19. Our metric indicated a high level of polarized opinions among the users. These findings suggest uncertainty among users in the benefits of using hydroxychloroquine and chloroquine drugs to treat COVID-19 patients.
Open AccessA Multi-Opinion Based Method for Quantifying Polarization on Social Networks
Social media platforms have emerged as a hub for political and social interactions, and analyzing the polarization of opinions has been gaining attention. In this study, we have proposed a measure to quantify polarization on social networks. The proposed metric, unlike state-of-the-art methods, does not assume a two-opinion case and applies to multiple opinions. We tested our metric on different networks with a multi-opinion scenario and varying degrees of polarization. The scores obtained from the proposed metric were comparable to state-of-the-art methods on binary opinion-based benchmark networks. The technique also differentiated among networks with different levels of polarization in a multi-opinion scenario. We also quantified polarization in a retweet network obtained from Twitter regarding the usage of drugs like hydroxychloroquine or chloroquine in treating COVID-19. Our metric indicated a high level of polarized opinions among the users. These findings suggest uncertainty among users in the benefits of using hydroxychloroquine and chloroquine drugs to treat COVID-19 patients.
- Open Access
A Bi-level assessment of Twitter in predicting the results of an election: Delhi Assembly Elections 2020
Elections are the backbone of any democratic country, where voters elect the candidates as their representatives. The emergence of social networking sites has provided a platform for political parties and their candidates to connect with voters in order to spread their political ideas. Our study aims to use Twitter in assessing the outcome of Delhi Assembly elections held in 2020, using a bi-level approach, i.e., concerning political parties and their candidates. We analyze the correlation of election results with the activities of different candidates and parties on Twitter, and the response of voters on them, especially the mentions and sentiment of voters towards a party. The Twitter profiles of the candidates are compared both at the party level as well as the candidate level to evaluate their association with the outcome of the election. We observe that the number of followers and the replies to the tweets of candidates are good indicators for predicting actual election outcome. However, we observe that the number of tweets mentioning a party and the sentiment of voters towards the party shown in tweets are not aligned with the election result. We also use machine learning models on various features such as linguistic, word embeddings and moral dimensions for predicting the election result (win or lose). The random forest model using tweet features provides promising results for predicting if the tweet belongs to a winning or losing candidate.
Open AccessA Bi-level assessment of Twitter in predicting the results of an election: Delhi Assembly Elections 2020
Elections are the backbone of any democratic country, where voters elect the candidates as their representatives. The emergence of social networking sites has provided a platform for political parties and their candidates to connect with voters in order to spread their political ideas. Our study aims to use Twitter in assessing the outcome of Delhi Assembly elections held in 2020, using a bi-level approach, i.e., concerning political parties and their candidates. We analyze the correlation of election results with the activities of different candidates and parties on Twitter, and the response of voters on them, especially the mentions and sentiment of voters towards a party. The Twitter profiles of the candidates are compared both at the party level as well as the candidate level to evaluate their association with the outcome of the election. We observe that the number of followers and the replies to the tweets of candidates are good indicators for predicting actual election outcome. However, we observe that the number of tweets mentioning a party and the sentiment of voters towards the party shown in tweets are not aligned with the election result. We also use machine learning models on various features such as linguistic, word embeddings and moral dimensions for predicting the election result (win or lose). The random forest model using tweet features provides promising results for predicting if the tweet belongs to a winning or losing candidate.
- Open Access
Morality-based Assertion and Homophily on Social Media: A Cultural Comparison between English and Japanese Languages
Moral psychology is a domain that deals with moral identity, appraisals and emotions. Previous work has primarily focused on moral development and the associated role of culture. Knowing that language is an inherent element of a culture, we used the social media platform Twitter to compare moral behaviors of Japanese tweets with English tweets. The five basic moral foundations, i.e., Care, Fairness, Ingroup, Authority and Purity, along with the associated emotional valence were compared between English and Japanese tweets. The tweets from Japanese users depicted relatively higher Fairness, Ingroup, and Purity, whereas English tweets expressed more positive emotions for all moral dimensions. Considering moral similarities in connecting users on social media, we quantified homophily concerning different moral dimensions using our proposed method. The moral dimensions Care, Authority and Purity for English and Ingroup, Authority and Purity for Japanese depicted homophily on Twitter. Overall, our study uncovers the underlying cultural differences with respect to moral behavior in English- and Japanese-speaking users.
Open AccessMorality-based Assertion and Homophily on Social Media: A Cultural Comparison between English and Japanese Languages
Moral psychology is a domain that deals with moral identity, appraisals and emotions. Previous work has primarily focused on moral development and the associated role of culture. Knowing that language is an inherent element of a culture, we used the social media platform Twitter to compare moral behaviors of Japanese tweets with English tweets. The five basic moral foundations, i.e., Care, Fairness, Ingroup, Authority and Purity, along with the associated emotional valence were compared between English and Japanese tweets. The tweets from Japanese users depicted relatively higher Fairness, Ingroup, and Purity, whereas English tweets expressed more positive emotions for all moral dimensions. Considering moral similarities in connecting users on social media, we quantified homophily concerning different moral dimensions using our proposed method. The moral dimensions Care, Authority and Purity for English and Ingroup, Authority and Purity for Japanese depicted homophily on Twitter. Overall, our study uncovers the underlying cultural differences with respect to moral behavior in English- and Japanese-speaking users.
- 15 October 2021
- Published by Springer Nature in Journal of Computers in Education
- Vol. 9 (3) , 315-349
How well do the students understand the course contents? Assessing comprehension through course videos
- 15 October 2021
- Published by Springer Nature in Journal of Computers in Education
- Vol. 9 (3) , 315-349
How well do the students understand the course contents? Assessing comprehension through course videos
- Open Access
Centrality Measures in Complex Networks: A Survey
In complex networks, each node has some unique characteristics that define the importance of the node based on the given application-specific context. These characteristics can be identified using various centrality metrics defined in the literature. Some of these centrality measures can be computed using local information of the node, such as degree centrality and semi-local centrality measure. Others use global information of the network like closeness centrality, betweenness centrality, eigenvector centrality, Katz centrality, PageRank, and so on. In this survey, we discuss these centrality measures and the state of the art literature that includes the extension of centrality measures to different types of networks, methods to update centrality values in dynamic networks, methods to identify top-k nodes, approximation algorithms, open research problems related to the domain, and so on. The paper is concluded with a discussion on application specific centrality measures that will help to choose a centrality measure based on the network type and application requirements.
Open AccessCentrality Measures in Complex Networks: A Survey
In complex networks, each node has some unique characteristics that define the importance of the node based on the given application-specific context. These characteristics can be identified using various centrality metrics defined in the literature. Some of these centrality measures can be computed using local information of the node, such as degree centrality and semi-local centrality measure. Others use global information of the network like closeness centrality, betweenness centrality, eigenvector centrality, Katz centrality, PageRank, and so on. In this survey, we discuss these centrality measures and the state of the art literature that includes the extension of centrality measures to different types of networks, methods to update centrality values in dynamic networks, methods to identify top-k nodes, approximation algorithms, open research problems related to the domain, and so on. The paper is concluded with a discussion on application specific centrality measures that will help to choose a centrality measure based on the network type and application requirements.
- Open Access
- 1 April 2020
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2020 (2) , 537-557
Identifying Influential Spreaders in a Social Network (While Preserving Privacy)
In order to disseminate information in a social network, it is important to first identify the influential spreaders in the network. Using them as the seed spreaders, the aim is to ensure that the information is cascaded throughout the network. The traditional approach to identifying influential nodes is to determine the top-r ranked nodes in accordance with various ranking methods such as PageRank, k-Shell decomposition, ClusterRank and VoteRank. In the current work, we study the problem of ranking the nodes when the underlying graph is distributedly held by a set of individuals, who consider their share of the data as private information. In particular, we design efficient secure multiparty computation (MPC) protocols for k-Shell decomposition, PageRank and VoteRank. For improved efficiency, we employ the oblivious RAM construct in conjunction with efficient data-oblivious graph data structures. We are the first to propose a secure variant of the VoteRank algorithm. We prove that the proposed protocols are asymptotically more efficient and have lower runtime in practice than the previous best known MPC protocols for computing k-Shell decomposition and PageRank centrality scores.
- 1 April 2020
- Published by Privacy Enhancing Technologies Symposium Advisory Board in Proceedings on Privacy Enhancing Technologies
- Vol. 2020 (2) , 537-557
Open AccessIdentifying Influential Spreaders in a Social Network (While Preserving Privacy)
In order to disseminate information in a social network, it is important to first identify the influential spreaders in the network. Using them as the seed spreaders, the aim is to ensure that the information is cascaded throughout the network. The traditional approach to identifying influential nodes is to determine the top-r ranked nodes in accordance with various ranking methods such as PageRank, k-Shell decomposition, ClusterRank and VoteRank. In the current work, we study the problem of ranking the nodes when the underlying graph is distributedly held by a set of individuals, who consider their share of the data as private information. In particular, we design efficient secure multiparty computation (MPC) protocols for k-Shell decomposition, PageRank and VoteRank. For improved efficiency, we employ the oblivious RAM construct in conjunction with efficient data-oblivious graph data structures. We are the first to propose a secure variant of the VoteRank algorithm. We prove that the proposed protocols are asymptotically more efficient and have lower runtime in practice than the previous best known MPC protocols for computing k-Shell decomposition and PageRank centrality scores.
- Open Access
Investigating Ortega Hypothesis in Q&A portals: An Analysis of StackOverflow
Ortega Hypothesis considers masses, i.e., a large number of average people who are not specially qualified as being instrumental in any system's progress. This hypothesis has been reasonably examined in the scientific domain where it has been supported by a few works while refuted by many others, resulting in no clear consensus. While the hypothesis has only been explored in the scientific domain so far, it has hardly been examined in other fields. Given the large-scale collaboration facilitated by the modern Q&A portals where a crowd with a diverse skill-set contributes, an investigation of this hypothesis becomes necessary for informed policy-making. In this work, we investigate the research question inspired by Ortega Hypothesis in StackOverflow where we examine the contribution made by masses and check whether the system may continue to function well even in their absence. The results point towards the importance of masses in Q&A portals for the little but useful contribution that they provide. The insights obtained from the study may help in devising informed incentivization policies enabling better utilization of the potential of the users.
Open AccessInvestigating Ortega Hypothesis in Q&A portals: An Analysis of StackOverflow
Ortega Hypothesis considers masses, i.e., a large number of average people who are not specially qualified as being instrumental in any system's progress. This hypothesis has been reasonably examined in the scientific domain where it has been supported by a few works while refuted by many others, resulting in no clear consensus. While the hypothesis has only been explored in the scientific domain so far, it has hardly been examined in other fields. Given the large-scale collaboration facilitated by the modern Q&A portals where a crowd with a diverse skill-set contributes, an investigation of this hypothesis becomes necessary for informed policy-making. In this work, we investigate the research question inspired by Ortega Hypothesis in StackOverflow where we examine the contribution made by masses and check whether the system may continue to function well even in their absence. The results point towards the importance of masses in Q&A portals for the little but useful contribution that they provide. The insights obtained from the study may help in devising informed incentivization policies enabling better utilization of the potential of the users.
- 5 December 2018
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 9 (1) , 3
A heuristic approach to estimate nodes’ closeness rank using the properties of real world networks
- 5 December 2018
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 9 (1) , 3
A heuristic approach to estimate nodes’ closeness rank using the properties of real world networks
- 3 December 2018
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 9 (1) , 2
Modeling memetics using edge diversity
- 3 December 2018
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 9 (1) , 2
Modeling memetics using edge diversity