Related papers: The second will be first: competition on directed …

Competition between synapses arises in some forms of correlation-based plasticity. Here we propose a game theory-inspired model of synaptic interactions whose dynamics is driven by competition between synapses in their weak and strong…

This paper proposes a simple procedure to decide whether the empirically-observed adjacency or weights matrix, which characterizes the graph underlying a socio-economic network, is sufficiently symmetric (respectively, asymmetric) to…

The lack of large-scale, continuously evolving empirical data usually limits the study of networks to the analysis of snapshots in time. This approach has been used for verification of network evolution mechanisms, such as preferential…

Analyzing and characterizing the differences between networks is a fundamental and challenging problem in network science. Previously, most network comparison methods that rely on topological properties have been restricted to measuring…

In real world social networks, there are multiple cascades which are rarely independent. They usually compete or cooperate with each other. Motivated by the reinforcement theory in sociology we leverage the fact that adoption of a user to…

Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this supplementary material for the paper "Navigability of interconnected networks…

In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…

We investigate a novel approach to resilient distributed optimization with quadratic costs in a multi-agent system prone to unexpected events that make some agents misbehave. In contrast to commonly adopted filtering strategies, we draw…

Identifying the nodes that must be directly controlled to steer a network along a desired trajectory remains an open problem for digraphs, and even more so for hypergraphs. In this manuscript, we investigate network systems coupled via…

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…

Numerous problems of both theoretical and practical interest are related to finding shortest (or otherwise optimal) paths in networks, frequently in the presence of some obstacles or constraints. A somewhat related class of problems focuses…

We consider a data aggregating wireless network where all nodes have data to send to a single destination node, the sink. We consider a linear placement of nodes with the sink at one end. The nodes communicate directly to the sink (single…

Controlling complex networked systems to a desired state is a key research goal in contemporary science. Despite recent advances in studying the impact of network topology on controllability, a comprehensive understanding of the synergistic…

We study the dominating set problem in an online setting. An algorithm is required to guarantee competitiveness against an adversary that reveals the input graph one node at a time. When a node is revealed, the algorithm learns about the…

We present and analyze a topologically induced transition from ordered, synchronized to disordered dynamics in directed networks of oscillators. The analysis reveals where in the space of networks this transition occurs and its underlying…

Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics of processes executed on the network. The analysis, discrimination, and synthesis of…

We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…

We show analytically and numerically that the appearance of lumps and gaps in the distribution of n competing species along a niche axis is a robust phenomenon whenever the finiteness of the niche space is taken into account. In this case…

Competitive systems can exhibit both hierarchical (transitive) and cyclic (intransitive) structures. Despite theoretical interest in cyclic competition, which offers richer dynamics, and occupies a larger subset of the space of possible…

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…