Volume : V, Issue : XII, December - 2016

A Cost Function for Complex Systems

Prashanth Alluvada

Abstract :

 We introduce a new cost function over graphs built through the graph‘s characteristic path length (CPL) and clustering coefficient (CC). ?e function describes the extreme graph configurations (“boundaries”) corresponding to the specified property values (CC, CPL) so that several dynamics of the CC and CPL based graphs occur within the bounding graphs described by the cost function. For graphs that are rewired with probability p, we show through computation that as the rewiring probability is varied, the cost function passes a global minimum point

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

Prashanth Alluvada, A Cost Function for Complex Systems, International Journal of Scientific Research, Volume : 5 | Issue : 12 |December 2016

Number of Downloads : 343

References :