Research Papers - Dept of Software Engineering

Permanent URI for this collectionhttps://rda.sliit.lk/handle/123456789/1022

Browse

Filters

2013 - 201912020 - 20221

Advanced Search

Filter by

Settings

Author: search.filters.author.Piraveenan, MSubject: search.filters.subject.Assortativity

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    PublicationOpen Access
    Disassortative mixing of boundedly-rational players in socio-ecological systems
    (researchgate.net, 2022-03-25) Ratnayake, P; Kasthurirathna, D; Piraveenan, M
    Bounded rationality refers to the non-optimal rationality of players in non-cooperative games. In a networked game, the bounded rationality of players may be heterogeneous and spatially distributed. It has been shown that the ‘system rationality’, which indicates the overall rationality of a network of players, may play a key role in the emergence of scale-free or core-periphery topologies in real-world networks. On the other hand, scalar-assortativity is a metric used to quantify the assortative mixing of nodes with respect to a given scalar attribute. In this work, we observe the effect of node rationality-based scalar-assortativity, on the system rationality of a network. Based on simulation results, we show that irrespective of the placement of nodes with higher rationality, it is the disassortative mixing of node rationality that helps to maximize system rationality in a population. The findings may have useful interpretations and applications in socio-economic systems in maximizing the utility of interactions in a population of strategic players
  • Thumbnail Image
    PublicationEmbargo
    Cyclic preferential attachment in complex networks
    (Elsevier, 2013-01-01) Kasthurirathna, D; Piraveenan, M
    Preferential Attachment (PA), which was originally proposed in the Barabasi-Albert (BA) Model, has been widely ac- cepted as a network growth model which returns in scale-free networks. Preferential attachment in the BA model operates on the assumption that a node which has more links has a better likelihood to create new links. In this work, we expand the PA mechanism by treating it as a cyclic mechanism which is linked to both direct and indirect neighbours of a node. The assumption behind this extension is that the preference of nodes is influenced by their indirect neighbours as well. We show that traditional PA can be absorbed as a special case of this new growth model, which we name ‘cyclic preferential attachment’ (CPA). We also discuss the properties of simulated networks that were generated based on CPA. Finally, we compare and contrast the CPA based networks with the traditional PA based networks and several real-world networks of similar sizes and link-to-node ratios, and show that CPA offers more flexibility in modeling real world networks.