oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Predicting Node Degree Centrality with the Node Prominence Profile  [PDF]
Yang Yang,Yuxiao Dong,Nitesh V. Chawla
Computer Science , 2014, DOI: 10.1038/srep07236
Abstract: Centrality of a node measures its relative importance within a network. There are a number of applications of centrality, including inferring the influence or success of an individual in a social network, and the resulting social network dynamics. While we can compute the centrality of any node in a given network snapshot, a number of applications are also interested in knowing the potential importance of an individual in the future. However, current centrality is not necessarily an effective predictor of future centrality. While there are different measures of centrality, we focus on degree centrality in this paper. We develop a method that reconciles preferential attachment and triadic closure to capture a node's prominence profile. We show that the proposed node prominence profile method is an effective predictor of degree centrality. Notably, our analysis reveals that individuals in the early stage of evolution display a distinctive and robust signature in degree centrality trend, adequately predicted by their prominence profile. We evaluate our work across four real-world social networks. Our findings have important implications for the applications that require prediction of a node's future degree centrality, as well as the study of social network dynamics.
A measure of centrality based on the spectrum of the Laplacian  [PDF]
Scott D. Pauls,Daniel Remondini
Computer Science , 2011, DOI: 10.1103/PhysRevE.85.066127
Abstract: We introduce a family of new centralities, the k-spectral centralities. k-Spectral centrality is a measurement of importance with respect to the deformation of the graph Laplacian associated with the graph. Due to this connection, k-spectral centralities have various interpretations in terms of spectrally determined information. We explore this centrality in the context of several examples. While for sparse unweighted networks 1-spectral centrality behaves similarly to other standard centralities, for dense weighted networks they show different properties. In summary, the k-spectral centralities provide a novel and useful measurement of relevance (for single network elements as well as whole subnetworks) distinct from other known measures.
Estimating the Degree Centrality Ranking of a Node  [PDF]
Akrati Saxena,Vaibhav Malik,S. R. S. Iyengar
Computer Science , 2015,
Abstract: Complex networks have gained more attention from the last few years. The size of the real world complex networks, such as online social networks, WWW networks, collaboration networks, is exponentially increasing with time. It is not feasible to completely collect, store and process these networks. In the present work, we propose a method to estimate the degree centrality ranking of a node without having complete structure of the graph. The proposed algorithm uses degree of a node and power law exponent of the degree distribution to calculate the ranking. We also study simulation results on Barabasi-Albert model. Simulation results show that the average error in the estimated ranking is approximately $5\%$ of the total number of nodes.
A Vibrational Approach to Node Centrality and Vulnerability in Complex Networks  [PDF]
Ernesto Estrada,Naomichi Hatano
Physics , 2009, DOI: 10.1016/j.physa.2010.03.030
Abstract: We propose a new measure of vulnerability of a node in a complex network. The measure is based on the analogy in which the nodes of the network are represented by balls and the links are identified with springs. We define the measure as the node displacement, or the amplitude of vibration of each node, under fluctuation due to the thermal bath in which the network is supposed to be submerged. We prove exact relations among the thus defined node displacement, the information centrality and the Kirchhoff index. The relation between the first two suggests that the node displacement has a better resolution of the vulnerability than the information centrality, because the latter is the sum of the local node displacement and the node displacement averaged over the entire network.
Fractional Energy Loss and Centrality Scaling  [PDF]
Rudolph C. Hwa,C. B. Yang
Physics , 2003, DOI: 10.1103/PhysRevC.69.034902
Abstract: The phenomenon of centrality scaling in the high-\pt spectra of $\pi^0$ produced in Au-Au collisions at $\sqrt s=200$ GeV is examined in the framework of relating fractional energy loss to fractional centrality increase. A new scaling behavior is found where the scaling variable is given a power-law dependence on $N_{\rm part}$. The exponent $\gamma$ specifies the fractional proportionality relationship between energy loss and centrality, and is a phenomenologically determined number that characterizes the nuclear suppression effect. The implication on the parton energy loss in the context of recombination is discussed.
Dynamics-based centrality for general directed networks  [PDF]
Naoki Masuda,Hiroshi Kori
Physics , 2010, DOI: 10.1103/PhysRevE.82.056107
Abstract: Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.
On Laplacian like energy of trees  [PDF]
Aleksandar Ilic,Djordje Krtinic,Milovan Ilic
Mathematics , 2011,
Abstract: Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed graph invariant, defined as the sum of square roots of Laplacian eigenvalues. For bipartite graphs, the Laplacian--like energy coincides with the recently defined incidence energy $IE (G)$ of a graph. In [D. Stevanovi\' c, \textit{Laplacian--like energy of trees}, MATCH Commun. Math. Comput. Chem. 61 (2009), 407--417.] the author introduced a partial ordering of graphs based on Laplacian coefficients. We point out that original proof was incorrect and illustrate the error on the example using Laplacian Estrada index. Furthermore, we found the inverse of Jacobian matrix with elements representing derivatives of symmetric polynomials of order $n$, and provide a corrected elementary proof of the fact: Let $G$ and $H$ be two $n$-vertex graphs; if for Laplacian coefficients holds $c_k (G) \leqslant c_k (H)$ for $k = 1, 2, ..., n - 1$, then $LEL (G) \leqslant LEL (H)$. In addition, we generalize this theorem and provide a necessary condition for functions that satisfy partial ordering based on Laplacian coefficients.
Energy and Centrality Dependence of Rapidity Densities at RHIC  [PDF]
Xin-Nian Wang,Mikols Gyulassy
Physics , 2000, DOI: 10.1103/PhysRevLett.86.3496
Abstract: The energy and centrality dependence of the charged multiplicity per participant nucleon is shown to be able to differentiate between final-state saturation and fixed scale pQCD models of initial entropy production in high-energy heavy-ion collisions. The energy dependence is shown to test the nuclear enhancement of the mini-jet component of the initial conditions, while the centrality dependence provides a key test of whether gluon saturation is reached at RHIC energies. HIJING model predicts that the rapidity density per participant increases with centrality, while the saturation model prediction is essentially independent of centrality.
The Laplacian energy of random graphs  [PDF]
Wenxue Du,Xueliang Li,Yiyang Li
Mathematics , 2009,
Abstract: Gutman {\it et al.} introduced the concepts of energy $\En(G)$ and Laplacian energy $\EnL(G)$ for a simple graph $G$, and furthermore, they proposed a conjecture that for every graph $G$, $\En(G)$ is not more than $\EnL(G)$. Unfortunately, the conjecture turns out to be incorrect since Liu {\it et al.} and Stevanovi\'c {\it et al.} constructed counterexamples. However, So {\it et al.} verified the conjecture for bipartite graphs. In the present paper, we obtain, for a random graph, the lower and upper bounds of the Laplacian energy, and show that the conjecture is true for almost all graphs.
An Energy-Based Centrality for Electrical Networks  [PDF]
Ruiyuan Kong, Congying Han, Tiande Guo, Wei Pei
Energy and Power Engineering (EPE) , 2013, DOI: 10.4236/epe.2013.54B115
Abstract:

We present an energy-based method to estimate centrality in electrical networks. Here the energy between a pair of vertices denotes by the effective resistance between them. If there is only one generation and one load, then the centrality of an edge in our method is the difference between the energy of network after deleting the edge and that of the original network. Compared with the local current-flow betweenness on the IEEE 14-bus system, we have an interesting discovery that our proposed centrality is closely related to it in the sense of that the significance of edges under the two measures are very similar.

Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.