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 757 records · Page 42Linked to original sources

Information Spreading on Almost Torus Networks

Epidemic modeling has been extensively used in the last years in the field of telecommunications and computer networks. We consider the popular Susceptible-Infected-Susceptible spreading model as the metric for information spreading. In this work, we analyze information spreading on a particular class of networks denoted almost torus networks and over the lattice which can be considered as the limit when the torus length goes to infinity. Almost torus networks consist on the torus network topology where some nodes or edges have been removed. We find explicit expressions for the characteristic polynomial of these graphs and tight lower bounds for its computation. These expressions allow us to estimate their spectral radius and thus how the information spreads on these networks.

cs.SI↗

Urban Mobility Scaling: Lessons from `Little Data'

Recent mobility scaling research, using new data sources, often relies on aggregated data alone. Hence, these studies face difficulties characterizing the influence of factors such as transportation mode on mobility patterns. This paper attempts to complement this research by looking at a category-rich mobility data set. In order to shed light on the impact of categories, as a case study, we use conventionally collected German mobility data. In contrast to `check-in'-based data, our results are not biased by Euclidean distance approximations. In our analysis, we show that aggregation can hide crucial differences between trip length distributions, when subdivided by categories. For example, we see that on an urban scale (0 to ~15 km), walking, versus driving, exhibits a highly different scaling exponent, thus universality class. Moreover, mode share and trip length are responsive to day-of-week and time-of-day. For example, in Germany, although driving is relatively less frequent on Sundays than on Wednesdays, trips seem to be longer. In addition, our work may shed new light on the debate between distance-based and intervening-opportunity mechanisms affecting mobility patterns, since mode may be chosen both according to trip length and urban form.

physics.soc-ph↗

Effect of Memory on the Dynamics of Random Walks on Networks

Pathways of diffusion observed in real-world systems often require stochastic processes going beyond first-order Markov models, as implicitly assumed in network theory. In this work, we focus on second-order Markov models, and derive an analytical expression for the effect of memory on the spectral gap and thus, equivalently, on the characteristic time needed for the stochastic process to asymptotically reach equilibrium. Perturbation analysis shows that standard first-order Markov models can either overestimate or underestimate the diffusion rate of flows across the modular structure of a system captured by a second-order Markov network. We test the theoretical predictions on a toy example and on numerical data, and discuss their implications for network theory, in particular in the case of temporal or multiplex networks.

physics.soc-ph↗

Modeling and Predicting Popularity Dynamics via Reinforced Poisson Processes

An ability to predict the popularity dynamics of individual items within a complex evolving system has important implications in an array of areas. Here we propose a generative probabilistic framework using a reinforced Poisson process to model explicitly the process through which individual items gain their popularity. This model distinguishes itself from existing models via its capability of modeling the arrival process of popularity and its remarkable power at predicting the popularity of individual items. It possesses the flexibility of applying Bayesian treatment to further improve the predictive power using a conjugate prior. Extensive experiments on a longitudinal citation dataset demonstrate that this model consistently outperforms existing popularity prediction methods.

cs.SI↗

Power Grid Defense Against Malicious Cascading Failure

An adversary looking to disrupt a power grid may look to target certain substations and sources of power generation to initiate a cascading failure that maximizes the number of customers without electricity. This is particularly an important concern when the enemy has the capability to launch cyber-attacks as practical concerns (i.e. avoiding disruption of service, presence of legacy systems, etc.) may hinder security. Hence, a defender can harden the security posture at certain power stations but may lack the time and resources to do this for the entire power grid. We model a power grid as a graph and introduce the cascading failure game in which both the defender and attacker choose a subset of power stations such as to minimize (maximize) the number of consumers having access to producers of power. We formalize problems for identifying both mixed and deterministic strategies for both players, prove complexity results under a variety of different scenarios, identify tractable cases, and develop algorithms for these problems. We also perform an experimental evaluation of the model and game on a real-world power grid network. Empirically, we noted that the game favors the attacker as he benefits more from increased resources than the defender. Further, the minimax defense produces roughly the same expected payoff as an easy-to-compute deterministic load based (DLB) defense when played against a minimax attack strategy. However, DLB performs more poorly than minimax defense when faced with the attacker's best response to DLB. This is likely due to the presence of low-load yet high-payoff nodes, which we also found in our empirical analysis.

cs.CR↗

Utility Rate Equations of Group Population Dynamics in Biological and Social Systems

We present a novel system of equations to describe the evolution of self-organized structured societies (biological or human) composed of several trait groups. The suggested approach is based on the combination of ideas employed in the theory of biological populations, system theory, and utility theory. The evolution equations are defined as utility rate equations, whose parameters are characterized by the utility of each group with respect to the society as a whole and by the mutual utilities of groups with respect to each other. We analyze in detail the cases of two groups (cooperators and defectors) and of three groups (cooperators, defectors, and regulators) and find that, in a self-organized society, neither defectors nor regulators can overpass the maximal fractions of about 10% each. This is in agreement with the data for bee and ant colonies. The classification of societies by their distance from equilibrium is proposed. We apply the formalism to rank the countries according to the introduced metric quantifying their relative stability, which depends on the cost of defectors and regulators as well as their respective population fractions. We find a remarkable concordance with more standard economic ranking based, for instance, on GDP per capita.

physics.soc-ph↗

Pedestrian Route Choice by Iterated Equilibrium Search

In vehicular traffic planning it is a long standing problem how to assign demand such on the available model of a road network that an equilibrium with regard to travel time or generalized costs is realized. For pedestrian traffic this question can be asked as well. However, as the infrastructure of pedestrian dynamics is not a network (a graph), but two-dimensional, there is in principle an infinitely large set of routes. As a consequence none of the iterating assignment methods developed for road traffic can be applied for pedestrians. In this contribution a method to overcome this problem is briefly summarized and applied with an example geometry which as a result is enhanced with routes with intermediate destination areas of certain shape. The enhanced geometry is used in some exemplary assignment calculations.

cs.MA↗

Crowd Research at School: Crossing Flows

It has become widely known that when two flows of pedestrians cross stripes emerge spontaneously by which the pedestrians of the two walking directions manage to pass each other in an orderly manner. In this work, we report about the results of an experiment on crossing flows which has been carried out at a German school. These results include that previously reported high flow volumes on the crossing area can be confirmed. The empirical results are furthermore compared to the results of a simulation model which succesfully could be calibrated to catch the specific properties of the population of participants.

physics.soc-ph↗

Scale-free interpersonal influences on opinions in complex systems

An important side effect of the evolution of the human brain is an increased capacity to form opinions in a very large domain of issues, which become points of aggressive interpersonal disputes. Remarkably, such disputes are often no less vigorous on small differences of opinion than large differences. Opinion differences that may be measured on the real number line may not directly correspond to the subjective importance of an issue and extent of resistance to opinion change. This is a hard problem for field of opinion dynamics, a field that has become increasingly prominent as it has attracted more contributions to it from investigators in the natural and engineering sciences. The paper contributes a scale-free approach to assessing the extents to which individuals, with unknown heterogeneous resistances to influence, have been influenced by the opinions of others.

cs.SI↗

Power of individuals -- Controlling centrality of temporal networks

Temporal networks are such networks where nodes and interactions may appear and disappear at various time scales. With the evidence of ubiquity of temporal networks in our economy, nature and society, it's urgent and significant to focus on structural controllability of temporal networks, which nowadays is still an untouched topic. We develop graphic tools to study the structural controllability of temporal networks, identifying the intrinsic mechanism of the ability of individuals in controlling a dynamic and large-scale temporal network. Classifying temporal trees of a temporal network into different types, we give (both upper and lower) analytical bounds of the controlling centrality, which are verified by numerical simulations of both artificial and empirical temporal networks. We find that the scale-free distribution of node's controlling centrality is virtually independent of the time scale and types of datasets, meaning the inherent heterogeneity and robustness of the controlling centrality of temporal networks.

cs.SI↗

Exploiting all phone media? A multidimensional network analysis of phone users' sociality

The growing awareness that human communications and social interactions are assuming a stratified structure, due to the availability of multiple techno-communication channels, including online social networks, mobile phone calls, short messages (SMS) and e-mails, has recently led to the study of multidimensional networks, as a step further the classical Social Network Analysis. A few papers have been dedicated to develop the theoretical framework to deal with such multiplex networks and to analyze some example of multidimensional social networks. In this context we perform the first study of the multiplex mobile social network, gathered from the records of both call and text message activities of millions of users of a large mobile phone operator over a period of 12 weeks. While social networks constructed from mobile phone datasets have drawn great attention in recent years, so far studies have dealt with text message and call data, separately, providing a very partial view of people sociality expressed on phone. Here we analyze how the call and the text message dimensions overlap showing how many information about links and nodes could be lost only accounting for a single layer and how users adopt different media channels to interact with their neighborhood.

cs.SI↗

Uncovering nodes that spread information between communities in social networks

From many datasets gathered in online social networks, well defined community structures have been observed. A large number of users participate in these networks and the size of the resulting graphs poses computational challenges. There is a particular demand in identifying the nodes responsible for information flow between communities; for example, in temporal Twitter networks edges between communities play a key role in propagating spikes of activity when the connectivity between communities is sparse and few edges exist between different clusters of nodes. The new algorithm proposed here is aimed at revealing these key connections by measuring a node's vicinity to nodes of another community. We look at the nodes which have edges in more than one community and the locality of nodes around them which influence the information received and broadcasted to them. The method relies on independent random walks of a chosen fixed number of steps, originating from nodes with edges in more than one community. For the large networks that we have in mind, existing measures such as betweenness centrality are difficult to compute, even with recent methods that approximate the large number of operations required. We therefore design an algorithm that scales up to the demand of current big data requirements and has the ability to harness parallel processing capabilities. The new algorithm is illustrated on synthetic data, where results can be judged carefully, and also on a real, large scale Twitter activity data, where new insights can be gained.

cs.SI↗

A Creepy World

Using the mechanics of creep in material sciences as a metaphor, we present a general framework to understand the evolution of financial, economic and social systems and to construct scenarios for the future. In a nutshell, highly non-linear out-of-equilibrium systems subjected to exogenous perturbations tend to exhibit a long phase of slow apparent stable evolution, which are nothing but slow maturations towards instabilities, failures and changes of regimes. With examples from history where a small event had a cataclysmic consequence, we propose a novel view of the current state of the world via the logical scenarios that derive, avoiding the traps of an illusionary stability and simple linear extrapolation. The endogenous scenarios are "muddling along", "managing through" and "blood red abyss". The exogenous scenarios are "painful adjustment" and "golden east".

physics.soc-ph↗

Clustering Evolving Networks

Roughly speaking, clustering evolving networks aims at detecting structurally dense subgroups in networks that evolve over time. This implies that the subgroups we seek for also evolve, which results in many additional tasks compared to clustering static networks. We discuss these additional tasks and difficulties resulting thereof and present an overview on current approaches to solve these problems. We focus on clustering approaches in online scenarios, i.e., approaches that incrementally use structural information from previous time steps in order to incorporate temporal smoothness or to achieve low running time. Moreover, we describe a collection of real world networks and generators for synthetic data that are often used for evaluation.

cs.SI↗

Is the month of Ramadan marked by a reduction in the number of suicides?

For Muslims the month of Ramadan is a time of fasting but during the evenings after sunset it is also an occasion for family and social gatherings. Therefore, according to the Bertillon-Durkheim conception of suicide (that is based on the strength of social ties), one would expect a fall in suicide rates during Ramadan. Is this conjecture confirmed by observation? That is the question addressed in the present paper. Surprisingly, the most tricky part of the investigation was to find reliable monthly suicide data. In the Islamic world Turkey seems to be the only country whose statistical institute publishes such observations. The data reveal indeed a fall of about $15\%$ in suicide numbers during the month of Ramadan (with respect to same-non-Ramadan months). As the standard deviation is only $4.7\%$ this effect has a high degree of significance. This observation, along with the fact that other occasions of social gathering such as Thanksgiving or Christmas are also marked by a drop in suicides, adds further credence to the B-D thesis.

physics.soc-ph↗

A universal law in human mobility

The intrinsic factor that drives the human movement remains unclear for decades. While our observations from intra-urban and inter-urban trips both demonstrate a universal law in human mobility. Be specific, the probability from one location to another is inversely proportional to the number of population living in locations which are closer than the destination. A simple rank-based model is then presented, which is parameterless but predicts human flows with a convincing fidelity. Besides, comparison with other models shows that our model is more stable and fundamental at different spatial scales by implying the strong correlation between human mobility and social relationship.

physics.soc-ph↗

Towards a systematic characterization of the potential of demand side management

With an increasing share of electric energy produced from non-dispatchable renewable sources both energy storage and demand side management might gain tremendously in importance. While there has been significant progress in general properties and technologies of energy storage, the systematic characterization of features particular to demand side management such as its intermittent, time-dependent potential seems to be lagging behind. As a consequence, the development of efficient and sustainable strategies for demand side management and its integration into large-scale energy system models are impeded. This work introduces a novel framework for a systematic time-resolved characterization of the potential for demand side management. It is based on the specification of individual devices both with respect to their scheduled demand and their potential of load shifting. On larger scales sector-specific profiles can straightforwardly be taken into account. The potential for demand side management is then specified in terms of size and capacity of an equivalent storage device. This intermediate layer of abstraction isolates the gross effects and opportunities of demand side management from questions concerning the operation of individual devices, which eases the integration of the results in existing schemes for the commitment of production units and system models. The novel framework is applicable for conceptual or predictive approaches and for real-time optimization and operation of energy systems involving demand side management.

physics.soc-ph↗

Statistics of co-occurring keywords on Twitter

Online social media such as the micro-blogging site Twitter has become a rich source of real-time data on online human behaviors. Here we analyze the occurrence and co-occurrence frequency of keywords in user posts on Twitter. From the occurrence rate of major international brand names, we provide examples on predictions of brand-user behaviors. From the co-occurrence rates, we further analyze the user-perceived relationships between international brand names and construct the corresponding relationship networks. In general the user activity on Twitter is highly intermittent and we show that the occurrence rate of brand names forms a highly correlated time signal.

physics.soc-ph↗