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 1,063 records · Page 59Linked to original sources
arXiv2014

Rawls' Fairness, Income Distribution and Alarming Level of Gini Coefficient

The argument that the alarming level of Gini coefficient is 0.4 is very popular, especially in the media industry, all around the world for a long time. Although the 0.4 standard is widely accepted, the derivation of the value lacks rigid theoretical foundations. In fact, to the best of our knowledge, it is not based on any prevalent and convincing economic theories. In this paper, we incorporate Rawls' principle of fair equality of opportunity into Arrow-Debreu's framework of general equilibrium theory with heterogeneous agents, and derive the alarming level of Gini coefficient formally. Our theory reveals that the exponential distribution of income not only satisfies Pareto optimality, but also obeys social fairness in Rawls' sense. Therefore, we specify the maximal value of the Gini coefficient when income follows exponential distribution as a possible alarming level. Our computations show that the alarming level should be specified at least equal or larger than 0.5 rather than 0.4. We empirically investigate if our model receives support from a large data set of all kinds of countries all over the world from Word Bank in 1990, 1995, 2000 and 2005 using the distribution fitting and statistical decision methodology. The results suggest that the value of 0.4 is around the mean of the Gini coefficients, corresponding to the most probable event in a peaceful world, rather than the alarming level, while the two-sigma rule shows that in our sample the alarming levels are all larger than 0.5, conforming to the predictions of our theory.

q-fin.GN↗
arXiv2014

From Attention to Citation, What and How Does Altmetrics Work?

Scholarly and social impacts of scientific publications could be measured by various metrics. In this study, the relationship between various metrics of 63,805 PLOS research articles are studied. Generally, article views correlate well with citation, however, different types of article view have different levels of correlation with citation, when pdf download correlates the citation most significantly. It's necessary for publishers and journals to provide detailed and comprehensive article metrics. Although the low correlation between social attention and citation is confirmed by this study and previous studies, more than ever, we find that social attention is highly correlated with article view, especially the browser html view. Social attention is the important source that bringing network traffic to browser html view and may lead to citation subsequently. High altmetric score has the potential role in promoting the long-term academic impact of articles, when a conceptual model is proposed to interpret the conversion from social attention to article view, and to citation finally.

cs.DL↗
arXiv2014

Memory effect of the online user preference

The mechanism of the online user preference evolution is of great significance for understanding the online user behaviors and improving the quality of online services. Since users are allowed to rate on objects in many online systems, ratings can well reflect the users' preference. With two benchmark datasets from online systems, we uncover the memory effect in users' selecting behavior which is the sequence of qualities of selected objects and the rating behavior which is the sequence of ratings delivered by each user. Furthermore, the memory duration is presented to describe the length of a memory, which exhibits the power-law distribution, i.e., the probability of the occurring of long-duration memory is much higher than that of the random case which follows the exponential distribution. We present a preference model in which a Markovian process is utilized to describe the users' selecting behavior, and the rating behavior depends on the selecting behavior. With only one parameter for each of the user's selecting and rating behavior, the preference model could regenerate any duration distribution ranging from the power-law form (strong memory) to the exponential form (weak memory).

physics.soc-ph↗
arXiv2014

Analysis and Visualization of Dynamic Networks

This chapter provides an overview of the different techniques and methods that exist for the analysis and visualization of dynamic networks. Basic definitions and formal notations are discussed and important references are cited. A major reason for the popularity of the field of dynamic networks is its applicability in a number of diverse fields. The field of dynamic networks is in its infancy and there are so many avenues that need to be explored. From developing network generation models to developing temporal metrics and measures, from structural analysis to visual analysis, there is room for further exploration in almost every dimension where dynamic networks are studied. Recently, with the availability of dynamic data from various fields, the empirical study and experimentation with real data sets has also helped maturate the field. Furthermore, researchers have started to develop foundations and theories based on these datasets which in turn has resulted lots of activity among research communities.

cs.SI↗
arXiv2014

Communities and Hierarchical Structures in Dynamic Social Networks: Analysis and Visualization

Detection of community structures in social networks has attracted lots of attention in the domain of sociology and behavioral sciences. Social networks also exhibit dynamic nature as these networks change continuously with the passage of time. Social networks might also present a hierarchical structure led by individuals that play important roles in a society such as Managers and Decision Makers. Detection and Visualization of these networks changing over time is a challenging problem where communities change as a function of events taking place in the society and the role people play in it. In this paper we address these issues by presenting a system to analyze dynamic social networks. The proposed system is based on dynamic graph discretization and graph clustering. The system allows detection of major structural changes taking place in social communities over time and reveals hierarchies by identifying influential people in a social networks. We use two different data sets for the empirical evaluation and observe that our system helps to discover interesting facts about the social and hierarchical structures present in these social networks.

cs.SI↗
arXiv2014

Degree-layer theory of network topology

The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network. Therefore, the degree is very important structural parameter of network topology. However, given the number of nodes and the degree of each node in a network, the topology of the network cannot be determined. Therefore, we propose the degree-layer theory of network topology to describe deeply the network topology. First, we propose the concept of degree-tree with the breadth-first search tree. The degrees of all nodes are layered and have a hierarchical structure. Second,the degree-layer theory is described in detail. Two new concepts are defined in the theory. An index is proposed to quantitatively distinguish the two network topologies. It also can quantitatively measure the stability of network topology built by a model mechanism. One theorem is given and proved, furthermore, and one corollary is derived directly from the theorem. Third, the applications of the degree-layer theory are discussed in the ER random network, WS small world network and BA scale-free network, and the influences of the degree distribution on the stability of network topology are studied in the three networks. In conclusion, the degree-layer theory is helpful for accurately describing the network topology, and provides a new starting point for researching the similarity and isomorphism between two network topologies.

physics.soc-ph↗
arXiv2014

Identification of Influential Scientists vs. Mass Producers by the Perfectionism Index

The concept of h-index has been proposed to easily assess a researcher's performance with a single number. However, by using only this number, we lose significant information about the distribution of citations per article in an author's publication list. In this article, we study an author's citation curve and we define two new areas related to this curve. We call these "penalty areas", since the greater they are, the more an author's performance is penalized. We exploit these areas to establish new indices, namely PI and XPI, aiming at categorizing researchers in two distinct categories: "influentials" and "mass producers"; the former category produces articles which are (almost all) with high impact, and the latter category produces a lot of articles with moderate or no impact at all. Using data from Microsoft Academic Service, we evaluate the merits mainly of PI as a useful tool for scientometric studies. We establish its effectiveness into separating the scientists into influentials and mass producers; we demonstrate its robustness against self-citations, and its uncorrelation to traditional indices. Finally, we apply PI to rank prominent scientists in the areas of databases, networks and multimedia, exhibiting the strength of the index in fulfilling its design goal.

cs.DL↗
arXiv2014

Approximating Betweenness Centrality in Large Evolving Networks

Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For static networks, approximation based on randomly sampled paths has been shown to be significantly faster in practice. However, for dynamic networks, no approximation algorithm for betweenness centrality is known that improves on static recomputation. We address this deficit by proposing two incremental approximation algorithms (for weighted and unweighted connected graphs) which provide a provable guarantee on the absolute approximation error. Processing batches of edge insertions, our algorithms yield significant speedups up to a factor of $10^4$ compared to restarting the approximation. This is enabled by investing memory to store and efficiently update shortest paths. As a building block, we also propose an asymptotically faster algorithm for updating the SSSP problem in unweighted graphs. Our experimental study shows that our algorithms are the first to make in-memory computation of a betweenness ranking practical for million-edge semi-dynamic networks. Moreover, our results show that the accuracy is even better than the theoretical guarantees in terms of absolutes errors and the rank of nodes is well preserved, in particular for those with high betweenness.

cs.SI↗
arXiv2014

Partisan Sharing: Facebook Evidence and Societal Consequences

The hypothesis of selective exposure assumes that people seek out information that supports their views and eschew information that conflicts with their beliefs, and that has negative consequences on our society. Few researchers have recently found counter evidence of selective exposure in social media: users are exposed to politically diverse articles. No work has looked at what happens after exposure, particularly how individuals react to such exposure, though. Users might well be exposed to diverse articles but share only the partisan ones. To test this, we study partisan sharing on Facebook: the tendency for users to predominantly share like-minded news articles and avoid conflicting ones. We verified four main hypotheses. That is, whether partisan sharing: 1) exists at all; 2) changes across individuals (e.g., depending on their interest in politics); 3) changes over time (e.g., around elections); and 4) changes depending on perceived importance of topics. We indeed find strong evidence for partisan sharing. To test whether it has any consequence in the real world, we built a web application for BBC viewers of a popular political program, resulting in a controlled experiment involving more than 70 individuals. Based on what they share and on survey data, we find that partisan sharing has negative consequences: distorted perception of reality. However, we do also find positive aspects of partisan sharing: it is associated with people who are more knowledgeable about politics and engage more with it as they are more likely to vote in the general elections.

cs.SI↗
arXiv2014

Overlapping Communities in Complex Networks

Communities are subsets of a network that are densely connected inside and share only few connections to the rest of the network. The aim of this research is the development and evaluation of an efficient algorithm for detection of overlapping, fuzzy communities. The algorithm gets as input some members of each community that we aim to discover. We call these members seed nodes. The algorithm then propagates this information by using random walks that start at non-seed nodes and end as they reach a seed node. The probability that a random walk starting at a non-seed node $v$ ends at a seed node $s$ is then equated with the probability that $v$ belongs to the communities of $s$. The algorithm runs in time $\tilde{O}(l \cdot m \cdot \log n)$, where $l$ is the number of communities to detect, $m$ is the number of edges, $n$ is the number of nodes. The $\tilde{O}$-notation hides a factor of at most $(\log \log n)^2$. The LFR benchmark proposed by Lancichinetti et al.\ is used to evaluate the performance of the algorithm. We found that, given a good set of seed nodes, it is able to reconstruct the communities of a network in a meaningful manner.

cs.SI↗
arXiv2014

Missing data in multiplex networks: a preliminary study

A basic problem in the analysis of social networks is missing data. When a network model does not accurately capture all the actors or relationships in the social system under study, measures computed on the network and ultimately the final outcomes of the analysis can be severely distorted. For this reason, researchers in social network analysis have characterised the impact of different types of missing data on existing network measures. Recently a lot of attention has been devoted to the study of multiple-network systems, e.g., multiplex networks. In these systems missing data has an even more significant impact on the outcomes of the analyses. However, to the best of our knowledge, no study has focused on this problem yet. This work is a first step in the direction of understanding the impact of missing data in multiple networks. We first discuss the main reasons for missingness in these systems, then we explore the relation between various types of missing information and their effect on network properties. We provide initial experimental evidence based on both real and synthetic data.

cs.SI↗
arXiv2014

Community Detection via Local Dynamic Interaction

How can we uncover the natural communities in a real network that allows insight into its underlying structure and also potential functions? In this paper, we introduce a new community detection algorithm, called Attractor, which automatically spots the communities or groups in a network over time via local dynamic interaction. The basic idea is to envision a network as a dynamical system, and each agent interacts with its local partners. Instead of investigating the node dynamics, we actually examine the change of "distances" among linked nodes. As time evolves, these distances will be shrunk or stretched gradually based on their topological structures. Finally all distances among linked nodes will converge into a stable pattern, and communities can be intuitively identified. Thanks to the dynamic viewpoint of community detection, Attractor has several potential attractive properties: (a) Attractor provides an intuitive solution to analyze the community structure of a network, and faithfully captures the natural communities (with high quality). (b) Owing to its time complexity $O(|E|)$, Attractor allows finding communities on large networks. (c) The small communities or anomalies, usually existing in real-world networks, can be well pinpointed. (d) Attractor is easy to parameterize, since there is no need to specify the number of clusters. Extensive experiments on synthetic and real-world networks further demonstrate the effectiveness and efficiency of the proposed approach.

cs.SI↗
arXiv2014

Reconstructing propagation networks with temporal similarity metrics

Node similarity is a significant property driving the growth of real networks. In this paper, based on the observed spreading results we apply the node similarity metrics to reconstruct propagation networks. We find that the reconstruction accuracy of the similarity metrics is strongly influenced by the infection rate of the spreading process. Moreover, there is a range of infection rate in which the reconstruction accuracy of some similarity metrics drops to nearly zero. In order to improve the similarity-based reconstruction method, we finally propose a temporal similarity metric to take into account the time information of the spreading. The reconstruction results are remarkably improved with the new method.

physics.soc-ph↗
arXiv2014

Predicting missing links via correlation between nodes

As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has been intensively investigated recently and many methods have been proposed so far. The essential challenge of link prediction is to estimate the similarity between nodes. Most of the existing methods are based on the common neighbor index and its variants. In this paper, we propose to calculate the similarity between nodes by the correlation coefficient. This method is found to be very effective when applied to calculate similarity based on high order paths. We finally fuse the correlation-based method with the resource allocation method, and find that the combined method can substantially outperform the existing methods, especially in sparse networks.

physics.soc-ph↗
arXiv2014

Tax Compliance and Public Goods Provision -- An Agent-based Econophysics Approach

We calculate the dynamics of tax evasion within a multi-agent econophysics model which is adopted from the theory of magnetism and previously has been shown to capture the main characteristics from agent-based based models which build on the standard Allingham and Sandmo approach. In particular, we implement a feedback of public goods provision on the decision-making of selfish agents which aim to pursue their self interest. Our results imply that such a feedback enhances the moral attitude of selfish agents thus reducing the percentage of tax evasion. Two parameters govern the behavior of selfish agents, (i) the rate of adaption to changes in public goods provision and (ii) the threshold of perception of public goods provision. Furtheron we analyze the tax evasion dynamics for different agent co mpositions and under the feedback of public goods provision. We conclude that policymakers may enhance tax compliance behavior via the threshold of perception by means of targeted public relations.

q-fin.GN↗
arXiv2014

U.S. Religious Landscape on Twitter

Religiosity is a powerful force shaping human societies, affecting domains as diverse as economic growth or the ability to cope with illness. As more religious leaders and organizations as well as believers start using social networking sites (e.g., Twitter, Facebook), online activities become important extensions to traditional religious rituals and practices. However, there has been lack of research on religiosity in online social networks. This paper takes a step toward the understanding of several important aspects of religiosity on Twitter, based on the analysis of more than 250k U.S. users who self-declared their religions/belief, including Atheism, Buddhism, Christianity, Hinduism, Islam, and Judaism. Specifically, (i) we examine the correlation of geographic distribution of religious people between Twitter and offline surveys. (ii) We analyze users' tweets and networks to identify discriminative features of each religious group, and explore supervised methods to identify believers of different religions. (iii) We study the linkage preference of different religious groups, and observe a strong preference of Twitter users connecting to others sharing the same religion.

cs.SI↗
arXiv2014

Systemic Interbank Network Risks in Russia

Modelling of contagion in interbank networks is discussed. A model taking into account bow-tie structure and dissasortativity of interbank networks is developed. The model is shown to provide a good quantitative description of the Russian interbank market. Detailed arguments favoring the non-percolative nature of contagion-related risks in the Russian interbank market are given.

physics.soc-ph↗