Complex network view of evolving manifolds

Gelation in input-driven aggregation

We investigate irreversible aggregation processes driven by a source of small mass clusters. In the spatially homogeneous situation, a well-mixed system consists of clusters of various masses whose concentrations evolve according to an infinite system of nonlinear ordinary differential equations. We focus on the cluster mass distribution in the long-time limit. An input-driven aggregation with rates proportional to the product of merging partners undergoes a percolation transition. We examine this process analytically and numerically. There are two theoretical schemes and two natural ways of numerical integration on the level of a truncated system with a finite number of equations. After the percolation transition, the behavior depends on the adopted approach: The giant component quickly engulfs the entire system (Flory approach), or a nontrivial stationary mass distribution emerges (Stockmayer approach). We also outline a generalization to ternary aggregation.

Identifying important nodes in complex networks based on extended degree and E-shell hierarchy decomposition

The identification of important nodes is a hot topic in complex networks. Many methods have been proposed in different fields for solving this problem. Most previous work emphasized the role of a single feature and, as a result, rarely made full use of multiple items. This paper proposes a new method that utilizes multiple characteristics of nodes for the evaluation of their importance. First, an extended degree is defined to improve the classical degree. And E-shell hierarchy decomposition is put forward for determining nodes' position through the network's hierarchical structure. Then, based on the combination of these two components, a hybrid characteristic centrality and its extended version are proposed for evaluating the importance of nodes. Extensive experiments are conducted in six real networks, and the susceptible-infected-recovered model and monotonicity criterion are introduced to test the performance of the new approach. The comparison results demonstrate that the proposed new approach exposes more competitive advantages in both accuracy and resolution compared to the other five approaches.

Hysteresis and synchronization processes of Kuramoto oscillators on high-dimensional simplicial complexes with competing simplex-encoded couplings

Recent studies of dynamic properties in complex systems point out the profound impact of hidden geometry features known as simplicial complexes, which enable geometrically conditioned many-body interactions. Studies of collective behaviors on the controlled-structure complexes can reveal the subtle interplay of geometry and dynamics. Here we investigate the phase synchronization (Kuramoto) dynamics under the competing interactions embedded on 1-simplex (edges) and 2-simplex (triangles) faces of a homogeneous four-dimensional simplicial complex. Its underlying network is a 1-hyperbolic graph with the assortative correlations among the node's degrees and the spectral dimension that exceeds d_{s}=4. By numerically solving the set of coupled equations for the phase oscillators associated with the network nodes, we determine the time-averaged system's order parameter to characterize the synchronization level. Our results reveal a variety of synchronization and desynchronization scenarios, including partially synchronized states and nonsymmetrical hysteresis loops, depending on the sign and strength of the pairwise interactions and the geometric frustrations promoted by couplings on triangle faces. For substantial triangle-based interactions, the frustration effects prevail, preventing the complete synchronization and the abrupt desynchronization transition disappears. These findings shed new light on the mechanisms by which the high-dimensional simplicial complexes in natural systems, such as human connectomes, can modulate their native synchronization processes.

Effect of volume growth on the percolation threshold in random directed acyclic graphs with a given degree distribution

In every network, a distance between a pair of nodes can be defined as the length of the shortest path connecting these nodes, and therefore one may speak of a ball, its volume, and how it grows as a function of the radius. Spatial networks tend to feature peculiar volume scaling functions, as well as other topological features, including clustering, degree-degree correlation, clique complexes, and heterogeneity. Here we investigate a nongeometric random graph with a given degree distribution and an additional constraint on the volume scaling function. We show that such structures fall into the category of m-colored random graphs and study the percolation transition by using this theory. We prove that for a given degree distribution the percolation threshold for weakly connected components is not affected by the volume growth function. Additionally, we show that the size of the giant component and the cyclomatic number are not affected by volume scaling. These findings may explain the surprisingly good performance of network models that neglect volume scaling. Even though this paper focuses on the implications of the volume growth, the model is generic and might lead to insights in the field of random directed acyclic graphs and their applications.

Dynamical Triangulation Induced by Quantum Walk

We present the single-particle sector of a quantum cellular automaton, namely a quantum walk, on a simple dynamical triangulated 2 - manifold. The triangulation is changed through Pachner moves, induced by the walker density itself, allowing the surface to transform into any topologically equivalent one. This model extends the quantum walk over triangular grid, introduced in a previous work, by one of the authors, whose space-time limit recovers the Dirac equation in (2+1)-dimensions. Numerical simulations show that the number of triangles and the local curvature grow as t α e − β t 2 , where α and β parametrize the way geometry changes upon the local density of the walker, and that, in the long run, flatness emerges. Finally, we also prove that the global behavior of the walker, remains the same under spacetime random fluctuations.

Spectral properties of hyperbolic nanonetworks with tunable aggregation of simplexes

Cooperative self-assembly is a ubiquitous phenomenon found in natural systems which is used for designing nanostructured materials with new functional features. Its origin and mechanisms, leading to improved functionality of the assembly, have attracted much attention from researchers in many branches of science and engineering. These complex structures often come with hyperbolic geometry; however, the relation between the hyperbolicity and their spectral and dynamical properties remains unclear. Using the model of aggregation of simplexes introduced by Šuvakov et al. [Sci. Rep. 8, 1987 (2018)2045-232210.1038/s41598-018-20398-x], here we study topological and spectral properties of a large class of self-assembled structures or nanonetworks consisting of monodisperse building blocks (cliques of size n=3,4,5,6) which self-assemble via sharing the geometrical shapes of a lower order. The size of the shared substructure is tuned by varying the chemical affinity ν such that for significant positive ν sharing the largest face is the most probable, while for ν<0, attaching via a single node dominates. Our results reveal that, while the parameter of hyperbolicity remains δ_{max}=1 across the assemblies, their structure and spectral dimension d_{s} vary with the size of cliques n and the affinity when ν≥0. In this range, we find that d_{s}>4 can be reached for n≥5 and sufficiently large ν. For the aggregates of triangles and tetrahedra, the spectral dimension remains in the range d_{s}∈[2,4), as well as for the higher cliques at vanishing affinity. On the other end, for ν<0, we find d_{s}≂1.57 independently on n. Moreover, the spectral distribution of the normalized Laplacian eigenvalues has a characteristic shape with peaks and a pronounced minimum, representing the hierarchical architecture of the simplicial complexes. These findings show how the structures compatible with complex dynamical properties can be assembled by controlling the higher-order connectivity among the building blocks.

Synchronization in network geometries with finite spectral dimension

Recently there is a surge of interest in network geometry and topology. Here we show that the spectral dimension plays a fundamental role in establishing a clear relation between the topological and geometrical properties of a network and its dynamics. Specifically we explore the role of the spectral dimension in determining the synchronization properties of the Kuramoto model. We show that the synchronized phase can only be thermodynamically stable for spectral dimensions above four and that phase entrainment of the oscillators can only be found for spectral dimensions greater than two. We numerically test our analytical predictions on the recently introduced model of network geometry called complex network manifolds, which displays a tunable spectral dimension.