Related papers: Nearest-neighbour directed random hyperbolic graph…
Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient. Other properties like a giant component, the small world…
For real world systems, nonuniform medium is ubiquitous. Therefore, we investigate the diffusion-limited-aggregation process on a two dimensional directed small-world network instead of regular lattice. The network structure is established…
This paper describes how realistic neuromorphic networks can have their connectivity properties fully characterized in analytical fashion. By assuming that all neurons have the same shape and are regularly distributed along the…
One of the defining features of complex networks is the connectivity properties that we observe emerging from local interactions. Recently, hypergraphs have emerged as a versatile tool to model networks with non-dyadic, higher-order…
A probabilistic generative network model with $n$ nodes and $m$ overlapping layers is obtained as a superposition of $m$ mutually independent Bernoulli random graphs of varying size and strength. When $n$ and $m$ are large and of the same…
We numerically investigate the robustness of networks with degree-degree correlations between nodes separated by distance $l=2$ in terms of shortest path length. The degree-degree correlation between the $l$-th nearest neighbors can be…
Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric…
Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like Trophic Analysis and non-normality. We propose a simple growing network model where the…
Hyperbolic models are remarkably good at reproducing the scale-free, highly clustered and small-world properties of networks representing real complex systems in a very simple framework. Here we show that for the popularity-similarity…
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a…
Hyperbolicity is a property of a graph that may be viewed as being a "soft" version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic…
Hyperbolic geometry has emerged as a powerful tool for modeling complex, structured data, particularly where hierarchical or tree-like relationships are present. By enabling embeddings with lower distortion, hyperbolic neural networks offer…
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,…
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed…
While degree correlations are known to play a crucial role for spreading phenomena in networks, their impact on the propagation speed has hardly been understood. Here we investigate a tunable spreading model on scale-free networks and show…
The average nearest neighbor degree (ANND) of a node of degree $k$ is widely used to measure dependencies between degrees of neighbor nodes in a network. We formally analyze ANND in undirected random graphs when the graph size tends to…
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on…
Although most of the real networks contain a mixture of directed and bidirectional (reciprocal) connections, the reciprocity $r$ has received little attention as a subject of theoretical understanding. We study the expected reciprocity of…
Real networks are complex dynamical systems, evolving over time with the addition and deletion of nodes and links. Currently, there exists no principled mathematical theory for their dynamics -- a grand-challenge open problem. Here, we show…
Hypergraphs, graph generalizations where edges are conglomerates of $r$ nodes called hyperedges of rank $r\geq 2$, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree…