ترغب بنشر مسار تعليمي؟ اضغط هنا

Detecting new edge types in a temporal network model

111   0   0.0 ( 0 )
 نشر من قبل Linyuan Lu
 تاريخ النشر 2021
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Networks representing complex systems in nature and society usually involve multiple interaction types. These types suggest essential information on the interactions between components, but not all of the existing types are usually discovered. Therefore, detecting the undiscovered edge types is crucial for deepening our understanding of the network structure. Although previous studies have discussed the edge label detection problem, we still lack effective methods for uncovering previously-undetected edge types. Here, we develop an effective technique to detect undiscovered new edge types in networks by leveraging a novel temporal network model. Both analytical and numerical results show that the prediction accuracy of our method is perfect when the model networks time parameter approaches infinity. Furthermore, we find that when time is finite, our method is still significantly more accurate than the baseline.



قيم البحث

اقرأ أيضاً

Stars and cycles are basic structures in network construction. The former has been well studied in network analysis, while the latter attracted rare attention. A node together with its neighbors constitute a neighborhood star-structure where the basi c assumption is two nodes interact through their direct connection. A cycle is a closed loop with many nodes who can influence each other even without direct connection. Here we show their difference and relationship in understanding network structure and function. We define two cycle-based node characteristics, namely cycle number and cycle ratio, which can be used to measure a nodes importance. Numerical analyses on six disparate real networks suggest that the nodes with higher cycle ratio are more important to network connectivity, while cycle number can better quantify a node influence of cycle-based spreading than the common star-based node centralities. We also find that an ordinary network can be converted into a hypernetwork by considering its basic cycles as hyperedges, meanwhile, a new matrix called the cycle number matrix is captured. We hope that this paper can open a new direction of understanding both local and global structures of network and its function.
155 - Yihong Hu , Daoli Zhu , Nianqu Zhu 2007
This paper presents an evolution model of weighted networks in which the structural growth and weight dynamics are driven by human behavior, i.e. passenger route choice behavior. Transportation networks grow due to peoples increasing travel demand an d the pattern of growth is determined by their route choice behavior. In airline networks passengers often transfer from a third airport instead of flying directly to the destination, which contributes to the hubs formation and finally the scale-free statistical property. In this model we assume at each time step there emerges a new node with m travel destinations. Then the new node either connects destination directly with the probability p or transfers from a third node with the probability 1-p. The analytical result shows degree and strength both obey power-law distribution with the exponent between 2.33 and 3 depending on p. The weights also obey power-law distribution. The clustering coefficient, degree assortatively coefficient and degree-strength correlation are all dependent on the probability p. This model can also be used in social networks.
271 - X.L.Li , H.Kuang , T.Song 2007
From the macroscopic viewpoint for describing the acceleration behavior of drivers, this letter presents a weighted probabilistic cellular automaton model (the WP model, for short) by introducing a kind of random acceleration probabilistic distributi on function. The fundamental diagrams, the spatio-temporal pattern are analyzed in detail. It is shown that the presented model leads to the results consistent with the empirical data rather well, nonlinear velocity-density relationship exists in lower density region, and a new kind of traffic phenomenon called neo-synchronized flow is resulted. Furthermore, we give the criterion for distinguishing the high-speed and low-speed neo-synchronized flows and clarify the mechanism of this kind of traffic phenomena. In addition, the result that the time evolution of distribution of headways is displayed as a normal distribution further validates the reasonability of the neo-synchronized flow. These findings suggest that the diversity and randomicity of drivers and vehicles has indeed remarkable effect on traffic dynamics.
Spatially embedded networks have attracted increasing attention in the last decade. In this context, new types of network characteristics have been introduced which explicitly take spatial information into account. Among others, edge directionality p roperties have recently gained particular interest. In this work, we investigate the applicability of mean edge direction, anisotropy and local mean angle as geometric characteristics in complex spherical networks. By studying these measures, both analytically and numerically, we demonstrate the existence of a systematic bias in spatial networks where individual nodes represent different shares on a spherical surface, and describe a strategy for correcting for this effect. Moreover, we illustrate the application of the mentioned edge directionality properties to different examples of real-world spatial networks in spherical geometry (with or without the geometric correction depending on each specific case), including functional climate networks, transportation and trade networks. In climate networks, our approach highlights relevant patterns like large-scale circulation cells, the El Ni~{n}o--Southern Oscillation and the Atlantic Ni~{n}o. In an air transportation network, we are able to characterize distinct air transportation zones, while we confirm the important role of the European Union for the global economy by identifying convergent edge directionality patterns in the world trade network.
122 - Tao Zhou , Jie Ren , Matus Medo 2007
The one-mode projecting is extensively used to compress the bipartite networks. Since the one-mode projection is always less informative than the bipartite representation, a proper weighting method is required to better retain the original informatio n. In this article, inspired by the network-based resource-allocation dynamics, we raise a weighting method, which can be directly applied in extracting the hidden information of networks, with remarkably better performance than the widely used global ranking method as well as collaborative filtering. This work not only provides a creditable method in compressing bipartite networks, but also highlights a possible way for the better solution of a long-standing challenge in modern information science: How to do personal recommendation?
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا