Taking the principles of graph theory into account, the most important centrality for our application, will be eigenvector, as we will initially be linking to local funeral directors, stone masons, florists, and memorial services, all of which are already established within the area. This notion is based on the concept of preferential attachment, by which items are distributed in accordance with how many links they already have. So, when we create and add links to our application, it is advantageous for us to gain a social relationship with those sites that are already highly linked and popular.
Degree centrality, the number of people to whom we are linked, and who are linked to us, is also of importance, but of more consequence is the quality of those existing links; if they come from well-respected and important local sites, we are likely to rank higher in accordance with eigenvector centrality. We are also considering the concept of triadic closure and that by linking to well-known local funeral directors, there is more probability that those clients who are linking to them now will link to our application in the future.
Written by Ashton Kingdon
