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

Inferring Metapopulation Propagation Network for Intra-city Epidemic Control and Prevention

Since the 21st century, the global outbreaks of infectious diseases such as SARS in 2003, H1N1 in 2009, and H7N9 in 2013, have become the critical threat to the public health and a hunting nightmare to the government. Understanding the propagation in large-scale metapopulations and predicting the future outbreaks thus become crucially important for epidemic control and prevention. In the literature, there have been a bulk of studies on modeling intra-city epidemic propagation but with the single population assumption (homogeneity). Some recent works on metapopulation propagation, however, focus on finding specific human mobility physical networks to approximate diseases transmission networks, whose generality to fit different diseases cannot be guaranteed. In this paper, we argue that the intra-city epidemic propagation should be modeled on a metapopulation base, and propose a two-step method for this purpose. The first step is to understand the propagation system by inferring the underlying disease infection network. To this end, we propose a novel network inference model called D$^2$PRI, which reduces the individual network into a sub-population network without information loss, and incorporates the power-law distribution prior and data prior for better performance. The second step is to predict the disease propagation by extending the classic SIR model to a metapopulation SIR model that allows visitors transmission between any two sub-populations. The validity of our model is testified on a real-life clinical report data set about the airborne disease in the Shenzhen city, China. The D$^2$PRI model with the extended SIR model exhibit superior performance in various tasks including network inference, infection prediction and outbreaks simulation.

cs.SI↗

Topological Phase Transitions in Spatial Networks

Most social, technological and biological networks are embedded in a finite dimensional space, and the distance between two nodes influences the likelihood that they link to each other. Indeed, in social systems, the chance that two individuals know each other drops rapidly with the distance between them; in the cell, proteins predominantly interact with proteins in the same cellular compartment; in the brain, neurons mainly link to nearby neurons. Most modeling frameworks that aim to capture the empirically observed degree distributions tend to ignore these spatial constraints. In contrast, models that account for the role of the physical distance often predict bounded degree distributions, in disagreement with the empirical data. Here we address a long-standing gap in the spatial network literature by deriving several key network characteristics of spatial networks, from the analytical form of the degree distribution to path lengths and local clustering. The mathematically exact results predict the existence of two distinct phases, each governed by a different dynamical equation, with distinct testable predictions. We use empirical data to offer direct evidence for the practical relevance of each of these phases in real networks, helping better characterize the properties of spatial networks.

physics.soc-ph↗

From clusters to queries: exploiting uncertainty in the modularity landscape of complex networks

Uncovering latent community structure in complex networks is a field that has received an enormous amount of attention. Unfortunately, whilst potentially very powerful, unsupervised methods for uncovering labels based on topology alone has been shown to suffer from several difficulties. For example, the search space for many module extraction approaches, such as the modularity maximisation algorithm, appears to be extremely glassy, with many high valued solutions that lack any real similarity to one another. However, in this paper we argue that this is not a flaw with the modularity maximisation algorithm but, rather, information that can be used to aid the context specific classification of functional relationships between vertices. Formally, we present an approach for generating a high value modularity consensus space for a network, based on the ensemble space of locally optimal modular partitions. We then use this approach to uncover latent relationships, given small query sets. The methods developed in this paper are applied to biological and social datasets with ground-truth label data, using a small number of examples used as seed sets to uncover relationships. When tested on both real and synthetic datasets our method is shown to achieve high levels of classification accuracy in a context specific manner, with results comparable to random walk with restart methods.

cs.SI↗

Survey of Graph Analysis Applications

Recently, many systems for graph analysis have been developed to address the growing needs of both industry and academia to study complex graphs. Insight into the practical uses of graph analysis will allow future developments of such systems to optimize for real-world usage, instead of targeting single use cases or hypothetical workloads. This insight may be derived from surveys on the applications of graph analysis. However, existing surveys are limited in the variety of application domains, datasets, and/or graph analysis techniques they study. In this work we present and apply a systematic method for identifying practical use cases of graph analysis. We identify commonly used graph features and analysis methods and use our findings to construct a taxonomy of graph analysis applications. We conclude that practical use cases of graph analysis cover a diverse set of graph features and analysis methods. Furthermore, most applications combine multiple features and methods. Our findings motivate further development of graph analysis systems to support a broader set of applications and to facilitate the combination of multiple analysis methods in an (interactive) workflow.

cs.SI↗

Multi-Stage Complex Contagions in Random Multiplex Networks

Complex contagion models have been developed to understand a wide range of social phenomena such as adoption of cultural fads, the diffusion of belief, norms, and innovations in social networks, and the rise of collective action to join a riot. Most existing works focus on contagions where individuals' states are represented by {\em binary} variables, and propagation takes place over a single isolated network. However, characterization of an individual's standing on a given matter as a binary state might be overly simplistic as most of our opinions, feelings, and perceptions vary over more than two states. Also, most real-world contagions take place over multiple networks (e.g., Twitter and Facebook) or involve {\em multiplex} networks where individuals engage in different {\em types} of relationships (e.g., acquaintance, co-worker, family, etc.). To this end, this paper studies {\em multi-stage} complex contagions that take place over multi-layer or multiplex networks. Under a linear threshold based contagion model, we give analytic results for the probability and expected size of \textit{global} cascades, i.e., cases where a randomly chosen node can initiate a propagation that eventually reaches a {\em positive} fraction of the whole population. Analytic results are also confirmed and supported by an extensive numerical study. In particular, we demonstrate how the dynamics of complex contagions is affected by the extra weight exerted by \textit{hyper-active} nodes and by the structural properties of the networks involved. Among other things, we reveal an interesting connection between the assortativity of a network and the impact of \textit{hyper-active} nodes on the cascade size.

physics.soc-ph↗

Weakest-link control of invasive species: Impacts of memory, bounded rationality and network structure in repeated cooperative games

The nature of dispersal of many invasive pests and pathogens in agricultural and forestry makes it necessary to consider how the actions of one manager affect neighbouring properties. In addition to the direct effects of a potential spread of a pest and the resulting economic loss, there are also indirect consequences that affect whole regions and that require coordinated actions to manage and/or to eradicate it (like movement restrictions). In this paper we address the emergence and stability of cooperation among agents who respond to a threat of an invasive pest or disease. The model, based on the weakest-link paradigm, uses repeated multi-participant coordination games where players' pay-offs depend on management decisions to prevent the invasion on their own land as well as of their neighbours on a network. We show that for the basic cooperation game agents select the risk-dominant strategy of a Stag hunt game over the pay-off dominant strategy of implementing control measures. However, cooperation can be achieved by the social planner offering a biosecurity payment. The critical level of this payment depends on the details of the decision-making process, with higher trust (based on a reputation of other agents reflecting their past performance) allowing a significant reduction in necessary payments and slowing down decay in cooperation when the payment is low. We also find that allowing for uncertainty in decision-making process can enhance cooperation for low levels of payments. Finally, we show the importance of industry structure to the emergence of cooperation, with increase in the average coordination number of network nodes leading to increase in the critical biosecurity payment.

q-bio.PE↗

Opinion formation on dynamic networks: identifying conditions for the emergence of partisan echo chambers

Modern political interaction is characterized by strong partisanship and a lack of interest in information sharing and agreement across party lines. It remains largely unclear how such partisan echo chambers arise and how they coevolve with opinion formation. Here we explore the emergence of these structures through the lens of coevolutionary games. In our model, the payoff of an individual is determined jointly by the magnitude of their opinion, their degree of conformity with their social neighbors, and the benefit of having social connections. Each individual can simultaneously adjust their opinion as well as the weights of their social connections. We present and validate the conditions for the emergence of partisan echo chambers, characterizing the transition from cohesive communities with consensus to divisive networks with splitting opinions. Moreover, we apply our model to voting records of the United States House of Representatives over a timespan of decades in order to understand the influence of underlying psychological and social factors on increasing partisanship in recent years. Our work helps elucidate how the division of today has come to be and how cohesion and unity could otherwise be attained on a variety of political and social issues.

physics.soc-ph↗

Visualizing spreading phenomena on complex networks

Graph drawings are useful tools for exploring the structure and dynamics of data that can be represented by pair-wise relationships among a set of objects. Typical real-world social, biological or technological networks exhibit high complexity resulting from a large number and broad heterogeneity of objects and relationships. Thus, mapping these networks into a low-dimensional space to visualize the dynamics of network-driven processes is a challenging task. Often we want to analyze how a single node is influenced by or is influencing its local network as the source of a spreading process. Here I present a network layout algorithm for graphs with millions of nodes that visualizes spreading phenomena from the perspective of a single node. The algorithm consists of three stages to allow for an interactive graph exploration: First, a global solution for the network layout is found in spherical space that minimizes distance errors between all nodes. Second, a focal node is interactively selected, and distances to this node are further optimized. Third, node coordinates are mapped to a circular representation and drawn with additional features to represent the network-driven phenomenon. The effectiveness and scalability of this method are shown for a large collaboration network of scientists, where we are interested in the citation dynamics around a focal author.

cs.SI↗

Core2Vec: A core-preserving feature learning framework for networks

Recent advances in the field of network representation learning are mostly attributed to the application of the skip-gram model in the context of graphs. State-of-the-art analogues of skip-gram model in graphs define a notion of neighbourhood and aim to find the vector representation for a node, which maximizes the likelihood of preserving this neighborhood. In this paper, we take a drastic departure from the existing notion of neighbourhood of a node by utilizing the idea of coreness. More specifically, we utilize the well-established idea that nodes with similar core numbers play equivalent roles in the network and hence induce a novel and an organic notion of neighbourhood. Based on this idea, we propose core2vec, a new algorithmic framework for learning low dimensional continuous feature mapping for a node. Consequently, the nodes having similar core numbers are relatively closer in the vector space that we learn. We further demonstrate the effectiveness of core2vec by comparing word similarity scores obtained by our method where the node representations are drawn from standard word association graphs against scores computed by other state-of-the-art network representation techniques like node2vec, DeepWalk and LINE. Our results always outperform these existing methods

cs.SI↗

Evolution of Cooperation on Stochastic Block Models

Cooperation is a major factor in the evolution of human societies. The structure of human social networks, which affects the dynamics of cooperation and other interpersonal phenomena, have common structural signatures. One of these signatures is the tendency to organize as groups. Among the generative models that network theorists use to emulate this feature is the Stochastic Block Model (SBM). In this paper, we study evolutionary game dynamics on SBM networks. Using a recently-discovered duality between evolutionary games and coalescing random walks, we obtain analytical conditions such that natural selection favors cooperation over defection. We calculate the transition point for each community to favor cooperation. We find that a critical inter-community link creation probability exists for given group density, such that the overall network supports cooperation even if individual communities inhibit it. As a byproduct, we present mean-field solutions for the critical benefit-to-cost ratio which perform with remarkable accuracy for diverse generative network models, including those with community structure and heavy-tailed degree distributions. We also demonstrate the generalizability of the results to arbitrary two-player games.

cs.SI↗

Characterizing the complexity of time series network graphs: A simplicial approach

We analyze the time series obtained from different dynamical regimes of the logistic map by constructing their equivalent time series (TS) networks, using the visibility algorithm. The regimes analyzed include both periodic and chaotic regimes, as well as intermittent regimes and the Feigenbaum attractor at the edge of chaos. We use the methods of algebraic topology to define the simplicial characterizers, which can analyse the simplicial structure of the networks at both the global and local levels. The simplicial characterisers bring out the hierarchical levels of complexity at various topological levels. These hierarchical levels of complexity find the skeleton of the local dynamics embedded in the network which influence the global dynamical properties of the system, and also permit the identification of dominant motifs. We also analyze the same networks using conventional network characterizers such as average path lengths and clustering coefficients. We see that the simplicial characterizers are capable of distinguishing between different dynamical regimes and can pick up subtle differences in dynamical behavior, whereas the usual characterizers provide a coarser characterization. However, the two taken in conjunction, can provide information about the dynamical behavior of the time series, as well as the correlations in the evolving system. Our methods can therefore provide powerful tools for the analysis of dynamical systems.

physics.soc-ph↗

On a Class of Stochastic Multilayer Networks

In this paper, we introduce a new class of stochastic multilayer networks. A stochastic multilayer network is the aggregation of $M$ networks (one per layer) where each is a subgraph of a foundational network $G$. Each layer network is the result of probabilistically removing links and nodes from $G$. The resulting network includes any link that appears in at least $K$ layers. This model is an instance of a non-standard site-bond percolation model. Two sets of results are obtained: first, we derive the probability distribution that the $M$-layer network is in a given configuration for some particular graph structures (explicit results are provided for a line and an algorithm is provided for a tree), where a configuration is the collective state of all links (each either active or inactive). Next, we show that for appropriate scalings of the node and link selection processes in a layer, links are asymptotically independent as the number of layers goes to infinity, and follow Poisson distributions. Numerical results are provided to highlight the impact of having several layers on some metrics of interest (including expected size of the cluster a node belongs to in the case of the line). This model finds applications in wireless communication networks with multichannel radios, multiple social networks with overlapping memberships, transportation networks, and, more generally, in any scenario where a common set of nodes can be linked via co-existing means of connectivity.

cs.SI↗

Mapping Three-dimensional Urban Structure by Fusing Landsat and Global Elevation Data

To meet the challenges of global urbanization, earth observation information is greatly needed. The lack of global three-dimensional (3D) urban structure data has been a major limiting factor in important urban applications such as population mapping, disaster vulnerability assessment, and climate change adaptation. Due to limited data availability, remote sensing data haven been mainly used to characterize 3D urban structure at the city scale. In this study, we propose a method to map 3D urban structure using freely available Landsat and global elevation data. Building on an object-based machine learning approach, the synergy of Landsat and elevation data were used to estimate building height and volume at 30 m resolution. This method has been tested for the entire country of England and yielded a root-mean-square error (RMSE) of 1.61 m for building height and an RMSE of 1,142 m\textsuperscript{3} for building volume. The results in this study represent the first attempt to use open data for urban structure characterization at the country scale. Our results demonstrated the utility of these data for large-scale urban studies and the potential of generating global 3D urban structure data products using a fusion-based approach.

physics.soc-ph↗

Disentangling co-occurrence patterns in n-partite ecosystems

The need to harmonise apparently irreconcilable arrangements in an ecosystem --nestedness and segregation-- has triggered so far different strategies. Methodological refinements, or the inclusion of behavioural preferences to the network dynamics offer a limited approach to the problem, since one remains constrained within a 2-dimensional view of an ecosystem, i.e. a presence-absence matrix. Here we question this partial-view paradigm, and show that nestedness and segregation may coexist across a varied range of scenarios. To do so, we rely on an upscaled representation of an ecological community as an $n$-partite hypergraph, inspired by Hutchinson's high-dimensional niche concept and the latest trends on ecological multilayer networks. This yields an inclusive description of an ecological system, for which we develop a natural extension of the definition of nestedness to larger dimensional spaces, revealing how competitive exclusion may operate regardless of a highly nested bipartite system.

physics.soc-ph↗

A network-based citation indicator of scientific performance

Scientists are embedded in social and information networks that influence and are influenced by the quality of their scientific work, its impact, and the recognition they receive. Here we quantify the systematic relationship between a scientist's position in the network of scientific collaborations and the citations they receive. As expected, we find that authors closer to others in this network are, on average, more highly cited than those further away from others. We construct a novel indicator, the s-index, that explicitly captures performance linked to network position along two complimentary dimensions: performance expected due to network position and performance relative to this position. The basis of our approach is to represent an author's network position through their distribution of distances to other authors. The s-index then ranks (1) the citation potential of an individual's network position relative to all other authors, and (2) the citations they accrue relative to authors that have a comparable network position. Characterizing scientists through these two complimentary dimensions can be used to make more informed evaluations in a networked environment. For example, it can identify individuals that play an important role in diffusing scientific ideas. It also sheds a new light on central debates in the Science of Science, namely the impact of author teams and comparisons of impact across scientific fields.

cs.DL↗

Want to bring a community together? Create more sub-communities

Understanding overlapping community structures is crucial for network analysis and prediction. AGM (Affiliation Graph Model) is one of the favorite models for explaining the densely overlapped community structures. In this paper, we thoroughly re-investigate the assumptions made by the AGM model on real datasets. We find that the AGM model is not sufficient to explain several empirical behaviors observed in popular real-world networks. To our surprise, all our experimental results can be explained by a parameter-free hypothesis, leading to more straightforward modeling than AGM which has many parameters. Based on these findings, we propose a parameter-free Jaccard-based Affiliation Graph (JAG) model which models the probability of edge as a network specific constant times the Jaccard similarity between community sets associated with the individuals. Our modeling is significantly simpler than AGM, and it eliminates the need of associating a parameter, the probability value, with each community. Furthermore, JAG model naturally explains why (and in fact when) overlapping communities are densely connected. Based on these observations, we propose a new community-driven friendship formation process, which mathematically recovers the JAG model. JAG is the first model that points towards a direct causal relationship between tight connections in the given community with the number of overlapping communities inside it. Thus, \emph{the most effective way to bring a community together is to form more sub-communities within it.} The community detection algorithm based on our modeling demonstrates a significantly simple algorithm with state-of-the-art accuracy on six real-world network datasets compared to the existing link analysis based methods.

cs.SI↗

A polynomial eigenvalue approach for multiplex networks

We explore the block nature of the matrix representation of multiplex networks, introducing a new formalism to deal with its spectral properties as a function of the inter-layer coupling parameter. This approach allows us to derive interesting results based on an interpretation of the traditional eigenvalue problem. More specifically, we reduce the dimensionality of our matrices but increase the power of the characteristic polynomial, i.e, a polynomial eigenvalue problem. Such an approach may sound counterintuitive at first glance, but it allows us to relate the quadratic problem for a 2-Layer multiplex system with the spectra of the aggregated network and to derive bounds for the spectra, among many other interesting analytical insights. Furthermore, it also permits to directly obtain analytical and numerical insights on the eigenvalue behavior as a function of the coupling between layers. Our study includes the supra-adjacency, supra-Laplacian, and the probability transition matrices, which enable us to put our results under the perspective of structural phases in multiplex networks. We believe that this formalism and the results reported will make it possible to derive new results for multiplex networks in the future.

physics.soc-ph↗

City of the People, for the People: Sensing Urban Dynamics via Social Media Interactions

Understanding the spatio-temporal dynamics of cities is in the heart of many applications including urban planning, zoning, and real-estate construction. So far, much of our understanding about urban dynamics came from traditional surveys conducted by persons or by leveraging mobile data in the form of Call Detailed Records. However, the high financial and human cost associated with these methods make the data availability very limited. In this paper, we investigate the use of large scale and publicly available user contributed content, in the form of social media posts to understand the urban dynamics of cities. We build activity time series for different cities, and different neighborhoods within the same city to identify the different dynamic patterns taking place. Next, we conduct a cluster analysis on the time series to understand the spatial distribution of patterns in the city. Our instantiation for the two cities of London and Doha shows the effectiveness of our method.

cs.SI↗