Massey Documents by Type
Permanent URI for this communityhttps://mro.massey.ac.nz/handle/10179/294
Browse
2 results
Search Results
Item Evolution of global food trade network and its effects on population nutritional status(Elsevier BV, 2023-06-03) Silvestrini MM; Smith NW; Sarti FM; Marangoni AGChanges in food systems during the last decades fostered the establishment of global food networks based on exchanges between countries with different income levels. Recent studies explored configuration and factors associated with trade networks of specific food items during limited periods; however, there is lack of evidence on evolution of trade networks of foods for human consumption and its potential effects on population nutritional status. We present the evolution of the global trade network of foods for human consumption from 1986 to 2020, according to country income level, and we explore potential effects of country network centrality and globalization processes on the prevalence of overweight and obesity. Results show intensification of international food trade and globalization processes in the period of analysis with implications for population nutritional status worldwide.Item Structure and randomness in complex networks applied to the target set selection problem : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Manawatu, New Zealand(Massey University, 2014) Lowcay, Callum WilliamAdvances in technology have enabled the empirical study of large, so-called `complex' networks with tens of thousands to millions of vertices, such as social networks and large communications networks. It has been discovered that these networks share a non-random topology characterised mainly by highly skewed, heavy-tailed degree distributions and small average distances between vertices. The work of this thesis is to attempt to leverage the well-known topological properties of complex networks to efficiently solve difficult NP-complete problems, with the aim of obtaining better or faster solutions than would be possible for general graphs. Two related NP-complete problems are selected for study: the minimum target set problem, and the maximum activation set problem. Both problems relate to finding a `target set' of vertices which is capable of initiating a spreading process (such as the spread of a rumour) that reaches a large proportion of the network. This thesis introduces several novel heuristics for these two problems inspired by the topology of complex networks. It is discovered that in many (but not all) cases it is possible to make relatively small alterations to the network that enable the computation of a considerably smaller target set than would be possible on general graphs. The evaluation of the various heuristics is entirely experimental, which required the development of procedures to generate `random' networks that can be used as experimental controls. This thesis includes a survey of several popular techniques for generating random networks and finds all but one (random rewiring) to be unsuitable as controls. The validity of random rewiring relies on a somewhat obscure theorem. Although a proof of the theorem (essentially an existence proof) is already known, this thesis offers a constructive algorithmic proof. The new proof advances on the old by providing an upper bound on the maximum number of rewiring operations required to transform between networks of the same degree-sequence, whereas an upper bound could not be determined under the old proof.