When foraging for information, users face a tradeoff between the accuracy and value of the acquired information and the time spent collecting it, a problem which also surfaces when seeking answers to a question posed to a large community. We empirically study how people behave when facing these conflicting objectives using data from Yahoo Answers, a community driven question-and-answer site. We first study how users behave when trying to maximize the amount of acquired information while minimizing the waiting time. We find that users are willing to wait longer for an additional answer if they have received a small number of answers. We then assume that users make a sequence of decisions, deciding to wait for an additional answer as long as the quality of the current answer exceeds some threshold. The resulting probability distribution for the number of answers that a question gets is an inverse Gaussian, a fact that is validated by our data. [more]

In this paper, we study two large da 74d ta sets containing the information of two different human behaviors: blog-posting and wiki-revising. In both cases, the interevent time distributions decay as power-laws at both individual and population level. As different from previous studies, we put emphasis on time scales and obtain heterogeneous decay exponents in intra- and inter-day range for the same dataset. Moreover, we observe opposite trend of exponents in relation to individual $Activity$. Further investigations show that the presence of intra-day activities mask the correlation between consecutive inter-day activities and lead to an underestimate of $Memory$, which explain the contradicting results in recent empirical studies. Removal of data in intra-day range reveals the high values of $Memory$ and lead us to convergent results between wiki-revising and blog-posting. [more]

This study provides insights into the quantitative similarities, differences and relationships between users' spatial, face-to-face, urban social networks and their transpatial, online counterparts. We explore and map the social ties within a cohort of 2602 users, and how those ties are mediated via physical co-presence and online tools. Our analysis focused on isolating two distinct segments of the social network: one mediated by physical co-presence, and the other mediated by Facebook. Our results suggest that as a whole the networks exhibit homogeneous characteristics, but individuals' involvement in those networks varies considerably. Furthermore this study provides a methodological approach for jointly analysing spatial & transpatial networks utilising pervasive and ubiquitous technology. [more]

Most news recommender systems try to identify users' interests and news' attributes and use them to obtain recommendations. Here we propose an adaptive model which combines similarities in users' rating patterns with epidemic-like spreading of news on an evolving network. We study the model by computer agent-based simulations, measure its performance and discuss its robustness against bias and malicious behavior. Subject to the approval fraction of news recommended, the proposed model outperforms the widely adopted recommendation of news according to their absolute or relative popularity. This model provides a general social mechanism for recommender systems and may find its applications also in other types of recommendation. [more]

The study of network synchronization has attracted increasing attention recently. In this paper, we strictly define a class of networks, namely effective network a6f s, which are synchronizable and orientable networks. We can prove that all the effective networks with the same size have the same spectra, and are of the best synchronizability according to the master stability analysis. However, it is found that the synchronization time for different effective networks can be quite different. Further analysis show that the key ingredient affecting the synchronization time is the maximal depth of an effective network: the larger depth results in a longer synchronization time. The secondary factor is the number of links. The more links connecting the nodes in the same layer (horizontal links) will lead to longer synchronization time, while the increasing number of links connecting nodes in neighboring layers (vertical links) will accelerate the synchronization. Our findings provide insights into the roles of horizontal and vertical links in synchronizing process, and suggest that the spectral analysis is helpful yet insufficient for the understanding of network synchronization. [more]

Understanding the structure and evolution of web-based user-object networks is a significant task since they play a crucial role in e-commerce nowadays. This Letter reports the empirical analysis on two large-scale web sites, audioscrobbler.com and del.icio.us, where users are connected with music groups and bookmarks, respectively. The degree distributions and degree-degree correlations for both users and objects are reported. We propose a new index, named collaborative clustering coefficient, to quantify the clustering behavior based on the collaborative selection. Accordingly, the clustering properties and clustering-degree correlations are investigated. We report some novel phenomena well characterizing the selection mechanism of web users and outline the relevance of these phenomena to the information recommendation problem. [more]

While degree correlations are known to play a crucial role for spreading phenomena in networks, their impact on the propagation speed has hardly been understood. Here we investigate a tunable spreading model on scale-free networks and show that the propagation becomes slow in positively (negati 6af vely) correlated networks if nodes with a high connectivity locally accelerate (decelerate) the propagation. Examining the efficient paths offers a coherent explanation for this result, while the $k$-core decomposition reveals the dependence of the nodal spreading efficiency on the correlation. Our findings should open new pathways to delicately control real-world spreading processes. [more]

Emergence of online content voting networks allows users to share and rate content including social news, photos and videos. The basic idea behind online content voting networks is that aggregate user activities (e.g., submitting and rating content) makes high-quality content thrive through the unprecedented scale, high dynamics and divergent quality of user generated content (UGC). To better understand the nature and impact of online content voting networks, we have analyzed Digg, a popular online social news aggregator and rating website. Based on a large amount of data collected, we provide an in-depth study of Digg. In particular, we study structural properties of Digg social network, impact of social network properties on user digging activities and vice versa, distribution of user diggs, content promotion, and information filtering. We also provide insight into design of content promotion algorithms and recommendation-assisted content discovery. Overall, we believe that the results presented in this paper are crucial in understanding online content rating networks. [more]

We study the effect of team and hierarchy on the waiting-time dynamics of priority-queue networks. To this end, we introduce generalized priority-queue network models incorporating interaction rules based on team-execution and hierarchy in decision making, respectively. It is numerically found that the waiting time distribution exhibits a power law for long waiting times in both cases, yet with different exponents depending on the team size and the position of queue nodes in the hierarchy, respectively. The observed power-law behaviors have in many cases a corresponding single or pairwise-interacting queue dynamics, suggesting that the pairwise interaction may constitute a major dynamics consequence in the priority-queue networks. It is also found that the reciprocity of influence is a relevant factor for the priority-queue network dynamics [more]

Taylor's fluctuation scaling (FS) has been observed in many natural and man-made systems revealing an amazing universality of the law. Here we give strong theoretical foundations for the origins and abundance of Taylor's FS in different complex systems. The universality of our approach is validated against real world data ranging from bird and insect populations through human chromosomes and traffic intensity in transportation networks to stock market dynamics. Using fundamental principles of statistical physics (both equilibrium and non-equilibrium) we prove that Taylor's law results from the well-defined density of states (DOS) function of a system that gives the number of states characterized by the same value of a macroscopic parameter (i.e., the number of birds observed in a given area, traffic intensity measured as a number of cars passing trough a given observation point or daily activity in the stock market measured in millions of dollars). </blockquote> <!--CONTEXT--> <div class="metatable"> <table summary="Additional metadata"> <tr> <td class="tablecell label">Comments: </td> <td class="tablecell comments">11 pages (twocolumn RevTex style), 6 figures; For better understanding of how real data have been processed see: this http URL</td> </tr> <tr> <td class="tablecell label">Subjects: </td> <td class="tablecell subjects"><span class="primary-subject">Physics and Society (physics.soc-ph)</span>; Biological Physics (physics.bio-ph)</td> </tr> <tr> <td class="tablecell label"> Journal reference: </td> <td class="tablecell jref">Phys. Rev. E 81 (6), 066112 (2010)</td> </tr> <tr> <td class="tablecell label"> Cite as: </td> <td class="tablecell arxivid">arXiv:0909.1896v2 [physics.soc-ph]</td> </tr> </table> </div> <div class="submission-history"> <h2>Submission history</h2> From: Agata Fronczak [view email] <br /> <b>[v1]</b> Thu, 10 Sep 2009 09:07:22 GMT (461kb)<br /> <b>[v2]</b> Thu, 5 Aug 2010 07:38:32 GMT (346kb)<br /> </div> <div class="endorsers">Which a [more]

Even though people in our contemporary, technological society are depending on communication, our understanding of the underlying laws of human communicational behavior continues to be poorly understood. Here we investigate the communication patterns in two social Internet communities in search of statistical laws in human interaction activity. This research reveals that human communication networks dynamically follow scaling laws that may also explain the observed trends in economic growth. Specifically, we identify a generalized version of Gibrat's law of social activity expressed as a scaling law between the fluctuations in the number of messages sent by members and their level of activity. Gibrat's law has been essential in understanding economic growth patterns, yet without an underlying general principle for its origin. We attribute this scaling law to long-term correlation patterns in human activity, which surprisingly span from days to the entire period of the available data of more than one year. Further, we provide a mathematical framework that relates the generalized version of Gibrat's law to the long-term correlated dynamics, which suggests that the same underlying mechanism could be the source of Gibrat's law in economics, ranging from large firms, research and development expenditures, gross domestic product of countries, to city population growth. These findings are also of importance for designing communication networks and for the understanding of the dynamics of social systems in which communication plays a role, such as economic markets and political systems. [more]

The conventional wisdom is that social networks exhibit an assortative mixing pattern, whereas biological and technological networks show a disassortative mixing pattern. However, the recent research on the online social networks modifies the widespread belief, and m 83c any online social networks show a disassortative or neutral mixing feature. Especially, we found that an online social network, Wealink, underwent a transition from degree assortativity characteristic of real social networks to degree disassortativity characteristic of many online social networks, and the transition can be reasonably elucidated by a simple network model that we propose. The relations among network assortativity, clustering, and modularity are also discussed in the paper. [more]

This paper analyzes the effect of interdisciplinarity on the scientific impact of individual papers. Using all the papers published in Web of Science in 2000, we define the deg 931 ree of interdisciplinarity of a given paper as the percentage of its cited references made to journals of other disciplines. We show that, although for all disciplines combined there is no clear correlation between the level of interdisciplinarity of papers and their citation rates, there are nonetheless some disciplines in which a higher level of interdisciplinarity is related to a higher citation rates. For other disciplines, citations decline as interdisciplinarity grows. One characteristic is visible in all disciplines: highly disciplinary and highly interdisciplinary papers have a low scientific impact. This suggests that there might be an optimum of interdisciplinarity beyond which the research is too dispersed to find its niche and under which it is too mainstream to have high impact. Finally, the relationship between interdisciplinarity and scientific impact is highly determined by the citation characteristics of the disciplines involved: papers citing citation intensive disciplines are more likely to be cited by those disciplines and, hence, obtain higher citation scores than papers citing non citation intensive disciplines. [more]

Uncovering the mechanism leading to the scaling law in human trajectories is of fundamental importance in understanding many spatiotemporal phenomena. We propose a hierarchical geographical model to mimic the real traffic system, upon which a random walker will generate a power-law travel displacement distribution with exponent -2. When considering the inhomogeneities of cities' locations and attractions, this model reproduces a power-law displacement distribution with an exponential cutoff, as well as a scaling behavior in the probability density of having traveled a certain distance at a certain time. Our results agree very well with the empirical observations reported in [D. Brockmann et al., Nature 439, 462 (2006)]. [more]

We present a method for accurately predicting the long time popularity of online content from early measurements of user access. Using two content sharing portals, Youtube and Digg, we show that by modeling the accrual of views and votes on content offered by these services we can predict the long-term dynamics of individual submissions from initial data. In the case of Digg, measuring access to given stories during the first two hours allows us to forecast their popularity 30 days ahead with remarkable accuracy, while downloads of Youtube videos need to be followed for 10 days to attain the same performance. The differing time scales of the predictions are shown to be due to differences in how content is consumed on the two portals: Digg stories quickly become outdated, while Youtube videos are still found long after they are initially submitted to the portal. We show that predictions are more accurate for submissions for which attention decays quickly, whereas predictions for evergreen content will be prone to larger errors. [more]

Previous works on the queuing model introduced by Barab\'asi to account for the heavy tailed distributions of the temporal patterns found in many human activities mainly concentrate on the extremal dynamics case and on lists of only two items. Here we obtain exact results for the general case with arbitrary values of the list length $L$ and of the degree of randomness that interp 596 olates between the deterministic and purely random limits. The statistically fundamental quantities are extracted from the solution of master equations. From this analysis, new scaling features of the model are uncovered. [more]

The Internet revolution has made long-distance communication dramatically faster, easier, and cheaper than ever before. This, it has been argued, has decreased the importance of geographic proximity in social interactions, transforming our world into a global village with a borderless society. We argue for the opposite: while technology has undoubtedly increased the overall level of communication, this increase has been most pronounced for local social ties. We show that the volume of electronic communications is inversely proportional to geographic distance, following a Power Law. We directly study the importance of physical proximity in social interactions by analyzing the spatial dissemination of new baby names. Counter-intuitively, and in line with the above argument, the importance of geographic proximity has dramatically increased with the internet revolution. [more]

We propose a resource distribution strategy to reduce the average travel time in a transportation network given a fixed generation rate. Suppose that there are essential resources to avoid congestion in the network as well as some extra resources. The strategy distributes the essential resources by the average loads on the vertices and integrates the fluctuations of the instantaneous loads into the distribution of the extra resources. The fluctuations are calculated with the assumption of unlimited resources, where the calculation is incorporated into the calculation of the average loads without adding to the time complexity. Simulation results show that the fluctuation-integrated strategy provides shorter average travel time than a previous distribution strategy while keeping similar robustness. The strategy is especially beneficial when the extra resources are scarce and the network is heterogeneous and lowly loaded. [more]

Recently, Yin et al. [Eur. Phys. J. B 49, 205 (2006)] introduced an efficient small-world network traffic model using preferential next-nearest neighbor routing strategy with the so-called path iteration avoidance (PIA) rule to study the jamming transition of internet. Here we study their model without PIA rule by a mean-field analysis which carefully divides the message packets into two types. Then, we argue that our mean-field analysis is also applicable in the presence of PIA rule in the limit of a large number of nodes in the network. Our analysis gives an explicit expression of the critical packet injection rate $R_c$ as a function of a bias parameter of the routing strategy $\alpha$ in their model with or without PIA rule. In particular, we predict a sudden change in $R_c$ at a certain value of $\alpha$. These predictions agree quite well with our extensive computer simulations. [more]

We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase and a congested phase, critical points and different scaling behaviors in the system size. It consists of random walkers on a queueing network with one-range repulsion, where particles can be destroyed only if they can move. We focus on the dependence on the topology as well as on the level of traffic control. We are able to obtain transition curves and phase diagrams at analytical level for the ensemble of uncorrelated networks and numerically for single instances. We find that traffic control improves global performance, enlarging the free-flow region in parameter space only in heterogeneous networks. Traffic control introduces non-linear effects and, beyond a critical strength, may trigger the appearance of a congested phase in a discontinuous manner. The model also reproduces the cross-over in the scaling of traffic fluctuations empirically observed in the Internet, and moreover, a conserved version can reproduce qualitatively some stylized facts of traffic in transportation networks. [more]

We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k) ~ k^(-gamma), we show that the load is l(k) ~ k^eta with eta = gamma - 1, implying that the probability distribution for the load is p(l) ~ 1/l^2 independent of gamma. The results are obtained through scaling argu 674 ments supported by finite size scaling studies. They contradict earlier claims, but are in agreement with the exact solution for the special case of tree graphs. Results are also presented for real communications networks at the IP layer, using the latest available data. Our analysis of the data shows relatively poor power-law degree distributions as compared to the scaling of the load versus degree. This emphasizes the importance of the load in network analysis. [more]

Personalized recommender systems are confronting great challenges of accuracy, diversification and novelty, especially when the data set is sparse and lacks accessorial information, such as user profiles, item attributes and explicit ratings. Collaborative tags contain rich information about personalized preferences and item contents, and are therefore potential to help in providing better recommendations. In this paper, we propose a recommendation algorithm based on an integrated diffusion on user-item-tag tripartite graphs. We use three benchmark data sets, Del.icio.us, MovieLens and BibSonomy, to evaluate our algorithm. Experimental results demonstrate that the usage of tag information can significantly improve accuracy, diversification and novelty of recommendations. [more]

In natural flocks/swarms, it is very appealing that low-level individual intelligence and communication can yield advanced coordinated collective behaviors such as congregation, synchronization and migration. In the past few years, the discovery of collective flocking behaviors has stimulated much interest in the study of the underlying organizing principles of abundant natural groups, which has led to dramatic advances in this emerging and active research field. Inspired by previous investigations on the predictive intelligence of animals, insects and microorganisms, we seek in this article to understand the role of predictive mechanisms in the forming and evolving of flocks/swarms by using both numerical simulations and mathematical analyses. This article reviews some basic concepts, important progress, and significant results in the current studies of collective predictive mechanisms, with emphasis on their virtues concerning consensus improvement and communication cost reduction. Due to these advantages, such predictive mechanisms have great potential to find their way into industrial applications. [more]

There are many on-line settings in which users publicly express opinions. A number of these offer mechanisms for other users to evaluate these opinions; a canonical example is Amazon.com, where reviews come with annotations like "26 of 32 people found the following review helpful." Opinion evaluation appears in many off-line settings as well, including market research and political campaigns. Reasoning about the evaluation of an opinion is fundamentally different from reasoning about the opinion itself: rather than asking, "What did Y think of X?", we are asking, "What did Z think of Y's opinion of X?" Here we develop a framework for analyzing and modeling opinion evaluation, using a large-scale collection of Amazon book reviews as a dataset. We find that the perceived helpfulness of a review depends not just on its content but also but also in subtle ways on how the expressed evaluation relates to other evaluations of the same product. As part of our approach, we develop novel methods that take advantage of the phenomenon of review "plagiarism" to control for the effects of text in opinion evaluation, and we provide a simple and natural mathematical model consistent with our findings. Our analysis also allows us to distinguish among the predictions of competing theories from sociology and social psychology, and to discover unexpected differences in the collective opinion-evaluation behavior of user populations from different countries. [more]

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks. [more]

The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for characterizing individual behavior and, by extension, identifying latent structure in human populations. Here, we propose a model of individual e-mail communication that is sufficiently rich to capture meaningful variability across individuals, while remaining simple enough to be interpretable. We show that the model, a cascading non-homogeneous Poisson process, can be formulated as a double-chain hidden Markov model, allowing us to use an efficient inference algorithm to estimate the model parameters from observed data. We then apply this model to two e-mail data sets consisting of 404 and 6,164 users, respectively, that were collected from two universities in different countries and years. We find that the resulting best-estimate parameter distributions for both data sets are surprisingly similar, indicating that at least some features of communication dynamics generalize beyond specific contexts. We also find that variability of individual behavior over time is significantly less than variability across the population, suggesting that individuals can be classified into persistent "types". We conclude that communication patterns may prove useful as an additional class of attribute data, complementing demographic and network data, for user classification and outlier detection--a point that we illustrate with an interpretable clustering of users based on their inferred model parameters. [more]

Missing link prediction of networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically 9fd investigate a simple framework of link prediction on the basis of node similarity. We compare nine well-known local similarity measures on six real networks. The results indicate that the simplest measure, namely common neighbors, has the best overall performance, and the Adamic-Adar index performs the second best. A new similarity measure, motivated by the resource allocation process taking place on networks, is proposed and shown to have higher prediction accuracy than common neighbors. It is found that many links are assigned same scores if only the information of the nearest neighbors is used. We therefore design another new measure exploited information of the next nearest neighbors, which can remarkably enhance the prediction accuracy. [more]

Quantitative understanding of human behaviors provides elementary comprehension of the complexity of many human-initiated systems. A basic assumption embedded in the previous analyses on human dynamics is that its temporal statistics are uniform and stationary, which can be properly described by a Poisson process. Accordingly, the interevent time distribution should have an expone 7c6 ntial tail. However, recently, this assumption is challenged by the extensive evidence, ranging from communication to entertainment and work patterns, that the human dynamics obeys non-Poisson statistics with heavy-tailed interevent time distribution. This review article summarizes the recent empirical explorations on human activity pattern, as well as the corresponding theoretical models for both task-driven and interest-driven systems. Finally, we outline some future open questions in the studies of the statistical mechanics of human dynamics. [more]

The hum b22 an society is a very complex system; still, there are several non-trivial, general features. One type of them is the presence of power-law distributed quantities in temporal statistics. In this Letter, we focus on the origin of power-laws in rating of movies. We present a systematic empirical exploration of the time between two consecutive ratings of movies (the interevent time). At an aggregate level, we find a monotonous relation between the activity of individuals and the power-law exponent of the interevent-time distribution. At an individual level, we observe a heavy-tailed distribution for each user, as well as a negative correlation between the activity and the width of the distribution. We support these findings by a similar data set from mobile phone text-message communication. Our results demonstrate a significant role of the activity of individuals on the society-level patterns of human behavior. We believe this is a common character in the interest-driven human dynamics, corresponding to (but different from) the universality classes of task-driven dynamics. [more]

Recently, increasing empirical evidence indicates the extensive existence of heavy tails in the interevent time distributions of various human behaviors. Based on the queuing theory, the Barab\'asi model and its variations suggest the highest-priority-first protocol a poten 865 tial origin of those heavy tails. However, some human activity patterns, also displaying the heavy-tailed temporal statistics, could not be explained by a task-based mechanism. In this paper, different from the mainstream, we propose an interest-based model. Both the simulation and analysis indicate a power-law interevent time distribution with exponent -1, which is in accordance with some empirical observations in human-initiated systems. [more]

Statistical physics has proven to be a very 984 fruitful framework to describe phenomena outside the realm of traditional physics. The last years have witnessed the attempt by physicists to study collective phenomena emerging from the interactions of individuals as elementary units in social structures. Here we review the state of the art by focusing on a wide list of topics ranging from opinion, cultural and language dynamics to crowd behavior, hierarchy formation, human dynamics, social spreading. We highlight the connections between these problems and other, more traditional, topics of statistical physics. We also emphasize the comparison of model results with empirical data from social systems. [more]

In this letter, we propose a new routing strategy with a single free parameter $\alpha$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of $\alpha$ is sought out. By investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal $\alpha$. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which do not depend on $\alpha$. This phenomenon suggests that the capacity of the network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion. [more]

In this letter, we will propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing method of shortest path, we give a generalized routing algorithm of \emph{efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved about 10 times by optimizing the efficient path, without increase in computing complexity. Our method may shed some light in future routing protocol and design. [more]