相关论文: Systematic enumeration of crystalline networks wit…
This work studies the limitations of uniquely identifying the structure (i.e., topology) of a networked linear system from partial measurements of its nodal dynamics. In general, many networks can be consistent with these measurements; this…
A novel Genetic Algorithm is described that is suitable for determining the global minimum energy configurations of crystal structures and which can also be used as a polymorph search technique. This algorithm requires no prior assumptions…
Network inference has been extensively studied in several fields, such as systems biology and social sciences. Learning network topology and internal dynamics is essential to understand mechanisms of complex systems. In particular, sparse…
Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function.…
A complex network is a condensed representation of the relational topological framework of a complex system. A main reason for the existence of such networks is the transmission of items through the entities of these complex systems. Here,…
Crystalline materials can form different structural arrangements (i.e. polymorphs) with the same chemical composition, exhibiting distinct physical properties depending on how they were synthesized or the conditions under which they…
Inferring tie strengths (strong vs. weak) is a core task in network analysis, often guided by the Strong Triadic Closure (STC) principle. In multilayer networks, such as social platforms or biological systems, applying STC independently to…
The website reductions.network serves as a comprehensive database for exploring problems and reductions between them. It presents several complexity classes in the form of an interconnected graph where problems are represented as vertices,…
The dynamics of complex networks, being a current hot topic of many scientific fields, is often coded through the corresponding Laplacian matrix. The spectrum of this matrix carries the main features of the networks' dynamics. Here we…
Due to the flexibility of C and N atoms in forming different types of bonds, the prediction of new two-dimensional (2D) carbon nitrides is a hot topic in the field of carbon-based materials. Using first-principles calculations, we propose…
We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality…
We introduce a systematic method for constructing a class of lattice structures that we call ``partial line graphs''.In tight-binding models on partial line graphs, energy bands with flat energy dispersions emerge.This method can be applied…
Triadic subgraph analysis reveals the structural features in power networks based on higher-order connectivity patterns. Power networks have a unique triad significance profile (TSP) of the five unidirectional triadic subgraphs in…
An overview is given of recent advances in experimental and theoretical understanding of optical properties of ultra-thin crystal structures (graphene, phosphorene, silicene, MoS2, MoSe2 , WS2 , WSe2 , h-AlN, h-BN, fluorographene,…
This paper addresses the problem of identifying the graph structure of a dynamical network using measured input/output data. This problem is known as topology identification and has received considerable attention in recent literature. Most…
Graph convolutional network (GCN) is a powerful model studied broadly in various graph structural data learning tasks. However, to mitigate the over-smoothing phenomenon, and deal with heterogeneous graph structural data, the design of GCN…
We present a fine-grained approach to identify clusters and perform percolation analysis in a 2D lattice system. In our approach, we develop an algorithm based on the linked-list data structure whereby the members of a cluster are nodes of…
Deep convolutional neural networks achieve remarkable visual recognition performance, at the cost of high computational complexity. In this paper, we have a new design of efficient convolutional layers based on three schemes. The 3D…
Modern scanning probe techniques, like scanning tunneling microscopy (STM), provide access to a large amount of data encoding the underlying physics of quantum matter. In this work, we analyze how convolutional neural networks (CNN) can be…
Classification of large and dense networks based on topology is very difficult due to the computational challenges of extracting meaningful topological features from real-world networks. In this paper we present a computationally tractable…