Time varying networks and the weakness of strong ties.
Ontology highlight
ABSTRACT:
SUBMITTER: Karsai M
PROVIDER: S-EPMC3918922 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Network modeling plays a critical role in identifying statistical regularities and structural principles common to many systems. The large majority of recent modeling approaches are connectivity driven. The structural patterns of the network are at the basis of the mechanisms ruling the network formation. Connectivity driven models necessarily provide a time-aggregated representation that may fail to describe the instantaneous and fluctuating dynamics of many networks. We address this challenge by defining the activity potential, a time invariant function characterizing the agents' interactions and constructing an activity driven model capable of encoding the instantaneous time description of the network dynamics. The model provides an explanation of structural features such as the presence of hubs, which simply originate from the heterogeneous activity of agents. Within this framework, highly dynamical networks can be described analytically, allowing a quantitative discussion of the biases induced by the time-aggregated representations in the analysis of dynamical processes.
| S-EPMC3384079 | biostudies-other
Project description:Weak ties are thought to facilitate the diffusion of information through social networks because of their tendency to span otherwise distant subgroups. However, this logic assumes that weak relationships have the same capacity to transmit information as those that are strong. I argue that weak ties, especially the kind that span subgroups, are often also lower-capacity. Due to a lack of trust, an unwillingness to share benefits, or a limited ability to understand one another, an individual is less likely to share novel information across these ties. In standard models of diffusion imported from epidemiology, even reduced-capacity links would still aid diffusion. However, accounting for reduced capacity in a new model of diffusion that captures realistic features of information sharing in human groups, I demonstrate that hesitation to share across weak links substantially impedes overall diffusion. Moreover, I show that the addition of weak ties to a social network can strictly reduce the extent and speed of information diffusion. Increasing density by adding weak ties can make diffusion strictly worse by crowding out the use of higher-capacity ties. I present the results of simulated information diffusion on both hypothetical networks generated to possess varying levels of density and homophily, as well as on real social networks in two Ugandan villages shown to be responsible for face-to-face information sharing.
| S-EPMC6214243 | biostudies-other
Project description:We investigate the effects of modular and temporal connectivity patterns on epidemic spreading. To this end, we introduce and analytically characterise a model of time-varying networks with tunable modularity. Within this framework, we study the epidemic size of Susceptible-Infected-Recovered, SIR, models and the epidemic threshold of Susceptible-Infected-Susceptible, SIS, models. Interestingly, we find that while the presence of tightly connected clusters inhibits SIR processes, it speeds up SIS phenomena. In this case, we observe that modular structures induce a reduction of the threshold with respect to time-varying networks without communities. We confirm the theoretical results by means of extensive numerical simulations both on synthetic graphs as well as on a real modular and temporal network.
| S-EPMC5799280 | biostudies-literature
Project description:Spatial systems that experience congestion can be modeled as weighted networks whose weights dynamically change over time with the redistribution of flows. This is particularly true for urban transportation networks. The aim of this work is to find appropriate network measures that are able to detect critical zones for traffic congestion and bottlenecks in a transportation system. We propose for both single and multi-layered networks a path-based measure, called dynamical efficiency, which computes the travel time differences under congested and free-flow conditions. The dynamical efficiency quantifies the reachability of a location embedded in the whole urban traffic condition, in lieu of a myopic description based on the average speed of single road segments. In this way, we are able to detect the formation of congestion seeds and visualize their evolution in time as well-defined clusters. Moreover, the extension to multilayer networks allows us to introduce a novel measure of centrality, which estimates the expected usage of inter-modal junctions between two different transportation means. Finally, we define the so-called dilemma factor in terms of number of alternatives that an interconnected transportation system offers to the travelers in exchange for a small increase in travel time. We find macroscopic relations between the percentage of extra-time, number of alternatives and level of congestion, useful to quantify the richness of trip choices that a city offers. As an illustrative example, we show how our methods work to study the real network of a megacity with probe traffic data.
| S-EPMC8630039 | biostudies-literature
Project description:A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase oscillators in which the links mediating the interactions are constantly rearranged with a characteristic timescale and, possibly, an extremely low instantaneous connectivity. We show that with strong coupling and sufficiently fast rewiring the network reaches partial synchronization even in the vanishing connectivity limit. In particular, we provide an approximate analytical argument, based on the comparison between the different characteristic timescales of our system in the low connectivity regime, which is able to predict the transition to synchronization threshold with satisfactory precision beyond the formal fast rewiring limit. We interpret our results as a qualitative mechanism for emergence of consensus in social communities. In particular, our result suggest that groups of individuals are capable of aligning their opinions under extremely sparse exchanges of views, which is reminiscent of fast communications that take place in the modern social media. Our results may also be relevant to characterize the onset of collective behavior in engineered systems of mobile units with limited wireless capabilities.
| S-EPMC6629696 | biostudies-literature
Project description:Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memoryless Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.
| S-EPMC5964206 | biostudies-literature
Project description:While we know that adolescents tend to befriend peers who share their race and gender, it is unclear whether patterns of homophily vary according to the strength, intimacy, or connectedness of these relationships. By applying valued exponential random graph models to a sample of 153 adolescent friendship networks, I test whether tendencies towards same-race and same-gender friendships differ for strong versus weak relational ties. In nondiverse, primarily white networks, weak ties are more likely to connect same-race peers, while racial homophily is not associated with the formation of stronger friendships. As racial diversity increases, however, strong ties become more likely to connect same-race peers, while weaker bonds are less apt to be defined by racial homophily. Gender homophily defines the patterns of all friendship ties, but these tendencies are more pronounced for weaker connections. My results highlight the empirical value of considering tie strength when examining social processes in adolescent networks.
| S-EPMC10104515 | biostudies-literature
Project description:Time-varying networks describe a wide array of systems whose constituents and interactions evolve over time. They are defined by an ordered stream of interactions between nodes, yet they are often represented in terms of a sequence of static networks, each aggregating all edges and nodes present in a time interval of size ?t. In this work we quantify the impact of an arbitrary ?t on the description of a dynamical process taking place upon a time-varying network. We focus on the elementary random walk, and put forth a simple mathematical framework that well describes the behavior observed on real datasets. The analytical description of the bias introduced by time integrating techniques represents a step forward in the correct characterization of dynamical processes on time-varying graphs.
| S-EPMC3801130 | biostudies-literature
Project description:Network modeling is a flexible mathematical structure that enables to identify statistical regularities and structural principles hidden in complex systems. The majority of recent driving forces in modeling complex networks are originated from activity, in which an activity potential of a time invariant function is introduced to identify agents' interactions and to construct an activity-driven model. However, the new-emerging network evolutions are already deeply coupled with not only the explicit factors (e.g. activity) but also the implicit considerations (e.g. security and trust), so more intrinsic driving forces behind should be integrated into the modeling of time varying networks. The agents undoubtedly seek to build a time-dependent trade-off among activity, security, and trust in generating a new connection to another. Thus, we reasonably propose the Activity-Security-Trust (AST) driven model through synthetically considering the explicit and implicit driving forces (e.g. activity, security, and trust) underlying the decision process. AST-driven model facilitates to more accurately capture highly dynamical network behaviors and figure out the complex evolution process, allowing a profound understanding of the effects of security and trust in driving network evolution, and improving the biases induced by only involving activity representations in analyzing the dynamical processes.
| S-EPMC4758040 | biostudies-literature
Project description:The neuronal synchronous discharging may cause an epileptic seizure. Currently, most of the studies conducted to investigate the mechanism of epilepsy are based on EEGs or functional magnetic resonance imaging (fMRI) recorded during the ictal discharging or the resting-state, and few studies have probed into the dynamic patterns during the inter-ictal discharging that are much easier to record in clinical applications. Here, we propose a time-varying network analysis based on adaptive directed transfer function to uncover the dynamic brain network patterns during the inter-ictal discharging. In addition, an algorithm based on the time-varying outflow of information derived from the network analysis is developed to detect the epileptogenic zone. The analysis performed revealed the time-varying network patterns during different stages of inter-ictal discharging; the epileptogenic zone was activated prior to the discharge onset then worked as the source to propagate the activity to other brain regions. Consistence between the epileptogenic zones detected by our proposed approach and the actual epileptogenic zones proved that time-varying network analysis could not only reveal the underlying neural mechanism of epilepsy, but also function as a useful tool in detecting the epileptogenic zone based on the EEGs in the inter-ictal discharging.
| S-EPMC5563307 | biostudies-literature