Related papers: Finite connected components in infinite directed a…
We study the growth of bipartite networks in which the number of nodes in one of the partitions is kept fixed while the other partition is allowed to grow. We study random and preferential attachment as well as combination of both. We…
In this work, we study the propagation of influence and computation in dynamic distributed systems. We focus on broadcasting models under a worst-case dynamicity assumption which have received much attention recently. We drop for the first…
Many real-world networks depend on other networks, often in non-trivial ways, to maintain their functionality. These interdependent "networks of networks" are often extremely fragile. When a fraction $1-p$ of nodes in one network randomly…
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…
The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$…
Motivated by potential applications in power systems, we study a problem of optimizing a sum of $n$ convex functions on dynamic networks of $n$ nodes when each function is known to only a single node. The nodes' variables, while satisfy…
We present exact results for the degree distribution in a directed network model that grows by node duplication (ND). Such models are useful in the study of the structure and growth dynamics of gene regulatory networks and scientific…
In this paper, a class of convex feasibility problems (CFPs) are studied for multi-agent systems through local interactions. The objective is to search a feasible solution to the convex inequalities with some set constraints in a…
It has been recognized that many complex dynamical systems in the real world require a description in terms of multiplex networks, where a set of common, mutually connected nodes belong to distinct network layers and play a different role…
A central issue in complex networks is tolerance to random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures…
We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…
Duplication graphs are graphs that grow by duplication of existing vertices, and are important models of biological networks, including protein-protein interaction networks and gene regulatory networks. Three models of graph growth are…
This paper is concerned with distributed computation of several commonly used centrality measures in complex networks. In particular, we propose deterministic algorithms, which converge in finite time, for the distributed computation of the…
The capability of nodes to broadcast their message to the entire wireless network when nodes employ cooperation is considered. We employ an asymptotic analysis using an extended random network setting and show that the broadcast performance…
The study of epidemic spreading on populations of networked individuals has seen recently a great deal of significant progresses. A common point of all past studies is, however, that there is only one peak of infected density in each single…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
In this paper, a directed network model for world-wide web is presented. The out-degree of the added nodes are supposed to be scale-free and its mean value is $m$. This model exhibits small-world effect, which means the corresponding…
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…