arXiv subjects

Ali Faqeeh

Publications and source records attributed to Ali Faqeeh.

10 recordsLinked to original sources

arXiv2024

Climate Policy Elites' Twitter Interactions across Nine Countries

Social media is an important space for interactions between climate policy actors, with a burgeoning literature recognizing them as critical platforms of political contestation. We identified Twitter accounts associated with 904 climate change policy actors across nine countries, and collected their activities from 2017--2022, totalling 40 million activities from 16,086 accounts at different organizational levels. We studied these actors and their interactions as a polycentric governance system, emphasizing how boundary blurring between the public and private on social media platforms uniquely shapes the online policy process. Initial results show there is considerable temporal and cross-national variation in how prominent climate-related activities were, but all national policy systems generally responded to climate-related events, such as climate protests, in a similar manner. Examining patterns of interaction within and across countries, we find that these national policy systems rarely directly interact with one another, but are connected through consistently engaging with the same content produced by accounts of international organizations, climate activists, and researchers.

cs.SI↗

arXiv2024

Multiway Alignment of Political Attitudes

The related concepts of partisan belief systems, issue alignment, and partisan sorting are central to our understanding of politics. These phenomena have been studied using measures of alignment between pairs of topics, or how much individuals' attitudes toward a topic reveal about their attitudes toward another topic. We introduce a higher-order measure that extends the assessment of alignment beyond pairs of topics by quantifying the amount of information individuals' opinions on one topic reveal about a set of topics simultaneously. Applying this approach to legislative voting behavior shows that parliamentary systems typically exhibit similar multiway alignment characteristics, but can change in response to shifting intergroup dynamics. In American National Election Studies surveys, our approach reveals a growing significance of party identification together with a consistent rise in multiway alignment over time.

cs.SI↗

arXiv2024

Time-dependent influence metric for cascade dynamics on networks

An algorithm for efficiently calculating the expected size of single-seed cascade dynamics on networks is proposed and tested. The expected size is a time-dependent quantity and so enables the identification of nodes who are the most influential early or late in the spreading process. The measure is accurate for both critical and subcritical dynamic regimes and so generalises the nonbacktracking centrality that was previously shown to successfully identify the most influential single spreaders in a model of critical epidemics on networks.

physics.soc-ph↗

arXiv2022

Epidemic Spreading and Digital Contact Tracing: Effects of Heterogeneous Mixing and Quarantine Failures

Contact tracing via digital tracking applications installed on mobile phones is an important tool for controlling epidemic spreading. Its effectivity can be quantified by modifying the standard methodology for analyzing percolation and connectivity of contact networks. We apply this framework to networks with varying degree distributions, numbers of application users, and probabilities of quarantine failures. Further, we study structured populations with homophily and heterophily and the possibility of degree-targeted application distribution. Our results are based on a combination of explicit simulations and mean-field analysis. They indicate that there can be major differences in the epidemic size and epidemic probabilities which are equivalent in the normal SIR processes. Further, degree heterogeneity is seen to be especially important for the epidemic threshold but not as much for the epidemic size. The probability that tracing leads to quarantines is not as important as the application adoption rate. Finally, both strong homophily and especially heterophily with regard to application adoption can be detrimental. Overall, epidemic dynamics are very sensitive to all of the parameter values we tested out, which makes the problem of estimating the effect of digital contact tracing an inherently multidimensional problem.

physics.soc-ph↗

arXiv2018

Influence maximization in noisy networks

We consider the problem of identifying the most influential nodes for a spreading process on a network when prior knowledge about structure and dynamics of the system is incomplete or erroneous. Specifically, we perform a numerical analysis where the set of top spreaders is determined on the basis of prior information that is artificially altered by a certain level of noise. We then measure the optimality of the chosen set by measuring its spreading impact in the true system. Whereas we find that the identification of top spreaders is optimal when prior knowledge is complete and free of mistakes, we also find that the quality of the top spreaders identified using noisy information doesn't necessarily decrease as the noise level increases. For instance, we show that it is generally possible to compensate for erroneous information about dynamical parameters by adding synthetic errors in the structure of the network. Further, we show that, in some dynamical regimes, even completely losing prior knowledge on network structure may be better than relying on certain but incomplete information.

physics.soc-ph↗

arXiv2018

Characterizing the analogy between hyperbolic embedding and community structure of complex networks

We show that the community structure of a network can be used as a coarse version of its embedding in a hidden space with hyperbolic geometry. The finding emerges from a systematic analysis of several real-world and synthetic networks. We take advantage of the analogy for reinterpreting results originally obtained through network hyperbolic embedding in terms of community structure only. First, we show that the robustness of a multiplex network can be controlled by tuning the correlation between the community structures across different layers. Second, we deploy an efficient greedy protocol for network navigability that makes use of routing tables based on community structure.

physics.soc-ph↗

arXiv2017

Optimal percolation on multiplex networks

Optimal percolation is the problem of finding the minimal set of nodes such that if the members of this set are removed from a network, the network is fragmented into non-extensive disconnected clusters. The solution of the optimal percolation problem has direct applicability in strategies of immunization in disease spreading processes, and influence maximization for certain classes of opinion dynamical models. In this paper, we consider the problem of optimal percolation on multiplex networks. The multiplex scenario serves to realistically model various technological, biological, and social networks. We find that the multilayer nature of these systems, and more precisely multiplex characteristics such as edge overlap and interlayer degree-degree correlation, profoundly changes the properties of the set of nodes identified as the solution of the optimal percolation problem.

physics.soc-ph↗

arXiv2015

Emergence of coexisting percolating clusters in networks

It is commonly assumed in percolation theories that at most one percolating cluster can exist in a network. We introduce sausage-like networks (SLNs), an ensemble of synthetic modular networks in which more than one percolating cluster can appear. We show that coexisting percolating clusters (CPCs) emerge in such networks due to limited mixing, i.e., a small number of interlinks between pairs of modules. We develop an approach called modular message passing (MMP) to describe and verify these observations. We demonstrate that the appearance of CPCs is an important source of inaccuracy in the previously introduced percolation theories, such as the message passing (MP) approach. Moreover, we show that the MMP theory improves significantly over the predictions of MP for percolation on synthetic networks with limited mixing and also on several real-world networks. These findings have important implications for understanding the robustness of networks and in quantifying epidemic outbreaks in the susceptible-infected-recovered (SIR) model of disease spread.

cond-mat.dis-nn↗

arXiv2015

Network cloning unfolds the effect of clustering on dynamical processes

We introduce network $L$-cloning, a technique for creating ensembles of random networks from any given real-world or artificial network. Each member of the ensemble is an $L$-cloned network constructed from $L$ copies of the original network. The degree distribution of an $L$-cloned network and, more importantly, the degree-degree correlation between and beyond nearest neighbors are identical to those of the original network. The density of triangles in an \LC network, and hence its clustering coefficient, is reduced by a factor of $L$ compared to those of the original network. Furthermore, the density of loops of any fixed length approaches zero for sufficiently large values of $L$. Other variants of $L$-cloning allow us to keep intact the short loops of certain lengths. As an application, we employ these network cloning methods to investigate the effect of short loops on dynamical processes running on networks and to inspect the accuracy of corresponding tree-based theories. We demonstrate that dynamics on $L$-cloned networks (with sufficiently large $L$) are accurately described by the so-called adjacency tree-based theories, examples of which include the message passing technique, some pair approximation methods, and the belief propagation algorithm used respectively to study bond percolation, SI epidemics, and the Ising model.

physics.soc-ph↗

arXiv2011

Community detection based on "clumpiness" matrix in complex networks

The "clumpiness" matrix of a network is used to develop a method to identify its community structure. A "projection space" is constructed from the eigenvectors of the clumpiness matrix and a border line is defined using some kind of angular distance in this space. The community structure of the network is identified using this borderline and/or hierarchical clustering methods. The performance of our algorithm is tested on some computer-generated and real-world networks. The accuracy of the results is checked using normalized mutual information. The effect of community size heterogeneity on the accuracy of the method is also discussed.

physics.soc-ph↗