اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEdge corona product as an approach to modeling complex simplical networks
104
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many graph products have been applied to generate complex networks with striking properties observed in real-world systems. In this paper, we propose a simple generative model for simplicial networks by iteratively using edge corona product. We present a comprehensive analysis of the structural properties of the network model, including degree distribution, diameter, clustering coefficient, as well as distribution of clique sizes, obtaining explicit expressions for these relevant quantities, which agree with the behaviors found in diverse real networks. Moreover, we obtain exact expressions for all the eigenvalues and their associated multiplicities of the normalized Laplacian matrix, based on which we derive explicit formulas for mixing time, mean hitting time and the number of spanning trees. Thus, as previous models generated by other graph products, our model is also an exactly solvable one, whose structural properties can be analytically treated. More interestingly, the expressions for the spectra of our model are also exactly determined, which is sharp contrast to previous models whose spectra can only be given recursively at most. This advantage makes our model a good test-bed and an ideal substrate network for studying dynamical processes, especially those closely related to the spectra of normalized Laplacian matrix, in order to uncover the influences of simplicial structure on these processes.
قيم البحث
اقرأ أيضاً
Recently, real world networks having constant/shrinking diameter along with power-law degree distribution are observed and investigated in literature. Taking an inspiration from these findings, we propose a deterministic complex network model, which
we call Self-Coordinated Corona Graphs (SCCG), based on the corona product of graphs. As it has also been established that self coordination/organization of nodes gives rise to emergence of power law in degree distributions of several real networks, the networks in the proposed model are generated by the virtue of self coordination of nodes in corona graphs. Alike real networks, the SCCG inherit motifs which act as the seed graphs for the generation of SCCG. We also analytically prove that the power law exponent of SCCG is approximately $2$ and the diameter of SCCG produced by a class of motifs is constant. Finally, we compare different properties of the proposed model with that of the BA and Pseudofractal scale-free models for complex networks.
Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. It has been suggested that finding an MIS is equivalent to computing a maximum matching of the network, where the unmat
ched nodes constitute an MIS. However, maximum matching of a network is often not unique, and finding all MISs may provide deep insights to the controllability of the network. Finding all possible input nodes, which form the union of all MISs, is computationally challenging for large networks. Here we present an efficient enumerative algorithm for the problem. The main idea is to modify a maximum matching algorithm to make it efficient for finding all possible input nodes by computing only one MIS. We rigorously proved the correctness of the new algorithm and evaluated its performance on synthetic and large real networks. The experimental results showed that the new algorithm ran several orders of magnitude faster than the existing method on large real networks.
We introduce Forman-Ricci curvature and its corresponding flow as characteristics for complex networks attempting to extend the common approach of node-based network analysis by edge-based characteristics. Following a theoretical introduction and mat
hematical motivation, we apply the proposed network-analytic methods to static and dynamic complex networks and compare the results with established node-based characteristics. Our work suggests a number of applications for data mining, including denoising and clustering of experimental data, as well as extrapolation of network evolution.
Networks and their higher order generalizations, such as hypernetworks or multiplex networks are ever more popular models in the applied sciences. However, methods developed for the study of their structural properties go little beyond the common nam
e and the heavy reliance of combinatorial tools. We show that, in fact, a geometric unifying approach is possible, by viewing them as polyhedral complexes endowed with a simple, yet, the powerful notion of curvature - the Forman Ricci curvature. We systematically explore some aspects related to the modeling of weighted and directed hypernetworks and present expressive and natural choices involved in their definitions. A benefit of this approach is a simple method of structure-preserving embedding of hypernetworks in Euclidean N-space. Furthermore, we introduce a simple and efficient manner of computing the well established Ollivier-Ricci curvature of a hypernetwork.
Various coarse-grained models have been proposed to study the spreading dynamics in the network. A microscopic theory is needed to connect the spreading dynamics with the individual behaviors. In this letter, we unify the description of different spr
eading dynamics on complex networks by decomposing the microscopic dynamics into two basic processes, the aging process and the contact process. A microscopic dynamical equation is derived to describe the dynamics of individual nodes on the network. The hierarchy of a duration coarse-grained (DCG) approach is obtained to study duration-dependent processes, where the transition rates depend on the duration of an individual node on a state. Applied to the epidemic spreading, such formalism is feasible to reproduce different epidemic models, e.g., the susceptible-infected-recovered and the susceptible-infected-susceptible models, and to associate with the corresponding macroscopic spreading parameters with the microscopic transition rate. The DCG approach enables us to obtain the steady state of the general SIS model with arbitrary duration-dependent recovery and infection rates. The current hierarchical formalism can also be used to describe the spreading of information and public opinions, or to model a reliability theory in networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
