Properties of graph representation of genome scale metabolic networks have been extensively studied. However, the relationship between these structural properties and functional properties of the networks are still very unclear. In this paper, we focus on nutritional requirements of organisms as a functional property and study the relationship with structural properties of a graph representatio...

The major objective of this paper is to introduce a novel method for the functional annotation of genes. Our method is based on a graph theoretical measure we call joint betweenness, which is an extension of the well known betweenness centrality measure, involving pairs of genes. We apply our method to the transcriptional regulatory network of yeast to, first, provide a large scale proof of con...

We consider all players and clubs in top twenty world football leagues in the last fifteen seasons. The purpose of this paper is to reveal top football players and identify springboard clubs. To do that, we construct two separate weighted networks. Player collaboration network consists of players, that are connected to each other if they ever played together at the same club. In directed club t...

With the increased application of network analysis in archeology to form hypotheses, particularly concerning the research on mobility, a need has arisen to validate the network analysis results. This paper presents a case study of a local transport network in the Dutch part of the Roman limes between 70 and 270 AD created using a leastcost approach, and tests the robustness of the local network...

We show that betweenness centrality, a graph-theoretic measure widely used in social network analysis, provides a sound basis for autonomously forming useful high-level behaviors, or skills, from available primitives— the smallest behavioral units available to an autonomous agent.

Abstract: One of the common approaches for the community detection in complex networks is the Girvan-Newman algorithm [5] which is based on repeated deletion of edges having the maximum edge betweenness centrality. Although widely used, it may result in different dendrograms of hierarchies of communities if there are several edges eligible for removal (see [6]) thus leaving an ambiguous formati...

We deliver a short overview of different centrality measures and influence concepts in social networks, and present the relation-algebraic approach to the concepts of power and influence. First, we briefly discuss four kinds of measures of centrality: the ones based on degree, closeness, betweenness, and the eigenvector-related measures. We consider centrality of a node and of a network. Moreov...

This paper proposes a new node centrality measurement index (c-index) and its derivative indexes (iterative c-index and cg-index) to measure the collaboration competence of a node in a weighted network. We prove that c-index observe the power law distribution in the weighted scale-free network. A case study of a very large scientific collaboration network indicates that the indexes proposed in ...

Group testing is a mathematical technique that uses superimposed code theory to find a specified number of distinct units among a large population, using the fewest number of tests. In this paper, we investigate the applicability of group testing in finding vertices with high betweenness centrality. Betweenness centrality (BC) is a widely applied network analysis objective, for identifying impo...

Objectives: Accurate localization of epileptogenic zones (EZs) is essential for successful surgical treatment of refractory focal epilepsy. The aim of the present study is to investigate whether a dynamic network connectivity analysis based on stereo-electroencephalography (SEEG) signals is effective in localizing EZs. Methods: SEEG data were recorded from seven patients who underwent presurgic...