Magnetic graph matrices are powerful tools for modeling quantum systems and directed networks, but their application in network analysis has been limited by a lack of combinatorial understanding. We ...

According to mathematical legend, Peter Sarnak and Noga Alon made a bet about optimal graphs in the late 1980s. They’ve now both been proved wrong. It started with a bet. In the late 1980s, at a ...

Abstract: Hierarchical clustering is able to provide partitions of different granularity levels. However, most existing hierarchical clustering techniques perform clustering in the original feature ...

Abstract: The popular Random Dot Product Graph (RDPG) generative model postulates that each node has an associated (latent) vector, and the probability of existence of an edge between two nodes is ...

Copyright held by the owner/author(s). This open access article is distributed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.

Since the financial crisis of 2008, the network analysis of financial systems has attracted a lot of attention. In this paper, we analyze the global banking network via the method of Random Matrix ...

We proposed a fast ellipse detection method based on arc adjacency matrix. We have successfully used this method in some applications, such as satellite tracking, UGV guidance and pose estimation. We ...