In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

Three classes of models for time series on acyclic directed graphs are considered. At first a review of tree-structured models constructed from a nested partitioning of the observation interval is given. This nested partitioning leads to several resolution scales. The concept of mass balance...

Consensus problems for high-order continuous-time linear time-invariant swarm systems with directed interaction topologies are investigated. A new method to deal with consensus problems is proposed based on state space decomposition. Two subspaces of a complex space are introduced, namely a...

This paper proposes a network model to understand the scale-free property of directed networks. The proposed model assigns two intrinsic variables (incoming and outgoing weights) to every node. A directed link is established from node i to node j if the sum of the outgoing weight of node i and...

Recently, the researches on pinning control of complex dynamical networks have mainly focused on such networks with very specific coupling schemes (e.g., symmetric coupling, uniform coupling and linear coupling). However, most real networks often consist of local units, which interact with each...