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,027 records · Page 57Linked to original sources

Self-organization in complex systems as decision making

The idea is advanced that self-organization in complex systems can be treated as decision making (as it is performed by humans) and, vice versa, decision making is nothing but a kind of self-organization in the decision maker nervous systems. A mathematical formulation is suggested based on the definition of probabilities of system states, whose particular cases characterize the probabilities of structures, patterns, scenarios, or prospects. In this general framework, it is shown that the mathematical structures of self-organization and of decision making are identical. This makes it clear how self-organization can be seen as an endogenous decision making process and, reciprocally, decision making occurs via an endogenous self-organization. The approach is illustrated by phase transitions in large statistical systems, crossovers in small statistical systems, evolutions and revolutions in social and biological systems, structural self-organization in dynamical systems, and by the probabilistic formulation of classical and behavioral decision theories. In all these cases, self-organization is described as the process of evaluating the probabilities of macroscopic states or prospects in the search for a state with the largest probability. The general way of deriving the probability measure for classical systems is the principle of minimal information, that is, the conditional entropy maximization under given constraints. Behavioral biases of decision makers can be characterized in the same way as analogous to quantum fluctuations in natural systems.

nlin.AO↗

Optimal search strategies on complex networks

Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road networks, which impact both transportation design and epidemic control. In the brain, neurons are cabled through heterogeneous connections, which support the propagation of electric signals. In all these cases, the true challenge is to unveil the mechanisms through which specific dynamical features are modulated by the underlying topology of the network. Here, we consider agents randomly hopping along the links of a graph, with the additional possibility of performing long-range hops to randomly chosen disconnected nodes with a given probability. We show that an optimal combination of the two jump rules exists that maximises the efficiency of target search, the optimum reflecting the topology of the network.

physics.soc-ph↗

A model of grassroots changes in linguistic systems

Linguistic norms emerge in human communities because people imitate each other. A shared linguistic system provides people with the benefits of shared knowledge and coordinated planning. Once norms are in place, why would they ever change? This question, echoing broad questions in the theory of social dynamics, has particular force in relation to language. By definition, an innovator is in the minority when the innovation first occurs. In some areas of social dynamics, important minorities can strongly influence the majority through their power, fame, or use of broadcast media. But most linguistic changes are grassroots developments that originate with ordinary people. Here, we develop a novel model of communicative behavior in communities, and identify a mechanism for arbitrary innovations by ordinary people to have a good chance of being widely adopted. To imitate each other, people must form a mental representation of what other people do. Each time they speak, they must also decide which form to produce themselves. We introduce a new decision function that enables us to smoothly explore the space between two types of behavior: probability matching (matching the probabilities of incoming experience) and regularization (producing some forms disproportionately often). Using Monte Carlo methods, we explore the interactions amongst the degree of regularization, the distribution of biases in a network, and the network position of the innovator. We identify two regimes for the widespread adoption of arbritrary innovations, viewed as informational cascades in the network. With moderate regularization of experienced input, average people (not well-connected people) are the most likely source of successful innovations. Our results shed light on a major outstanding puzzle in the theory of language change. The framework also holds promise for understanding the dynamics of other social norms.

cs.CL↗

Selfish punishment with avoiding mechanism can alleviate both first-order and second-order social dilemma

Punishment, especially selfish punishment, has recently been identified as a potent promoter in sustaining or even enhancing the cooperation among unrelated individuals. However, without other key mechanisms, the first-order social dilemma and second-order social dilemma are still two enduring conundrums in biology and the social sciences even with the presence of punishment. In the present study, we investigate a spatial evolutionary four-strategy prisoner's dilemma game model with avoiding mechanism, where the four strategies are cooperation, defection, altruistic and selfish punishment. By introducing the low level of random mutation of strategies, we demonstrate that the presence of selfish punishment with avoiding mechanism can alleviate the two kinds of social dilemmas for various parametrizations. In addition, we propose an extended pair approximation method, whose solutions can essentially estimate the dynamical behaviors and final evolutionary frequencies of the four strategies. At last, considering the analogy between our model and the classical Lotka-Volterra system, we introduce interaction webs based on the spatial replicator dynamics and the transformed payoff matrix to qualitatively characterize the emergent co-exist strategy phases, and its validity are supported by extensive simulations.

physics.soc-ph↗

An analytical expression for the exit probability of the q-voter model in one dimension

We present in this paper an approximation that is able to give an analytical expression for the exit probability of the $q$-voter model in one dimension. This expression gives a better fit for the more recent data about simulations in large networks, and as such, departs from the expression $\frac{ρ^q}{ρ^q + (1-ρ)^q}$ found in papers that investigated small networks only. The approximation consists in assuming a large separation on the time scales at which active groups of agents convince inactive ones and the time taken in the competition between active groups. Some interesting findings are that for $q=2$ we still have $\frac{ρ^2}{ρ^2 + (1-ρ)^2}$ as the exit probability and for large values of $q$ the difference between the result and $\frac{ρ^q}{ρ^q + (1-ρ)^q}$ becomes negligible (the difference is maximum for $q=5$ and 6)

physics.soc-ph↗

Affinity Prediction in Online Social Networks

Link prediction is the problem of inferring whether potential edges between pairs of vertices in a graph will be present or absent in the near future. To perform this task it is usual to use information provided by a number of available and observed vertices/edges. Then, a number of edge scoring methods based on this information can be created. Usually, these methods assess local structures of the observed graph, assuming that closer vertices in the original period of observation will be more likely to form a link in the future. In this paper we explore the combination of local and global features to conduct link prediction in online social networks. The contributions of the paper are twofold: a) We evaluate a number of strategies that combines global and local features tackling the locality assumption of link prediction scoring methods, and b) We only use network topology-based features, avoiding the inclusion of informational or transactional based features that involve heavy computational costs in the methods. We evaluate our proposal using real-world data provided by Skout Inc., an affinity online social network with millions of users around the world. Our results show that our proposal is feasible.

cs.SI↗

The Value of Using Big Data Technologies in Computational Social Science

The discovery of phenomena in social networks has prompted renewed interests in the field. Data in social networks however can be massive, requiring scalable Big Data architecture. Conversely, research in Big Data needs the volume and velocity of social media data for testing its scalability. Not only so, appropriate data processing and mining of acquired datasets involve complex issues in the variety, veracity, and variability of the data, after which visualisation must occur before we can see fruition in our efforts. This article presents topical, multimodal, and longitudinal social media datasets from the integration of various scalable open source technologies. The article details the process that led to the discovery of social information landscapes within the Twitter social network, highlighting the experience of dealing with social media datasets, using a funneling approach so that data becomes manageable. The article demonstrated the feasibility and value of using scalable open source technologies for acquiring massive, connected datasets for research in the social sciences.

cs.SI↗

Improving the Network Structure can lead to Functional Failures

In many real-world networks the ability to synchronize is a key property for its performance. Examples include power-grid, sensor, and neuron networks as well as consensus formation. Recent work on undirected networks with diffusive interaction revealed that improvements in the network connectivity such as making the network more connected and homogeneous enhances synchronization. However, real-world networks have directed and weighted connections. In such directed networks, understanding the impact of structural changes on the network performance remains a major challenge. Here, we show that improving the structure of a directed network can lead to a failure in the network function. For instance, introducing new links to reduce the minimum distance between nodes can lead to instabilities in the synchronized motion. This counter-intuitive effect only occurs in directed networks. Our results allow to identify the dynamical importance of a link and thereby have a major impact on the design and control of directed networks.

math.DS↗

Temporal Evolution of Social Innovation

Acceptance of an innovation can occur through mutliple exposures to individuals who have already accepted it. Presented here is a model to trace the evolution of an innovation in a social network with a preference $λ$, amidst topological constraints specified mainly by connectivity, $k$ and population size, $N_k$. With the interplay between properties of innovation and network structure, the model attempts to explain the variations in patterns of innovations across social networks. Time in which the propagation attains highest velocity depends on $λ^{-2}k^{-2}N_{k}^{1/2}$. Dynamics in random networks may lead or lag behind that in scale-free networks depending on the average connectivity. Hierarchical propagation is evident across connectivity classes within scale-free networks, as well as across random networks with distinct topological indices. For highly preferred innovations, the hierarchy observed within scale-free networks tends to be insignificant. The results have implications for administering innovations in finite size networks.

physics.soc-ph↗

How can one explain changes in the monthly pattern of suicide?

The monthly pattern of suicides has remained a puzzle ever since it was discovered in the second half of the 19th century. In this paper we intend to "explain" not the pattern itself but rather its changes across countries and in the course of time. First, we show that the fairly common idea according to which this pattern is decaying in "modern" societies is not altogether true. For instance, around 2000, in well urbanized countries like South Korea or Spain this pattern was still as strong as it was in France (and other European countries) in the late 19th century. The method that we use in order to make some progress in our understanding is the time-honoured Cartesian approach of breaking up the problem under consideration "into as many parts as might be necessary to solve it". More specifically, we try two decompositions of monthly suicides: (i) according to suicide methods (ii) according to age-groups. The first decomposition points out the key-role of hanging and drowning. The second shows the crucial role of the $ 15-20 $ and $ 65+ $ age-groups. Then, we present a number of cases in which age-group decomposition provides adequate predictions. It turns out that the cases in which the predictions do not work are newly urbanized countries. The discrepancies may be due to a memory effect which induces a time-lag extending over one or two generations. Finally, in the light of the new results presented in the present paper, we re-examine the theory proposed by Emile Durkheim.

physics.soc-ph↗

The curriculum prerequisite network: a tool for visualizing and analyzing academic curricula

This article advances the prerequisite network as a means to visualize the hidden structure in an academic curriculum. Network technologies have been used for some time now in social analyses and more recently in biology in the areas of genomics and systems biology. Here I treat the curriculum as a complex system with nodes representing courses and links between nodes the course prerequisites as readily obtained from a course catalogue. The resulting curriculum prerequisite network can be rendered as a directed acyclic graph, which has certain desirable analytical features. The curriculum is seen as partitioned into numerous isolated course groupings, the size of the groups varying considerably. Individual courses are seen serving very different roles in the overall organization, such as information sources, hubs, and bridges. This network represents the intrinsic, hard-wired constraints on the flow of information in a curriculum, and is the organizational context within which learning occurs.

cs.SI↗

Modeling interacting dynamic networks: III. Extraordinary properties in a population of extreme introverts and extroverts

Recently, we introduced dynamic networks with preferred degrees, showing that interesting properties are present in a single, homogeneous system as well as one with two interacting networks. While simulations are readily performed, analytic studies are challenging, due mainly to the lack of detailed balance in the dynamics. Here, we consider the two-community case in a special limit: a system of extreme introverts and extroverts - the XIE model. Surprising phenomena appear, even in this minimal model, where the only control parameters are the numbers of each subgroup: $N_{I,E}$. Specifically, an extraordinary transition emerges when $N_I$ crosses $N_E$. For example, the fraction of total number of I-E links jumps from $\thicksim 0$ to $\thicksim 1$. In a $N_I=N_E$ system, this fraction performs a pure random walk so that its distribution displays a flat plateau across most of $[0,1]$, with the edges vanishing as $(N_{I,E})^{-0.38}$ for large systems. Thus, we believe the XIE model exhibits an extreme Thouless effect. For this limiting model, we show that detailed balance is restored and explicitly find the microscopic steady-state distribution. We then use a mean-field approach to find analytic expressions for the degree distributions that are in reasonably good agreement with simulations, provided $N_I$ is not too close to $N_{E}$.

physics.soc-ph↗

Automatic and efficient driving strategies while approaching a traffic light

Vehicle-infrastructure communication opens up new ways to improve traffic flow efficiency at signalized intersections. In this study, we assume that equipped vehicles can obtain information about switching times of relevant traffic lights in advance. This information is used to improve traffic flow by the strategies 'early braking', 'anticipative start', and 'flying start'. The strategies can be implemented in driver-information mode, or in automatic mode by an Adaptive Cruise Controller (ACC). Quality criteria include cycle-averaged capacity, driving comfort, fuel consumption, travel time, and the number of stops. By means of simulation, we investigate the isolated strategies and the complex interactions between the strategies and between equipped and non-equipped vehicles. As universal approach to assess equipment level effects we propose relative performance indexes and found, at a maximum speed of 50 km/h, improvements of about 15% for the number of stops and about 4% for the other criteria. All figures double when increasing the maximum speed to 70 km/h.

physics.soc-ph↗

Diffusion of Innovations over Multiplex Social Networks

The ways in which an innovation (e.g., new behaviour, idea, technology, product) diffuses among people can determine its success or failure. In this paper, we address the problem of diffusion of innovations over multiplex social networks where the neighbours of a person belong to one or multiple networks (or layers) such as friends, families, or colleagues. To this end, we generalise one of the basic game-theoretic diffusion models, called networked coordination game, for multiplex networks. We present analytical results for this extended model and validate them through a simulation study, finding among other properties a lower bound for the success of an innovation.While simple and leading to intuitively understandable results, to the best of our knowledge this is the first extension of a game-theoretic innovation diffusion model for multiplex networks and as such it provides a basic framework to study more sophisticated innovation dynamics.

cs.SI↗

A general method for identifying node spreading influence via the adjacent matrix and spreading rate

With great theoretical and practical significance, identifying the node spreading influence of complex network is one of the most promising domains. So far, various topology-based centrality measures have been proposed to identify the node spreading influence in a network. However, the node spreading influence is a result of the interplay between the network topology structure and spreading dynamics. In this paper, we build up the systematic method by combining the network structure and spreading dynamics to identify the node spreading influence. By combining the adjacent matrix $A$ and spreading parameter $β$, we theoretical give the node spreading influence with the eigenvector of the largest eigenvalue. Comparing with the Susceptible-Infected-Recovered (SIR) model epidemic results for four real networks, our method could identify the node spreading influence more accurately than the ones generated by the degree, K-shell and eigenvector centrality. This work may provide a systematic method for identifying node spreading influence.

physics.soc-ph↗

Motif Conservation Laws for the Configuration Model

The observation that some subgraphs, called motifs, appear more often in real networks than in their randomized counterparts has attracted much attention in the scientific community. In the prevalent approach the detection of motifs is based on comparing subgraph counts in a network with their counterparts in the configuration model with the same degree distribution as the network. In this short note we derive conservation laws that relate motif counts in the configuration model.

q-bio.MN↗

Public Spheres in Twitter- and Blogosphere. Evidence from the US

The political requires a forum for its deliberation and Habermas has located it in the public spheres. Originally, mass media's role was one of a facilitator of these debates. However, under the immense pressures of free market competition and mobile audiences, mass media prefers episodic over thematic news. On the opposite end of the spectrum, social media has been heralded as a new forum, a reincarnation of the ailing public spheres to further the deliberation of the political. But do the followers of political parties in social media endorse thematic or episodic content? To answer this question, I look at the most recent 3,200 tweets that were broadcast from the Republican and Democratic Twitter accounts. By employing Latent dirichlet allocation, I extract the prevailing topics of these tweets and linked websites. Generalized linear models are used to describe the relationship between episodicity, thematicity and the endorsement counts of the posts analyzed. I find that there is a stark contrast between the behavior of Democratic and Republican followers. In general, there seems to be a slight preference for thematic messages. Interestingly, the distance to an election increases the odds of a message to be endorsed.

cs.SI↗

Modeling Non-Progressive Phenomena for Influence Propagation

Recent work on modeling influence propagation focus on progressive models, i.e., once a node is influenced (active) the node stays in that state and cannot become inactive. However, this assumption is unrealistic in many settings where nodes can transition between active and inactive states. For instance, a user of a social network may stop using an app and become inactive, but again activate when instigated by a friend, or when the app adds a new feature or releases a new version. In this work, we study such non-progressive phenomena and propose an efficient model of influence propagation. Specifically, we model in influence propagation as a continuous-time Markov process with 2 states: active and inactive. Such a model is both highly scalable (we evaluated on graphs with over 2 million nodes), 17-20 times faster, and more accurate for estimating the spread of influence, as compared with state-of-the-art progressive models for several applications where nodes may switch states.

cs.SI↗