Laplacian Global Similarity of Networks
نویسندگان
چکیده
In this paper, we describe a methodology for comparing networks represented as weighted graphs. The key idea is to associate a probability density function derived from the graph Laplacian, and then compute the Wasserstein distance between the derived densities of the respective graphs. This has wide applications to various networks including biological and financial.
منابع مشابه
Link Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملThe Laplacian spectrum of neural networks
The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these "conventional" graph metrics, the eigenvalue spectrum of the normalized Laplacian d...
متن کاملMulti-Focus Image Fusion in DCT Domain using Variance and Energy of Laplacian and Correlation Coefficient for Visual Sensor Networks
The purpose of multi-focus image fusion is gathering the essential information and the focused parts from the input multi-focus images into a single image. These multi-focus images are captured with different depths of focus of cameras. A lot of multi-focus image fusion techniques have been introduced using considering the focus measurement in the spatial domain. However, the multi-focus image ...
متن کاملAn investigation of synchrony in transport networks
The cumulative degree distributions of transport networks, such as air transportation networks and respiratory neuronal networks, follow power laws. The significance of power laws with respect to other network performance measures, such as throughput and synchronization, remains an open question. Evolving methods for the analysis and design of air transportation networks must be able to address...
متن کاملLaplacian Maximum Margin Criterion for Image Recognition
Previous works have demonstrated that Laplacian embedding can well preserve the local intrinsic structure. However, it ignores the diversity and may impair the local topology of data. In this paper, we build an objective function to learn the local intrinsic structure that characterizes both the local similarity and diversity of data, and then combine it with global structure to build a scatter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016