Eigenvector Centrality Distribution for Characterization of Protein Allosteric Pathways

نویسندگان

  • Christian F. A. Negre
  • Heidi Hendrickson
  • Rhitankar Pal
  • Ivan Rivalta
  • Junming Ho
  • Victor S. Batista
چکیده

Christian F. A. Negre, ∗ Heidi Hendrickson, Rhitankar Pal, Ivan Rivalta, † Junming Ho, and Victor S. Batista ‡ Theoretical Divission, Los Alamos National Laboratory, Los Alamos, NM 87545 Department of Chemistry, Yale University, P.O. Box 208107, New Haven, CT 06520-8107, and Energy Sciences Institute, Yale University, P.O. Box 27394, West Haven, CT 06516-7394 École Normale Supérieure de Lyon, CNRS, Université Lyon 1, Laboratoire de Chimie UMR 5182, 46, Allée d’Italie, 69364 Lyon Cedex 07, France Agency for Science, Technology and Research, Institute of High Performance Computing, 1 Fusionopolis Way #16-16 Connexis North, Singapore 138632

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correlation of Eigenvector Centrality to Other Centrality Measures: Random, Small-world and Real-world Networks

In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, smallworld network, and real-world network). For each network, we compute those six centrality measures, from...

متن کامل

Lobby index as a network centrality measure

We study the lobby index ( l for short) as a local node centrality measure for complex networks. The l is compared with degree (a local measure), betweenness and Eigenvector centralities (two global measures) in the case of a biological network (Yeast interaction protein-protein network) and a linguistic network (Moby Thesaurus II ). In both networks, the l has poor correlation with betweenness...

متن کامل

Non-Backtracking Centrality Based Random Walk on Networks

Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...

متن کامل

Local and Consistent Centrality Measures in Networks

The centrality of an agent in a network has been shown to be crucial in explaining different behaviors and outcomes. In this paper, we propose an axiomatic approach to characterize centrality measures for which the centrality of an agent is recursively related to the centralities of the agents she is connected to. This includes the Katz-Bonacich and the eigenvector centrality. The core of our a...

متن کامل

Comparison of Hubs in Effective Normal and Tumor Protein Interaction Networks

ABSTRACTIntroduction: Cancer is caused by genetic abnormalities, such as mutation of ontogenesis or tumor suppressor genes which alter downstream signaling pathways and protein-protein interactions. Comparison of protein interactions in cancerous and normal cells can be of help in mechanisms of disease diagnoses and treatments. Methods: We constructed protein interaction networks of cancerous a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017