In this paper, we seek to find a computationally light centrality metric that could serve as an alternate for the computationally heavy betweenness centrality (BWC) metric. In this pursuit, in the first half of the paper, we evaluate the correlation coefficient between BWC and the other commonly used centrality metrics such as Degree Centrality (DEG), Closeness Centrality (CLC), Farness Central...

Estimating influential nodes in large scale networks including but not limited to social networks, biological networks, communication networks, emerging smart grids etc. is a topic of fundamental interest. To understand influences of nodes in a network, a classical metric is centrality within which there are multiple specific instances including degree centrality, closeness centrality, betweenn...

Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones [7–9]. Here w...

PURPOSE To better identify the physiology of triple-negative breast neoplasm (TNBN), we analyzed the TNBN gene regulatory network using gene expression data. METHODS We collected TNBN gene expression data from The Cancer Genome Atlas to construct a TNBN gene regulatory network using least absolute shrinkage and selection operator regression. In addition, we constructed a triple-positive breas...

Network theoretic approach has been used to model and study the flow of ecological information, growth and connectivity on landscape level of anemochory plant species Abied pindrow, Betula utilis and Taxus wallichiana in the Western Himalaya region. A network is formally defined and derived for seed dispersion model of aforementioned species where vertices represent habitat patches which are co...

a roman dominating function (rdf) on a graph g = (v,e) is defined to be a function satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. a set s v is a restrained dominating set if every vertex not in s is adjacent to a vertex in s and to a vertex in . we define a restrained roman dominating function on a graph g = (v,e) to be ...

Betweenness Centrality (BC) is steadily growing in popularity as a metrics of the influence of a vertex in a graph. The BC score of a vertex is proportional to the number of all-pairs-shortestpaths passing through it. However, complete and exact BC computation for a large-scale graph is an extraordinary challenge that requires high performance computing techniques to provide results in a reason...

In this paper, we study a crossing minimization problem in a radial drawing of a graph. Radial drawings have strong application in social network visualization, for example, displaying centrality indices of actors [20]. The main problem of this paper is called the one-sided radial crossing minimization between two concentric circles, named orbits, where the positions of vertices in the outer or...

A comparative analysis of the topological structure of molecules and molecular biology networks revealed both similarity and differences in the methods used, as well as in the essential features of the two types of systems. Molecular graphs are static and, due to the limitations in atomic valence, show neither power distribution of vertex degrees nor "small-world" properties, which are typical ...