Related papers: Directed network modules
First principle network models are crucial to make sense of the intricate topology of real complex networks. While modeling efforts have been quite successful in undirected networks, generative models for networks with asymmetric…
Directed and heterogeneous hypergraphs capture directional higher-order interactions with intrinsically asymmetric functional dependencies among nodes. As a result, damage to certain nodes can suppress entire hyperedges, whereas failure of…
Connectivity and reachability on temporal networks, which can describe the spreading of a disease, decimation of information or the accessibility of a public transport system over time, have been among the main contemporary areas of study…
How do vertices exert influence in graph data? We develop a framework for edge clustering, a new method for exploratory data analysis that reveals how both vertices and edges collaboratively accomplish directed influence in graphs,…
The study of triangles in graphs is a standard tool in network analysis, leading to measures such as the \emph{transitivity}, i.e., the fraction of paths of length $2$ that participate in triangles. Real-world networks are often directed,…
Network structures are extremely important to the study of political science. Much of the data in its subfields are naturally represented as networks. This includes trade, diplomatic and conflict relationships. The social structure of…
Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often…
This paper presents several algorithms for hashing directed graphs. The algorithms given are capable of hashing entire graphs as well as assigning hash values to specific nodes in a given graph. The notion of node symmetry is made precise…
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…
Multilayer networks have been found to be prone to abrupt cascading failures under random and targeted attacks, but most of the targeting algorithms proposed so far have been mainly tested on uncorrelated systems. Here we show that the size…
In this paper we define a directed percolation over Erdos-Renyi graphs and derive weak limit results for the resulting stochastic process.
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…
A network embedding consists of a vector representation for each node in the network. Its usefulness has been shown in many real-world application domains, such as social networks and web networks. Directed networks with text associated…
The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the…
We study the structural properties of the neural network of the C.elegans (worm) from a directed graph point of view. The Google matrix analysis is used to characterize the neuron connectivity structure and node classifications are…
K-clique percolation is an overlapping community finding algorithm which extracts particular structures, comprised of overlapping cliques, from complex networks. While it is conceptually straightforward, and can be elegantly expressed using…
We study the dynamics of diffusion processes acting on directed multiplex networks, i.e., coupled multilayer networks where at least one layer consists of a directed graph. We reveal that directed multiplex networks may exhibit a faster…
Two different types of directed networks are investigated, transcriptional regulation networks and neural networks. The directed network structure are studied and also shown to reflect the different processes taking place on the networks.…
A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set. We solve this hard combinatorial optimization problem…
In physics, biology and engineering, network systems abound. How does the connectivity of a network system combine with the behavior of its individual components to determine its collective function? We approach this question for networks…