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 559 records · Page 31Linked to original sources

arXiv2013

Is the Sample Good Enough? Comparing Data from Twitter's Streaming API with Twitter's Firehose

Twitter is a social media giant famous for the exchange of short, 140-character messages called "tweets". In the scientific community, the microblogging site is known for openness in sharing its data. It provides a glance into its millions of users and billions of tweets through a "Streaming API" which provides a sample of all tweets matching some parameters preset by the API user. The API service has been used by many researchers, companies, and governmental institutions that want to extract knowledge in accordance with a diverse array of questions pertaining to social media. The essential drawback of the Twitter API is the lack of documentation concerning what and how much data users get. This leads researchers to question whether the sampled data is a valid representation of the overall activity on Twitter. In this work we embark on answering this question by comparing data collected using Twitter's sampled API service with data collected using the full, albeit costly, Firehose stream that includes every single published tweet. We compare both datasets using common statistical metrics as well as metrics that allow us to compare topics, networks, and locations of tweets. The results of our work will help researchers and practitioners understand the implications of using the Streaming API.

cs.SI↗

arXiv2013

Patterns in the occupational mobility network of the higher education graduates. Comparative study in 12 EU countries

The article investigates the properties of the occupational mobility network (OMN) in 12 EU countries. Using REFLEX database we construct for each country an empirical OMN that reflects the job movements of the university graduates, during the first five years after graduation (1999 - 2005). The nodes are represented by the occupations coded at 3 digits according to ISCO-88 and the links are weighted with the number of graduates switching from one occupation to another. We construct the networks as weighted and directed. This comparative study allows us to see what are the common patterns in the OMN over different EU labor markets.

physics.soc-ph↗

arXiv2013

Robustness and Directed Structures in Ecological Flow Networks

Robustness of ecological flow networks under random failure of arcs is considered with respect to two different functionalities: coherence and circulation. In our previous work, we showed that each functionality is associated with a natural path notion: lateral path for the former and directed path for the latter. Robustness of a network is measured in terms of the size of the giant laterally connected arc component and that of the giant strongly connected arc component, respectively. We study how realistic structures of ecological flow networks affect the robustness with respect to each functionality. To quantify the impact of realistic network structures, two null models are considered for a given real ecological flow network: one is random networks with the same degree distribution and the other is those with the same average degree. Robustness of the null models is calculated by theoretically solving the size of giant components for the configuration model. We show that realistic network structures have positive effect on robustness for coherence, whereas they have negative effect on robustness for circulation.

q-bio.PE↗

arXiv2013

Emergent Behavior in Multipartite Large Networks: Multi-virus Epidemics

Epidemics in large complete networks is well established. In contrast, we consider epidemics in non-complete networks. We establish the fluid limit macroscopic dynamics of a multi-virus spread over a multipartite network as the number of nodes at each partite or island grows large. The virus spread follows a peer-to-peer random rule of infection in line with the Harris contact process. The model conforms to an SIS (susceptible-infected-susceptible) type, where a node is either infected or it is healthy and prone to be infected. The local (at node level) random infection model induces the emergence of structured dynamics at the macroscale. Namely, we prove that, as the multipartite network grows large, the normalized Markov jump vector process $\left(\bar{\mathbf{Y}}^\mathbf{N}(t)\right) = \left(\bar{Y}_1^\mathbf{N}(t),\ldots, \bar{Y}_M^\mathbf{N}(t)\right)$ collecting the fraction of infected nodes at each island $i=1,\ldots,M$, converges weakly (with respect to the Skorokhod topology on the space of \emph{càdlàg} sample paths) to the solution of an $M$-dimensional vector nonlinear coupled ordinary differential equation. In the case of multi-virus diffusion with $K\in\mathbb{N}$ distinct strains of virus, the Markov jurmp matrix process $\left(\bar{\mathbf{Y}}^\mathbf{N}(t)\right)$, stacking the fraction of nodes infected with virus type $j$, $j=1,\ldots,K$, at each island $i=1,\ldots,M$, converges weakly as well to the solution of a $\left(K\times M\right)$-dimensional vector differential equation that is also characterized.

cs.SI↗

arXiv2013

Epidemics in Multipartite Networks: Emergent Dynamics

Single virus epidemics over complete networks are widely explored in the literature as the fraction of infected nodes is, under appropriate microscopic modeling of the virus infection, a Markov process. With non-complete networks, this macroscopic variable is no longer Markov. In this paper, we study virus diffusion, in particular, multi-virus epidemics, over non-complete stochastic networks. We focus on multipartite networks. In companying work http://arxiv.org/abs/1306.6198, we show that the peer-to-peer local random rules of virus infection lead, in the limit of large multipartite networks, to the emergence of structured dynamics at the macroscale. The exact fluid limit evolution of the fraction of nodes infected by each virus strain across islands obeys a set of nonlinear coupled differential equations, see http://arxiv.org/abs/1306.6198. In this paper, we develop methods to analyze the qualitative behavior of these limiting dynamics, establishing conditions on the virus micro characteristics and network structure under which a virus persists or a natural selection phenomenon is observed.

cs.SI↗

arXiv2013

Social Network Intelligence Analysis to Combat Street Gang Violence

In this paper we introduce the Organization, Relationship, and Contact Analyzer (ORCA) that is designed to aide intelligence analysis for law enforcement operations against violent street gangs. ORCA is designed to address several police analytical needs concerning street gangs using new techniques in social network analysis. Specifically, it can determine "degree of membership" for individuals who do not admit to membership in a street gang, quickly identify sets of influential individuals (under the tipping model), and identify criminal ecosystems by decomposing gangs into sub-groups. We describe this software and the design decisions considered in building an intelligence analysis tool created specifically for countering violent street gangs as well as provide results based on conducting analysis on real-world police data provided by a major American metropolitan police department who is partnering with us and currently deploying this system for real-world use.

cs.SI↗

arXiv2013

Power indices of influence games and new centrality measures for social networks

In social network analysis, there is a common perception that influence is relevant to determine the global behavior of the society and thus it can be used to enforce cooperation by targeting an adequate initial set of individuals or to analyze global choice processes. Here we propose centrality measures that can be used to analyze the relevance of the actors in process related to spread of influence. In [39] it was considered a multiagent system in which the agents are eager to perform a collective task depending on the perception of the willingness to perform the task of other individuals. The setting is modeled using a notion of simple games called influence games. Those games are defined on graphs were the nodes are labeled by their influence threshold and the spread of influence between its nodes is used to determine whether a coalition is winning or not. Influence games provide tools to measure the importance of the actors of a social network by means of classic power indices and provide a framework to consider new centrality criteria. In this paper we consider two of the most classical power indices, i.e., Banzhaf and Shapley-Shubik indices, as centrality measures for social networks in influence games. Although there is some work related to specific scenarios of game-theoretic networks, here we use such indices as centrality measures in any social network where the spread of influence phenomenon can be applied. Further, we define new centrality measures such as satisfaction and effort that, as far as we know, have not been considered so far. We also perform a comparison of the proposed measures with other three classic centrality measures, degree, closeness and betweenness, considering three social networks. We show that in some cases our measurements provide centrality hierarchies similar to those of other measures, while in other cases provide different hierarchies.

cs.GT↗

arXiv2013

On the Hyperbolicity of Large-Scale Networks

Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric characteristic of real-life networks, namely their hyperbolicity. In smooth geometry, hyperbolicity captures the notion of negative curvature; within the more abstract context of metric spaces, it can be generalized as d-hyperbolicity. This generalized definition can be applied to graphs, which we explore in this report. We provide strong evidence that communication and social networks exhibit this fundamental property, and through extensive computations we quantify the degree of hyperbolicity of each network in comparison to its diameter. By contrast, and as evidence of the validity of the methodology, applying the same methods to the road networks shows that they are not hyperbolic, which is as expected. Finally, we present practical computational means for detection of hyperbolicity and show how the test itself may be scaled to much larger graphs than those we examined via renormalization group methodology. Using well-understood mechanisms, we provide evidence through synthetically generated graphs that hyperbolicity is preserved and indeed amplified by renormalization. This allows us to detect hyperbolicity in large networks efficiently, through much smaller renormalized versions. These observations indicate that d-hyperbolicity is a common feature of large-scale networks. We propose that d-hyperbolicity in conjunction with other local characteristics of networks, such as the degree distribution and clustering coefficients, provide a more complete unifying picture of networks, and helps classify in a parsimonious way what is otherwise a bewildering and complex array of features and characteristics specific to each natural and man-made network.

physics.soc-ph↗

arXiv2013

A Random Matrix Approach to Differential Privacy and Structure Preserved Social Network Graph Publishing

Online social networks are being increasingly used for analyzing various societal phenomena such as epidemiology, information dissemination, marketing and sentiment flow. Popular analysis techniques such as clustering and influential node analysis, require the computation of eigenvectors of the real graph's adjacency matrix. Recent de-anonymization attacks on Netflix and AOL datasets show that an open access to such graphs pose privacy threats. Among the various privacy preserving models, Differential privacy provides the strongest privacy guarantees. In this paper we propose a privacy preserving mechanism for publishing social network graph data, which satisfies differential privacy guarantees by utilizing a combination of theory of random matrix and that of differential privacy. The key idea is to project each row of an adjacency matrix to a low dimensional space using the random projection approach and then perturb the projected matrix with random noise. We show that as compared to existing approaches for differential private approximation of eigenvectors, our approach is computationally efficient, preserves the utility and satisfies differential privacy. We evaluate our approach on social network graphs of Facebook, Live Journal and Pokec. The results show that even for high values of noise variance sigma=1 the clustering quality given by normalized mutual information gain is as low as 0.74. For influential node discovery, the propose approach is able to correctly recover 80 of the most influential nodes. We also compare our results with an approach presented in [43], which directly perturbs the eigenvector of the original data by a Laplacian noise. The results show that this approach requires a large random perturbation in order to preserve the differential privacy, which leads to a poor estimation of eigenvectors for large social networks.

cs.CR↗

arXiv2013

A survey on Human Mobility and its applications

Human Mobility has attracted attentions from different fields of studies such as epidemic modeling, traffic engineering, traffic prediction and urban planning. In this survey we review major characteristics of human mobility studies including from trajectory-based studies to studies using graph and network theory. In trajectory-based studies statistical measures such as jump length distribution and radius of gyration are analyzed in order to investigate how people move in their daily life, and if it is possible to model this individual movements and make prediction based on them. Using graph in mobility studies, helps to investigate the dynamic behavior of the system, such as diffusion and flow in the network and makes it easier to estimate how much one part of the network influences another by using metrics like centrality measures. We aim to study population flow in transportation networks using mobility data to derive models and patterns, and to develop new applications in predicting phenomena such as congestion. Human Mobility studies with the new generation of mobility data provided by cellular phone networks, arise new challenges such as data storing, data representation, data analysis and computation complexity. A comparative review of different data types used in current tools and applications of Human Mobility studies leads us to new approaches for dealing with mentioned challenges.

cs.SI↗

arXiv2013

Entropy of a Zipfian Distributed Lexicon

This article presents the calculation of the entropy of a system with Zipfian distribution and shows that a communication system tends to present an exponent value close to one, but still greater than one, so that it might maximize entropy and hold a feasible lexicon with an increasing size. This result is in agreement with what is observed in natural languages and with the balance between the speaker and listener communication efforts. On the other hand, the entropy of the communicating source is very sensitive to the exponent value as well as the length of the observable data, making it a poor parameter to characterize the communication process.

stat.AP↗

arXiv2013

Multiple Vectors Propagation of Epidemics in Complex Networks

This letter investigates the epidemic spreading in two-vectors propagation network (TPN). We propose detailed theoretical analysis that allows us to accurately calculate the epidemic threshold and outbreak size. It is found that the epidemics can spread across the TPN even if two sub-single-vector propagation networks (SPNs) of TPN are well below their respective epidemic thresholds. Strong positive degree-degree correlation of nodes in TPN could lead to a much lower epidemic threshold and a relatively smaller outbreak size. However, the average similarity between the neighbors from different SPNs of nodes has no effect on the epidemic threshold and outbreak size.

physics.soc-ph↗

arXiv2013

Mitigating Epidemics through Mobile Micro-measures

Epidemics of infectious diseases are among the largest threats to the quality of life and the economic and social well-being of developing countries. The arsenal of measures against such epidemics is well-established, but costly and insufficient to mitigate their impact. In this paper, we argue that mobile technology adds a powerful weapon to this arsenal, because (a) mobile devices endow us with the unprecedented ability to measure and model the detailed behavioral patterns of the affected population, and (b) they enable the delivery of personalized behavioral recommendations to individuals in real time. We combine these two ideas and propose several strategies to generate such recommendations from mobility patterns. The goal of each strategy is a large reduction in infections, with a small impact on the normal course of daily life. We evaluate these strategies over the Orange D4D dataset and show the benefit of mobile micro-measures, even if only a fraction of the population participates. These preliminary results demonstrate the potential of mobile technology to complement other measures like vaccination and quarantines against disease epidemics.

cs.SI↗

arXiv2013

On the Topology of the Facebook Page Network

The Facebook Page Network (FPN) is a platform for Businesses, Public Figures and Organizations (BPOs) to connect with individuals and other BPOs in the digital space. For over a decade scale-free networks have most appropriately described a variety of seemingly disparate physical, biological and social real-world systems unified by similar network properties such as scale-invariance, growth via a preferential attachment mechanism, and a power law degree distribution P(k) = ck^-λ where typically 2<λ<3. In this paper we show that both the Facebook Page Network and its BPO-BPO subnetwork suggest power law and scale-free characteristics. We argue that social media analysts must consider the logarithmic and non-linear properties of social media audiences of scale.

cs.SI↗

arXiv2013

Self-organization versus top-down planning in the evolution of a city

Interventions of central, top-down planning are serious limitations to the possibility of modelling the dynamics of cities. An example is the city of Paris (France), which during the 19th century experienced large modifications supervised by a central authority, the `Haussmann period'. In this article, we report an empirical analysis of more than 200 years (1789-2010) of the evolution of the street network of Paris. We show that the usual network measures display a smooth behavior and that the most important quantitative signatures of central planning is the spatial reorganization of centrality and the modification of the block shape distribution. Such effects can only be obtained by structural modifications at a large-scale level, with the creation of new roads not constrained by the existing geometry. The evolution of a city thus seems to result from the superimposition of continuous, local growth processes and punctual changes operating at large spatial scales.

physics.soc-ph↗

arXiv2013

From Technology-Driven Society to Socially Oriented Technology. The Future of Information Society -- Alternatives to Surveillance

Our society is changing. Almost nothing these days works without a computer chip. Computing power doubles every 18 months, and in ten years it will probably exceed the capabilities of a human brain. Computers perform approximately 70 percent of all financial transactions today and IBM's Watson now seems to give better customer advise than some human telephone hotlines. What does this imply for our future society?

physics.soc-ph↗

arXiv2013

Information Theoretic Adaptive Tracking of Epidemics in Complex Networks

Adaptively monitoring the states of nodes in a large complex network is of interest in domains such as national security, public health, and energy grid management. Here, we present an information theoretic adaptive tracking and sampling framework that recursively selects measurements using the feedback from performing inference on a dynamic Bayesian Network. We also present conditions for the existence of a network specific, observation dependent, phase transition in the updated posterior of hidden node states resulting from actively monitoring the network. Since traditional epidemic thresholds are derived using observation independent Markov chains, the threshold of the posterior should more accurately model the true phase transition of a network. The adaptive tracking framework and epidemic threshold should provide insight into modeling the dynamic response of the updated posterior to active intervention and control policies while monitoring modern complex networks.

physics.soc-ph↗

arXiv2013

Opinion Particles: Classical Physics and Opinion Dynamics

A model for Opinion Particles, based on Bayesian-inspired models of Opinion Dynamics such as the CODA model is presented. By extending the discrete time characteristic of those models to continuous time, a theory for the movement of opinion particles is obtained, based only on inference ideas. This will allow inertia to be obtained as a consequence of an extended CODA model. For the general case, we will see that the likelihoods are associated with variables such as velocity and acceleration of the particles. Newtonian forces are easily defined and the relationship between a force and the equivalent likelihood provided. The case of the harmonic oscillator is solved as an example, to illustrate clearly the relationship between Opinion Particles and Mechanics. Finally, possible paths to apply these results to General Relativity are debated.

physics.gen-ph↗