Social movements, neurons in the brain or even industrial suppliers are best described by agents evolving on networks with basic interaction rules. In these real systems, the connectivity between agents corresponds to the a critical state of the system related to the noise of the system. The new idea is that connectivity adjusts itself because of two opposite tendencies: on the one hand informations percolation is better when the network connectivity is small but all agents have rapidely the same state and the dynamics stops.
On the other hand, when agents have a large connectivity, the state of a node (opinion of a person, state of a neuron, ...) tends to freeze: agents find always a minority among their neighbours to support their state. The model introduced here captures this essential feature showing a clear transition between the two tendencies at some critical connectivity. Depending on the noise, the dynamics of the system can only take place at a precise critical connectivity since, away from this critical point, the system remains in a static phase. When the noise is very small, the critical connectivity becomes very large, and highly connected networks are obtained like the airports network and the Internet. This model may be used as a starting point for understanding the evolution of agents living on networks.
Recent studies have shown that a system composed from several randomly interdependent networks is extremely vulnerable to random failure. However, real interdependent networks are usually not randomly interdependent, rather a pair of dependent nodes are coupled according to some regularity which we coin inter-similarity. For example, we study a system composed from an interdependent world wide port network and a world wide airport network and show that well connected ports tend to couple with well connected airports. We introduce two quantities for measuring the level of inter-similarity betwe…
Networks describe a variety of interacting complex systems in social science, biology and information technology. Usually the nodes of real networks are identified not only by their connections but also by some other characteristics. Examples of characteristics of nodes can be age, gender or nationality of a person in a social network, the abundance of proteins in the cell taking part in a protein-interaction networks or the geographical position of airports that are connected by directed flights. Integrating the information on the connections of each node with the information about its charac…
The information of the Austrian airline flights was collected and quantitatively analyzed by the concepts of complex network. It displays some features of small-world networks, namely large clustering coefficient and small average shortest-path length. The degree distributions of the networks reveal power law behavior with exponent value of 2 $\sim$ 3 for the small degree branch but a flat tail for the large degree branch. Similarly, the flight weight distributions show power-law behavior for the small weight branch. Furthermore, we found that the clustering coefficient $C$, 0.206, of this fli…
We study complex networks with weights, $w_{ij}$, associated with each link connecting node $i$ and $j$. The weights are chosen to be correlated with the network topology in the form found in two real world examples, (a) the world-wide airport network, and (b) the {\it E. Coli} metabolic network. Here $w_{ij} \sim x_{ij} (k_i k_j)^α$, where $k_i$ and $k_j$ are the degrees of nodes $i$ and $j$, $x_{ij}$ is a random number and $α$ represents the strength of the correlations. The case $α> 0$ represents correlation between weights and degree, while $α< 0$ represents anti-correlation and the case $…
In this work we present a model of an air transportation traffic system from the complex network modelling viewpoint. In the network, every node corresponds to a given airport, and two nodes are connected by means of flight routes. Each node is weighted according to its load capacity, and links are weighted according to the Euclidean distance that separates each pair of nodes. Local rules describing the behavior of individual nodes in terms of the surrounding flow have been also modelled, and a random network topology has been chosen in a baseline approach. Numerical simulations describing the…
Based on an expert systems approach, the issue of community detection can be conceptualized as a clustering model for networks. Building upon this further, community structure can be measured through a clustering coefficient, which is generated from the number of existing triangles around the nodes over the number of triangles that can be hypothetically constructed. This paper provides a new definition of the clustering coefficient for weighted networks under a generalized definition of triangles. Specifically, a novel concept of triangles is introduced, based on the assumption that, should th…
Risk and response communication of public agencies through social media played a significant role in the emergence and spread of novel Coronavirus (COVID-19) and such interactions were echoed in other information outlets. This study collected time-sensitive online social media data and analyzed such communication patterns from public health (WHO, CDC), emergency (FEMA), and transportation (FDOT) agencies using data-driven methods. The scope of the work includes a detailed understanding of how agencies communicate risk information through social media during a pandemic and influence community r…
We study the statistical properties of large random networks with specified degree distributions. New techniques are presented for analyzing the structure of social networks. Specifically, we address the question of how many nodes exist at a distance from a given node. We also explore the degree distribution of for nodes at some distance from a given node. Implications for network sampling and diffusion on social networks are described.
We show that strategy independent adaptations of random interaction networks can induce powerful mechanisms, ranging from the Red Queen to group selection, that promote cooperation in evolutionary social dilemmas. These two mechanisms emerge spontaneously as dynamical processes due to deletions and additions of links, which are performed whenever players adopt new strategies and after a certain number of game iterations, respectively. The potency of cooperation promotion, as well as the mechanism responsible for it, can thereby be tuned via a single parameter determining the frequency of link …
We study the behaviour of a Schelling-class system in which a fraction $f$ of spatially-fixed switching agents is introduced. This new model allows for multiple interpretations, including: (i) random, non-preferential allocation (\textit{e.g.} by housing associations) of given, fixed sites in an open residential system, and (ii) superimposition of social and spatial mobility in a closed residential system.\\ We find that the presence of switching agents in a segregative Schelling-type dynamics can lead to the emergence of intermediate patterns (\textit{e.g.} mixture of patches, fuzzy interface…
The social percolation model \citep{solomon-et-00} considers a 2-dimensional regular lattice. Each site is occupied by an agent with a preference $x_{i}$ sampled from a uniform distribution $U[0,1]$. Agents transfer the information about the quality $q$ of a movie to their neighbors only if $x_{i}\leq q$. Information percolates through the lattice if $q=q_{c}=0.593$. -- From a network perspective the percolating cluster can be seen as a random-regular network with $n_{c}$ nodes and a mean degree that depends on $q_{c}$. Preserving these quantities of the random-regular network, a true random n…
We derive analytic expressions for the possibility, probability, and expected size of global spreading events starting from a single infected seed for a broad collection of contagion processes acting on random networks with both directed and undirected edges and arbitrary degree-degree correlations. Our work extends previous theoretical developments for the undirected case, and we provide numerical support for our findings by investigating an example class of networks for which we are able to obtain closed-form expressions.
Estimation of social influence in networks can be substantially biased in observational studies due to homophily and network correlation in exposure to exogenous events. Randomized experiments, in which the researcher intervenes in the social system and uses randomization to determine how to do so, provide a methodology for credibly estimating of causal effects of social behaviors. In addition to addressing questions central to the social sciences, these estimates can form the basis for effective marketing and public policy. In this review, we discuss the design space of experiments to measure…
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory of random graphs with the nonlinear preferential attachment rule and the theory of Erdos-Renyi random graphs. In fact, well-calibrated network graph models and computer experiments with these models would help developers (owners) of the networks to predict their development correctly and to choose effective strategies for controlling network p…
Many online social networks feature restrictive web interfaces which only allow the query of a user's local neighborhood through the interface. To enable analytics over such an online social network through its restrictive web interface, many recent efforts reuse the existing Markov Chain Monte Carlo methods such as random walks to sample the social network and support analytics based on the samples. The problem with such an approach, however, is the large amount of queries often required (i.e., a long "mixing time") for a random walk to reach a desired (stationary) sampling distribution. In t…
In this paper we focus on the beneficial role of random strategies in social sciences by means of simple mathematical and computational models. We briefly review recent results obtained by two of us in previous contributions for the case of the Peter principle and the efficiency of a Parliament. Then, we develop a new application of random strategies to the case of financial trading and discuss in detail our findings about forecasts of markets dynamics.
Social graphs can be easily extracted from Online Social Networks. However these networks are getting larger from day to day. Sampling methods used to evaluate graph information cannot accurately extract graph properties. Furthermore Social Networks are limiting the access to their data, making the crawling process even harder. A novel approach on Random Sampling is proposed, considering both limitation and resources. We evaluate this proposal with 4 different settings on 5 different Test Graphs, crawled directly from Twitter. Through comparing the results we observe the pros and cons of its m…
Recently it has been recognized that many complex social, technological and biological networks have a multilayer nature and can be described by multiplex networks. Multiplex networks are formed by a set of nodes connected by links having different connotations forming the different layers of the multiplex. Characterizing the centrality of the nodes in a multiplex network is a challenging task since the centrality of the node naturally depends on the importance associated to links of a certain type. Here we propose to assign to each node of a multiplex network a centrality called Functional Mu…
Analyzing social graphs with limited data access is challenging for third-party researchers. To address this challenge, a number of algorithms that estimate structural properties via a random walk have been developed. However, most existing algorithms are limited to the estimation of local structural properties. Here we propose a method for restoring the original social graph from the small sample obtained by a random walk. The proposed method generates a graph that preserves the estimates of local structural properties and the structure of the subgraph sampled by a random walk. We compare the…
We investigate consensus formation and the asymptotic consensus times in stylized individual- or agent-based models, in which global agreement is achieved through pairwise negotiations with or without a bias. Considering a class of individual-based models on finite complete graphs, we introduce a coarse-graining approach (lumping microscopic variables into macrostates) to analyze the ordering dynamics in an associated random-walk framework. Within this framework, yielding a linear system, we derive general equations for the expected consensus time and the expected time spent in each macro-stat…
The massive amounts of data that social media generates has facilitated the study of online human behavior on a scale unimaginable a few years ago. At the same time, the much discussed apparent randomness with which people interact online makes it appear as if these studies cannot reveal predictive social behaviors that could be used for developing better platforms and services. We use two large social databases to measure the mutual information entropy that both individual and group actions generate as they evolve over time. We show that user's interaction sequences have strong deterministic …
This paper develops strategic foundations for an important statistical model of random networks with heterogeneous expected degrees. Based on this, we show how social networking services that subtly alter the costs and indirect benefits of relationships can cause large changes in behavior and welfare. In the model, agents who value friends and friends of friends choose how much to socialize, which increases the probabilities of links but is costly. There is a sharp transition from fragmented, sparse equilibrium networks to connected, dense ones when the value of friends of friends crosses a co…
We empirical study the signs' property in the directed signed social networks of Slashdot and Epinions by using an reshuffled approach. Through calculating the entropy $S_{out}$ and the giant component $G$, we find an interesting 90/10 phenomenon: each individual labels his/her neighbors as friends with $90\%$ or foes with $10\%$ uniformly random from the macroscopic perspective. We also find that the entropy $S_{out}$ is suppressed by the non-randomness of labeling sign. Our present work can prove how do the randomness and the non-randomness coexist in human behavior of labeling signs, qualit…
Spectral graph theory gives an algebraical approach to analyze the dynamics of a network by using the matrix that represents the network structure. However, it is not easy for social networks to apply the spectral graph theory because the matrix elements cannot be given exactly to represent the structure of a social network. The matrix element should be set on the basis of the relationship between persons, but the relationship cannot be quantified accurately from obtainable data (e.g., call history and chat history). To get around this problem, we utilize the universality of random matrix with…
How to enable efficient analytics over such data has been an increasingly important research problem. Given the sheer size of such social networks, many existing studies resort to sampling techniques that draw random nodes from an online social network through its restrictive web/API interface. Almost all of them use the exact same underlying technique of random walk - a Markov Chain Monte Carlo based method which iteratively transits from one node to its random neighbor. Random walk fits naturally with this problem because, for most online social networks, the only query we can issue through …
Social networks play a key role in studying various individual and social behaviors. To use social networks in a study, their structural properties must be measured. For offline social networks, the conventional procedure is surveying/interviewing a set of randomly-selected respondents. In many practical applications, inferring the network structure via sampling is too prohibitively costly. There are also applications in which it simply fails. For example, for optimal vaccination or employing influential spreaders for public health interventions, we need to efficiently and quickly target well-…
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterised by these two features. We study how these properties affect random walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the station…
We introduce a homogeneous pair approximation to the Naming Game (NG) model by deriving a six-dimensional ODE for the two-word Naming Game. Our ODE reveals the change in dynamical behavior of the Naming Game as a function of the average degree < k > of an uncorrelated network. This result is in good agreement with the numerical results. We also analyze the extended NG model that allows for presence of committed nodes and show that there is a shift of the tipping point for social consensus in sparse networks.
We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this model captures many generic properties of social networks, including the ``small-world'' properties, skewed degree distribution, and most distinctively the existence of community structures.
We show that in a variant of the Minority Game problem, the agents can reach a state of maximum social efficiency, where the fluctuation between the two choices is minimum, by following a simple stochastic strategy. By imagining a social scenario where the agents can only guess about the number of excess people in the majority, we show that as long as the guess value is sufficiently close to the reality, the system can reach a state of full efficiency or minimum fluctuation. A continuous transition to less efficient condition is observed when the guess value becomes worse. Hence, people can op…
In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walk which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel…
Despite the tremendous advancements in the field of network theory, very few studies have taken weights in the interactions into consideration that emerge naturally in all real world systems. Using random matrix analysis of a weighted social network, we demonstrate the profound impact of weights in interactions on emerging structural properties. The analysis reveals that randomness existing in particular time frame affects the decisions of individuals rendering them more freedom of choice in situations of financial security. While the structural organization of networks remain same throughout …
We study an extension of Axelrod's model for social influence, in which cultural drift is represented as random perturbations, while mass media are introduced by means of an external field. In this scenario, we investigate how the modular structure of social networks affects the propagation of mass media messages across the society. The community structure of social networks is represented by coupled random networks, in which two random graphs are connected by intercommunity links. Considering inhomogeneous mass media fields, we study the conditions for successful message spreading and find a …
This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and represents one of the few options for influencing the behavior of a social context that could be accepted as ethical, could be fully disclosed to members, and does not involve the use of force or of deception. Our research is based on a model of knowledge diffusion applied to a ti…
Recently, we introduced [Physical Review E 100, 022303 (2019)] a stochastic social balance model with Glauber dynamics which takes into account the role of randomness in the individual's behavior. One important finding of our study was a phase transition from a balance state to an imbalance state as the randomness crosses a critical value, which was shown to vanish in the thermodynamic limit. In a recent similar study [K. Malarz and K. Kułakowskiy, (2020), arXiv:2009.10136], it was shown that the critical randomness tends to infinity as the system size diverges. This led the authors to questio…
The sensitivity of networks regarding the removal of vertices has been studied extensively within the last 15 years. A common approach to measure this sensitivity is (i) removing successively vertices by following a specific removal strategy and (ii) comparing the original and the modified network using a specific comparison method. In this paper we apply a wide range of removal strategies and comparison methods in order to study the sensitivity of medium-sized networks from real world and randomly generated networks. In the first part of our study we observe that social networks and web graph…
Culturomics was recently introduced as the application of high-throughput data collection and analysis to the study of human culture. Here we make use of this data by investigating fluctuations in yearly usage frequencies of specific words that describe social and natural phenomena, as derived from books that were published over the course of the past two centuries. We show that the determination of the Hurst parameter by means of fractal analysis provides fundamental insights into the nature of long-range correlations contained in the culturomic trajectories, and by doing so, offers new inter…
Online social networks (OSN) contain extensive amount of information about the underlying society that is yet to be explored. One of the most feasible technique to fetch information from OSN, crawling through Application Programming Interface (API) requests, poses serious concerns over the the guarantees of the estimates. In this work, we focus on making reliable statistical inference with limited API crawls. Based on regenerative properties of the random walks, we propose an unbiased estimator for the aggregated sum of functions over edges and proved the connection between variance of the est…
We consider a social system of interacting heterogeneous agents with learning abilities, a model close to Random Field Ising Models, where the random field corresponds to the idiosyncratic willingness to pay. Given a fixed price, agents decide repeatedly whether to buy or not a unit of a good, so as to maximize their expected utilities. We show that the equilibrium reached by the system depends on the nature of the information agents use to estimate their expected utilities.
Social relationships can be divided into different classes based on the regularity with which they occur and the similarity among them. Thus, rare and somewhat similar relationships are random and cause noise in a social network, thus hiding the actual structure of the network and preventing an accurate analysis of it. In this context, in this paper we propose a process to handle social network data that exploits temporal features to improve the detection of communities by existing algorithms. By removing random interactions, we observe that social networks converge to a topology with more pur…
We describe a Bayesian model for social learning of a random variable in which agents might observe each other over a directed network. The outcomes produced are compared to those from a model in which observations occur randomly over a complete graph. In both cases we observe a nontrivial level of observation which maximizes learning, though individuals have strong incentive to defect from the societal optimum. The implications of such competition over information commons are discussed.
We attempt to identify the different node hubs of a road network using PageRank for preparation for possible random terrorist attacks. The robustness of a road network against such attack is crucial to be studied because it may cripple its connectivity by simply shutting down these hubs. We show the important hubs in a road network based on network structure and propose a model for robustness analysis. By identifying important hubs in a road network, possible preparation schemes may be done earlier to mitigate random terrorist attacks, including defense reinforcement and transportation securit…
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 preserv…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assigning each node a set of items in some random manner and then putting an edge between any two nodes that share a certain number of items. Broadly speaking, our work is about analyzing random intersection…
Many popular measures used in social network analysis, including centrality, are based on the random walk. The random walk is a model of a stochastic process where a node interacts with one other node at a time. However, the random walk may not be appropriate for modeling social phenomena, including epidemics and information diffusion, in which one node may interact with many others at the same time, for example, by broadcasting the virus or information to its neighbors. To produce meaningful results, social network analysis algorithms have to take into account the nature of interactions betwe…
All societies have been much more bipolar over the past few years, particularly after the emergence of online social networks and media. In fact, the gap between the two ends of social spectrum is going to be even deeper after the spread of new media. In this circumstance, social polarization has been a growing concern among socialists and computer science experts because of the detrimental impact which online social networks can have on societies by adding fuel to the fire of extremism. Several types of research were conducted for proposing measures to calculate the controversy level in socia…
Viral marketing is becoming important due to the popularity of online social networks (OSNs). Companies may provide incentives (e.g., via free samples of a product) to a small group of users in an OSN, and these users provide recommendations to their friends, which eventually increases the overall sales of a given product. Nevertheless, this also opens a door for "malicious behaviors": dishonest users may intentionally give misleading recommendations to their friends so as to distort the normal sales distribution. In this paper, we propose a detection framework to identify dishonest users in O…
Motivated by the need for novel robust approaches to modelling the Covid-19 epidemic, this paper treats a population of $N$ individuals as an inhomogeneous random social network (IRSN). The nodes of the network represent different types of individuals and the edges represent significant social relationships. An epidemic is pictured as a contagion process that changes daily, triggered on day $0$ by a seed infection introduced into the population. Individuals' social behaviour and health status are assumed to be random, with probability distributions that vary with their type. First a formulatio…
We analytically determine when a range of abstract social contagion models permit global spreading from a single seed on degree-correlated random networks. We deduce the expected size of the largest vulnerable component, a network's tinderbox-like critical mass, as well as the probability that infecting a randomly chosen individual seed will trigger global spreading. In the appropriate limits, our results naturally reduce to standard ones for models of disease spreading and to the condition for the existence of a giant component. Recent advances in the distributed, infinite seed case allow us …
I find that several models for information sharing in social networks can be interpreted as age-dependent multi-type branching processes, and build them independently following Sewastjanow. This allows to characterize criticality in (real and random) social networks. For random networks, I develop a moment-closure method that handles the high-dimensionality of these models: By modifying the timing of sharing with followers, all users can be represented by a single representative, while leaving the total progeny unchanged. Thus I compute the exact popularity distribution, revealing a viral char…
The random walk is fundamental to modeling dynamic processes on networks. Metrics based on the random walk have been used in many applications from image processing to Web page ranking. However, how appropriate are random walks to modeling and analyzing social networks? We argue that unlike a random walk, which conserves the quantity diffusing on a network, many interesting social phenomena, such as the spread of information or disease on a social network, are fundamentally non-conservative. When an individual infects her neighbor with a virus, the total amount of infection increases. We class…
We study a multi-type SIR epidemic process among a heterogeneous population that interacts through a network. When we base social contact on a random graph with given vertex degrees, we give limit theorems on the fraction of infected individuals. For a given social distancing individual strategies, we establish the epidemic reproduction number $R_0$ which can be used to identify network vulnerability and inform vaccination policies. In the second part of the paper we study the equilibrium of the social distancing game, in which individuals choose their social distancing level according to an a…
Degree distribution of nodes, especially a power law degree distribution, has been regarded as one of the most significant structural characteristics of social and information networks. Node degree, however, only discloses the first-order structure of a network. Higher-order structures such as the edge embeddedness and the size of communities may play more important roles in many online social networks. In this paper, we provide empirical evidence on the existence of rich higherorder structural characteristics in online social networks, develop mathematical models to interpret and model these …
