Topic
Network theory
About: Network theory is a research topic. Over the lifetime, 2257 publications have been published within this topic receiving 109864 citations.
Papers published on a yearly basis
Papers
More filters
••
01 Aug 2019TL;DR: It is proved that the software system can be abstracted into the form of algebraic component expressions, and can find algebraic components that may have vulnerabilities based on the eigenvalues of complex networks.
Abstract: With the deepening of research on network theory, scientists have gradually begun to adopt complex networks to look at complex systems in nature. A complex network is a network of a large number of closely related and interacting units. This paper believes that each component of the software can be abstracted into various algebraic components. These algebraic components are assembled into a software system. Its assembly process satisfies the configuration and fit characteristics in the topological space. Using algebraic components as the vertices of complex network graphs, the connection relationship between them is taken as the edge of the complex network graph. Using this new perspective, the software system is regarded as a complex network graph composed of algebraic components and their connection relationships. We have proved that the software system can be abstracted into the form of algebraic component expressions, and can find algebraic components that may have vulnerabilities based on the eigenvalues of complex networks.
1 citations
••
TL;DR: Gromov centrality as mentioned in this paper measures the importance of a node in a network based on different geometric or diffusive properties, and focus on different scales. But it does not capture the effect of geometric and boundary constraints on the network.
Abstract: Centrality measures quantify the importance of a node in a network based on different geometric or diffusive properties, and focus on different scales. Here, we adopt a geometrical viewpoint to define a multiscale centrality in networks. Given a metric distance between the nodes, we measure the centrality of a node by its tendency to be close to geodesics between nodes in its neighborhood, via the concept of triangle inequality excess. Depending on the size of the neighborhood, the resulting Gromov centrality defines the importance of a node at different scales in the graph, and it recovers as limits well-known concepts such as the clustering coefficient and closeness centrality. We argue that Gromov centrality is affected by the geometric and boundary constraints of the network, and illustrate how it can help distinguish different types of nodes in random geometric graphs and empirical transportation networks.
1 citations
••
01 Jan 2017TL;DR: This work has analyzed ten versions of Java development tool (JDT) evolving open-source software-system, adopting new approach in software engineering that uses a network theory.
Abstract: Many real-world systems can be represented as networks, such as social networks, Internet, metabolic networks, food webs, neural networks, communication and distribution networks. The same approach can be adopted for the software-systems. Although this topic has been subject of research for some time now, there are still unresolved problems. In our work, we have analyzed ten versions of Java development tool (JDT) evolving open-source software-system, adopting new approach in software engineering that uses a network theory. Statistical analysis of software networks has revealed some properties such as, power-law degree distribution, scale-free and small-world. And our work is based on detecting these properties on an open-source software-system in evolution.
1 citations