Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “physics.soc-ph”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 883 records · Page 49Linked to original sources

The role of centrality for the identification of influential spreaders in complex networks

The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumor-like dynamics. Recent works have suggested that the identification of influential spreaders is not independent of the dynamics being studied. For instance, the key disease spreaders might not necessarily be so when it comes to analyze social contagion or rumor propagation. Additionally, it has been shown that different metrics (degree, coreness, etc) might identify different influential nodes even for the same dynamical processes with diverse degree of accuracy. In this paper, we investigate how nine centrality measures correlate with the disease and rumor spreading capabilities of the nodes that made up different synthetic and real-world (both spatial and non-spatial) networks. We also propose a generalization of the random walk accessibility as a new centrality measure and derive analytical expressions for the latter measure for simple network configurations. Our results show that for non-spatial networks, the $k$-core and degree centralities are most correlated to epidemic spreading, whereas the average neighborhood degree, the closeness centrality and accessibility are most related to rumor dynamics. On the contrary, for spatial networks, the accessibility measure outperforms the rest of centrality metrics in almost all cases regardless of the kind of dynamics considered. Therefore, an important consequence of our analysis is that previous studies performed in synthetic random networks cannot be generalized to the case of spatial networks.

physics.soc-ph↗

Collective computation in a network with distributed information

We analyze a distributed information network in which each node has access to the information contained in a limited set of nodes (its neighborhood) at a given time. A collective computation is carried out in which each node calculates a value that implies all information contained in the network (in our case, the average value of a variable that can take different values in each network node). The neighborhoods can change dynamically by exchanging neighbors with other nodes. The results of this collective calculation show rapid convergence and good scalability with the network size. These results are compared with those of a fixed network arranged as a square lattice, in which the number of rounds to achieve a given accuracy is very high when the size of the network increases. The results for the evolving networks are interpreted in light of the properties of complex networks and are directly relevant to the diameter and characteristic path length of the networks, which seem to express "small world" properties.

cs.SI↗

Resilience of modular complex networks

Complex networks often have a modular structure, where a number of tightly- connected groups of nodes (modules) have relatively few interconnections. Modularity had been shown to have an important effect on the evolution and stability of biological networks, on the scalability and efficiency of large-scale infrastructure, and the development of economic and social systems. An analytical framework for understanding modularity and its effects on network vulnerability is still missing. Through recent advances in the understanding of multilayer networks, however, it is now possible to develop a theoretical framework to systematically study this critical issue. Here we study, analytically and numerically, the resilience of modular networks under attacks on interconnected nodes, which exhibit high betweenness values and are often more exposed to failure. Our model provides new understandings into the feedback between structure and function in real world systems, and consequently has important implications as diverse as developing efficient immunization strategies, designing robust large-scale infrastructure, and understanding brain function.

physics.soc-ph↗

Comparison of the Research Effectiveness of Chemistry Nobelists and Fields Medalist Mathematicians with Google Scholar: the Yule-Simon Model

This paper uses the Yule-Simon model to estimate to what extent the work of chemistry Nobelists and Fields medalist mathematicians is incorporated into the knowledge corpus of their disciplines as measured by Google Scholar inlinks. Due to differences in the disciplines and prizes, it finds that the work of chemistry Nobelists is better incorporated than that of Fields medalists.

cs.DL↗

InfluenceTracker: Rating the impact of a Twitter account

We describe a methodology of rating the influence of a Twitter ac-count in this famous microblogging service. We then evaluate it over real ac-counts, under the belief that influence is not only a matter of quantity (amount of followers), but also a mixture of quality measures that reflect interaction, awareness, and visibility in the social sphere. The authors of this paper have created InfluenceTracker, a publicly available website where anyone can rate and compare the recent activity of any Twitter account.

cs.SI↗

CitNetExplorer: A new software tool for analyzing and visualizing citation networks

We present CitNetExplorer, a new software tool for analyzing and visualizing citation networks of scientific publications. CitNetExplorer can for instance be used to study the development of a research field, to delineate the literature on a research topic, and to support literature reviewing. We first introduce the main concepts that need to be understood when working with CitNetExplorer. We then demonstrate CitNetExplorer by using the tool to analyze the scientometric literature and the literature on community detection in networks. Finally, we discuss some technical details on the construction, visualization, and analysis of citation networks in CitNetExplorer.

cs.DL↗

Using Triangles to Improve Community Detection in Directed Networks

In a graph, a community may be loosely defined as a group of nodes that are more closely connected to one another than to the rest of the graph. While there are a variety of metrics that can be used to specify the quality of a given community, one common theme is that flows tend to stay within communities. Hence, we expect cycles to play an important role in community detection. For undirected graphs, the importance of triangles -- an undirected 3-cycle -- has been known for a long time and can be used to improve community detection. In directed graphs, the situation is more nuanced. The smallest cycle is simply two nodes with a reciprocal connection, and using information about reciprocation has proven to improve community detection. Our new idea is based on the four types of directed triangles that contain cycles. To identify communities in directed networks, then, we propose an undirected edge-weighting scheme based on the type of the directed triangles in which edges are involved. We also propose a new metric on quality of the communities that is based on the number of 3-cycles that are split across communities. To demonstrate the impact of our new weighting, we use the standard METIS graph partitioning tool to determine communities and show experimentally that the resulting communities result in fewer 3-cycles being cut. The magnitude of the effect varies between a 10 and 50% reduction, and we also find evidence that this weighting scheme improves a task where plausible ground-truth communities are known.

cs.SI↗

STFU NOOB! Predicting Crowdsourced Decisions on Toxic Behavior in Online Games

One problem facing players of competitive games is negative, or toxic, behavior. League of Legends, the largest eSport game, uses a crowdsourcing platform called the Tribunal to judge whether a reported toxic player should be punished or not. The Tribunal is a two stage system requiring reports from those players that directly observe toxic behavior, and human experts that review aggregated reports. While this system has successfully dealt with the vague nature of toxic behavior by majority rules based on many votes, it naturally requires tremendous cost, time, and human efforts. In this paper, we propose a supervised learning approach for predicting crowdsourced decisions on toxic behavior with large-scale labeled data collections; over 10 million user reports involved in 1.46 million toxic players and corresponding crowdsourced decisions. Our result shows good performance in detecting overwhelmingly majority cases and predicting crowdsourced decisions on them. We demonstrate good portability of our classifier across regions. Finally, we estimate the practical implications of our approach, potential cost savings and victim protection.

cs.SI↗

Degree Variance and Emotional Strategies Catalyze Cooperation in Dynamic Signed Networks

We study the problem of the emergence of cooperation in dynamic signed networks where agent strategies coevolve with relational signs and network topology. Running simulations based on an agent-based model, we compare results obtained in a regular lattice initialization with those obtained on a comparable random network initialization. We show that the increased degree heterogeneity at the outset enlarges the parametric conditions in which cooperation survives in the long run. Furthermore, we show how the presence of sign-dependent emotional strategies catalyze the evolution of cooperation with both network topology initializations.

physics.soc-ph↗

Resource Redistribution Method for Short-Term Recovery of Society after Large Scale Disasters

Recovery of society after a large scale disaster generally consists of two phases, short- and long-term recoveries. The main goal of the short-term recovery is to bounce the damaged system back to the operating standards enabling residents in damaged cities to survive, and fast supply with vital resources to them is one of its important elements. We propose a general principle by which the required redistribution of vital resources between the affected and neighbouring cities can be efficiently implemented. The short-term recovery is a rescuer operation where uncertainty in evaluating the state of damaged region is highly probable. To allow for such an operation the developed principle involves two basic components. The first one of ethic nature is the triage concept determining the current city priority in the resource delivery. The second one is the minimization of the delivery time subjected to this priority. Finally a certain plan of the resource redistribution is generated according to this principle. Several specific examples are studied numerically. It elucidates, in particular, the effects of system characteristics such as the city limit capacity in resource delivery, the type of initial resource allocation among the cities, the number of cities able to participate in the resource redistribution, and the damage level in the affected cities. As far as the uncertainty in evaluating the state of damaged region is concerned, some specific cases were studied. It assumes the initial communication system has crashed and formation of a new one and the resource redistribution proceed synchronously. The obtained results enable us to consider the resource redistribution plan governed by the proposed method semi-optimal and rather efficient especially under uncertainty.

physics.soc-ph↗

Rejection Mechanism in 2D Bounded Confidence Provides more Conformity

We add a rejection mechanism (negative influence) into a two-dimensions bounded confidence model. The principle is that one shifts aways from a close attitude of one's interlocutor, when there is a strong disagreement on the other attitude. The model shows metastable clusters, which maintain themselves through opposite influences of competitor clusters. Our analysis and first experiments support the hypothesis that the number of clusters grows linearly with the inverse of the uncertainty, whereas this growth is quadratic in the bounded confidence model.

physics.soc-ph↗

Openness leads to opinion stability and narrowness to volatility

We propose a new opinion dynamic model based on the experiments and results of Wood et al (1996). We consider pairs of individuals discussing on two attitudinal dimensions, and we suppose that one dimension is important, the other secondary. The dynamics are mainly ruled by the level of agreement on the main dimension. If two individuals are close on the main dimension, then they attract each other on the main and on the secondary dimensions, whatever their disagreement on the secondary dimension. If they are far from each other on the main dimension, then too much proximity on the secondary dimension is uncomfortable, and generates rejection on this dimension. The proximity is defined by comparing the opinion distance with a threshold called attraction threshold on the main dimension and rejection threshold on the secondary dimension. With such dynamics, a population with opinions initially uniformly drawn evolves to a set of clusters, inside which secondary opinions fluctuate more or less depending on threshold values. We observe that a low attraction threshold favours fluctuations on the secondary dimension, especially when the rejection threshold is high. The opinion evolutions of the model can be related to some stylised facts.

physics.soc-ph↗

Reply to "Comment on 'A Scaling law beyond Zipf's law and its relation to Heaps' law'"

In [arXiv:1404.1461], Yan and Minnhagen argue that the scaling law for the text-length dependence of word-frequency distributions proposed in [New J. Phys. 15 093033, arXiv:1303.0705] is "fundamentally incorrect" and "fundamentally impossible". In this note, we reason that such claims are clearly unjustified, with the scaling law being clearly valid for absolute frequencies greater than about 10. Further, we show that the very counter-example provided by Yan and Minnhagen [arXiv:1404.1461] fulfils our scaling hypothesis with excellent accuracy, at odds with Yan and Minnhagen's criticisms, and supporting our approach.

physics.soc-ph↗

Epidemic and Cascading Survivability of Complex Networks

Our society nowadays is governed by complex networks, examples being the power grids, telecommunication networks, biological networks, and social networks. It has become of paramount importance to understand and characterize the dynamic events (e.g. failures) that might happen in these complex networks. For this reason, in this paper, we propose two measures to evaluate the vulnerability of complex networks in two different dynamic multiple failure scenarios: epidemic-like and cascading failures. Firstly, we present \emph{epidemic survivability} ($ES$), a new network measure that describes the vulnerability of each node of a network under a specific epidemic intensity. Secondly, we propose \emph{cascading survivability} ($CS$), which characterizes how potentially injurious a node is according to a cascading failure scenario. Then, we show that by using the distribution of values obtained from $ES$ and $CS$ it is possible to describe the vulnerability of a given network. We consider a set of 17 different complex networks to illustrate the suitability of our proposals. Lastly, results reveal that distinct types of complex networks might react differently under the same multiple failure scenario.

physics.soc-ph↗

x-index: a fantastic new indicator for quantifying a scientist's scientific impact

h-index has become the most popular indicator for quantifying a scientist's scientific impact in various scientific fields. h-index is defined as the largest number of papers with citation number larger than or equal to h and it treats each citation equally. However, different citations usually come from different papers with different influence and quality, and a citation from a highly influential paper is a greater recognition of the target paper than a citation from an ordinary paper. Based on this assumption, we proposed a new indicator named x-index to quantify a scientist's scientific impact by considering only the citations coming from influential papers. x-index is defined as the largest number of papers with influential citation number larger than or equal to x, where each influential citation comes from a paper for which the average ACNPP (Average Citation Number Per Paper) of its authors larger than or equal to x . Through analysis on the APS dataset, we find that the proposed x-index has much better ability to discriminate between Physics Prize Winners and ordinary physicists.

cs.DL↗

How Community Feedback Shapes User Behavior

Social media systems rely on user feedback and rating mechanisms for personalization, ranking, and content filtering. However, when users evaluate content contributed by fellow users (e.g., by liking a post or voting on a comment), these evaluations create complex social feedback effects. This paper investigates how ratings on a piece of content affect its author's future behavior. By studying four large comment-based news communities, we find that negative feedback leads to significant behavioral changes that are detrimental to the community. Not only do authors of negatively-evaluated content contribute more, but also their future posts are of lower quality, and are perceived by the community as such. Moreover, these authors are more likely to subsequently evaluate their fellow users negatively, percolating these effects through the community. In contrast, positive feedback does not carry similar effects, and neither encourages rewarded authors to write more, nor improves the quality of their posts. Interestingly, the authors that receive no feedback are most likely to leave a community. Furthermore, a structural analysis of the voter network reveals that evaluations polarize the community the most when positive and negative votes are equally split.

cs.SI↗

The effect of wording on message propagation: Topic- and author-controlled natural experiments on Twitter

Consider a person trying to spread an important message on a social network. He/she can spend hours trying to craft the message. Does it actually matter? While there has been extensive prior work looking into predicting popularity of social-media content, the effect of wording per se has rarely been studied since it is often confounded with the popularity of the author and the topic. To control for these confounding factors, we take advantage of the surprising fact that there are many pairs of tweets containing the same url and written by the same user but employing different wording. Given such pairs, we ask: which version attracts more retweets? This turns out to be a more difficult task than predicting popular topics. Still, humans can answer this question better than chance (but far from perfectly), and the computational methods we develop can do better than both an average human and a strong competing method trained on non-controlled data.

cs.SI↗

Events and Controversies: Influences of a Shocking News Event on Information Seeking

It has been suggested that online search and retrieval contributes to the intellectual isolation of users within their preexisting ideologies, where people's prior views are strengthened and alternative viewpoints are infrequently encountered. This so-called "filter bubble" phenomenon has been called out as especially detrimental when it comes to dialog among people on controversial, emotionally charged topics, such as the labeling of genetically modified food, the right to bear arms, the death penalty, and online privacy. We seek to identify and study information-seeking behavior and access to alternative versus reinforcing viewpoints following shocking, emotional, and large-scale news events. We choose for a case study to analyze search and browsing on gun control/rights, a strongly polarizing topic for both citizens and leaders of the United States. We study the period of time preceding and following a mass shooting to understand how its occurrence, follow-on discussions, and debate may have been linked to changes in the patterns of searching and browsing. We employ information-theoretic measures to quantify the diversity of Web domains of interest to users and understand the browsing patterns of users. We use these measures to characterize the influence of news events on these web search and browsing patterns.

cs.IR↗