arXiv subjects

Shazia'Ayn Babul

Publications and source records attributed to Shazia'Ayn Babul.

7 recordsLinked to original sources

arXiv2026

Resting-State EEG Network Profiles Associated with Creative Engagement and Creative Self-Efficacy

Creativity is a core cognitive capacity underlying innovation and adaptive problem solving, yet how it is represented in the brain's intrinsic functional architecture is not fully understood. While resting-state fMRI studies have identified large-scale network correlates associated with differences in creativity, EEG provides the temporal resolution for examining oscillatory dynamics contributing to intrinsic network organization. We examined whether resting-state EEG connectivity patterns are associated with individual differences across multiple creativity-related measures. Thirty healthy young adults completed a multidimensional creativity battery comprising the Inventory of Creative Activities and Achievements (ICAA), the Divergent Association Task (DAT), the Matchstick Arithmetic Puzzles Task (MAPT) and a Self-rating (SR) of creative ability. Graph-theoretical analyses of alpha-band functional connectivity revealed two participant groups, each with distinct patterns of neural activity: Cluster 1 showed reduced global connectivity with relatively preserved left frontal connectivity and greater network modularity; Cluster 0 exhibited stronger overall connectivity strength, reduced modularity and higher local clustering. Notably, Cluster 1 reported higher self-rated creative ability and more frequent engagement in real-world creative activities. These findings suggest that resting-state EEG connectivity patterns are associated with variation in creative self-efficacy and creative engagement, highlighting characteristic patterns of alpha-band network organization observed at rest.

q-bio.NC↗

arXiv2025

Negative Ties Highlight Hidden Extremes in Social Media Polarization

Human interactions in the online world comprise a combination of positive and negative exchanges. These diverse interactions can be captured using signed network representations, where edges take positive or negative weights to indicate the sentiment of the interaction between individuals. Signed networks offer valuable insights into online political polarization by capturing antagonistic interactions and ideological divides on social media platforms. This study analyzes polarization on Meneame, a Spanish social media platform that facilitates engagement with news stories through comments and voting. Using a dual-method approach, Signed Hamiltonian Eigenvector Embedding for Proximity (SHEEP) for signed networks and Correspondence Analysis (CA) for unsigned networks, we investigate how including negative ties enhances the understanding of structural polarization levels across different conversation topics on the platform. While the unsigned Meneame network effectively delineates ideological communities, only by incorporating negative ties can we identify ideologically extreme users who engage in antagonistic behaviors: without them, the most extreme users remain indistinguishable from their less confrontational ideological peers.

physics.soc-ph↗

arXiv2024

Detection of anomalous spatio-temporal patterns of app traffic in response to catastrophic events

In this work, we uncover patterns of usage mobile phone applications and information spread in response to perturbations caused by unprecedented events. We focus on categorizing patterns of response in both space and time and tracking their relaxation over time. To this end, we use the NetMob2023 Data Challenge dataset, which provides mobile phone applications traffic volume data for several cities in France at a spatial resolution of 100$m^2$ and a time resolution of 15 minutes for a time period ranging from March to May 2019. We analyze the spread of information before, during, and after the catastrophic Notre-Dame fire on April 15th and a bombing that took place in the city centre of Lyon on May 24th using volume of data uploaded and downloaded to different mobile applications as a proxy of information transfer dynamics. We identify different clusters of information transfer dynamics in response to the Notre-Dame fire within the city of Paris as well as in other major French cities. We find a clear pattern of significantly above-baseline usage of the application Twitter (currently known as X) in Paris that radially spreads from the area surrounding the Notre-Dame cathedral to the rest of the city. We detect a similar pattern in the city of Lyon in response to the bombing. Further, we present a null model of radial information spread and develop methods of tracking radial patterns over time. Overall, we illustrate novel analytical methods we devise, showing how they enable a new perspective on mobile phone user response to unplanned catastrophic events, giving insight into how information spreads during a catastrophe in both time and space.

physics.soc-ph↗

arXiv2024

Strong and Weak Random Walks on Signed Networks

Random walks play an important role in probing the structure of complex networks. On traditional networks, they can be used to extract community structure, understand node centrality, perform link prediction, or capture the similarity between nodes. On signed networks, where the edge weights can be either positive or negative, it is non-trivial to design a random walk which can be used to extract information about the signed structure of the network, in particular the ability to partition the graph into communities with positive edges inside and negative edges in between. Prior works on signed network random walks focus on the case where there are only two such communities (strong balance), which is rarely the case in empirical networks. In this paper, we propose a signed network random walk which can capture the structure of a network with more than two such communities (weak balance). The walk results in a similarity matrix which can be used to cluster the nodes into antagonistic communities. We compare the characteristics of the so-called strong and weak random walks, in terms of walk length and stationarity. We show through a series of experiments on synthetic and empirical networks that the similarity matrix based on weak walks can be used for both unsupervised and semi-supervised clustering, outperforming the same similarity matrix based on strong walks when the graph has more than two communities, or exhibits asymmetry in the density of links. These results suggest that other random-walk based algorithms for signed networks could be improved simply by running them with weak walks instead of strong walks.

physics.soc-ph↗

arXiv2024

Link Me Baby One More Time: Social Music Discovery on Spotify

We explore the social and contextual factors that influence the outcome of person-to-person music recommendations and discovery. Specifically, we use data from Spotify to investigate how a link sent from one user to another results in the receiver engaging with the music of the shared artist. We consider several factors that may influence this process, such as the strength of the sender-receiver relationship, the user's role in the Spotify social network, their music social cohesion, and how similar the new artist is to the receiver's taste. We find that the receiver of a link is more likely to engage with a new artist when (1) they have similar music taste to the sender and the shared track is a good fit for their taste, (2) they have a stronger and more intimate tie with the sender, and (3) the shared artist is popular amongst the receiver's connections. Finally, we use these findings to build a Random Forest classifier to predict whether a shared music track will result in the receiver's engagement with the shared artist. This model elucidates which type of social and contextual features are most predictive, although peak performance is achieved when a diverse set of features are included. These findings provide new insights into the multifaceted mechanisms underpinning the interplay between music discovery and social processes.

cs.SI↗

arXiv2023

SHEEP: Signed Hamiltonian Eigenvector Embedding for Proximity

We introduce a spectral embedding algorithm for finding proximal relationships between nodes in signed graphs, where edges can take either positive or negative weights. Adopting a physical perspective, we construct a Hamiltonian which is dependent on the distance between nodes, such that relative embedding distance results in a similarity metric between nodes. The Hamiltonian admits a global minimum energy configuration, which can be reconfigured as an eigenvector problem, and therefore is computationally efficient to compute. We use matrix perturbation theory to show that the embedding generates a ground state energy, which can be used as a statistical test for the presence of strong balance, and to develop an energy-based approach for locating the optimal embedding dimension. Finally, we show through a series of experiments on synthetic and empirical networks, that the resulting position in the embedding can be used to recover certain continuous node attributes, and that the distance to the origin in the optimal embedding gives a measure of node extremism.

physics.soc-ph↗

arXiv2022

Gromov Centrality: A Multi-Scale Measure of Network Centrality Using Triangle Inequality Excess

Centrality measures quantify the importance of a node in a network based on different geometric or diffusive properties, and focus on different scales. Here, we adopt a geometrical viewpoint to define a multi-scale centrality in networks. Given a metric distance between the nodes, we measure the centrality of a node by its tendency to be close to geodesics between nodes in its neighborhood, via the concept of triangle inequality excess. Depending on the size of the neighborhood, the resulting Gromov centrality defines the importance of a node at different scales in the graph, and recovers as limits well-known concept such as the clustering coefficient and closeness centrality. We argue that Gromov centrality is affected by the geometric and boundary constraints of the network, and illustrate how it can help distinguish different types of nodes in random geometric graphs and empirical transportation networks.

physics.soc-ph↗