A note on a generalization of eigenvector centrality for bipartite graphs and applications

@article{Daugulis2012ANO,
  title={A note on a generalization of eigenvector centrality for bipartite graphs and applications},
  author={Peteris Daugulis},
  journal={Networks},
  year={2012},
  volume={59}
}
  • P. Daugulis
  • Published 1 March 2012
  • Mathematics, Computer Science
  • Networks
Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector centrality invariant is defined which is motivated by the need to design rating systems for bipartite graph models of time‐sensitive and other processes. The linear algebra connection and some applications are described. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 

Linear Functional Graphs ‒ a Data Arrangement and Visualization Tool for Linear Algebra

Visualization and mappings of mathematical data and transformations to geometric objects are important tools in any area of mathematics. Directed graphs have been used in linear algebra since D.

Robustness Analysis of Bipartite Task Assignment Networks: A Case Study in Hospital Logistics System

TLDR
The robustness and efficiency of bipartite task-oriented social networks under the absence of some workers seem to be negatively correlated with each other, and how to balance the two in real systems still remains an open problem.

Bipartite graphs in systems biology and medicine: a survey of methods and applications

TLDR
In this review, special focus is given to the usability of bipartite graphs and their impact on the field of network biology and medicine and how their topological properties can be applied to certain biological case studies.

Laplacian and signless laplacian spectra and energies of multi-step wheels.

TLDR
Closed forms of signless Laplacian and LaPlacian spectra and energies of multi-step wheel networks Wn,m,m are computed and correlation of these energies on the involved parameters m ≥ 3 and n is given graphically.

Bipartite graph modeling of Alzheimer’s disease and its early automated discrimination through region-based level set algorithm and support vector machine in magnetic resonance brain images

TLDR
A bird's eye perception is offered of how bipartite graph modeling could help to comprehend the progression of Alzheimer Disease by analyzing the measurable variations in the hippocampus, grey matter, cerebrospinal fluid and white matter of the brain from Magnetic resonance images.

References

SHOWING 1-6 OF 6 REFERENCES

The Structure and Function of Complex Networks

TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

Eigenfactor Measuring the value and prestige of scholarly journals

In 1927, two chemists at Pomona College published an article in Science, proposing that librarians could use data about citation rates to select appropriate journals for a small library collection.

Handbook of Linear Algebra

Linear Algebra Linear Algebra Vectors, Matrices, and Systems of Linear Equations Jane Day Linear Independence, Span, and Bases Mark Mills Linear Transformations Francesco Barioli Determinants and

The Anatomy of a Large-Scale Hypertextual Web Search Engine

The Jordan forms of AB and BA

The relationship between the Jordan forms of the matrix products AB and BA for some given A and B was first described by Harley Flanders in 1951. Their non-zero eigenvalues and non-singular Jordan

Editor), Handbook of linear algebra

  • Boca Raton, FL: Chapman & Hall CRC,
  • 2006