2026-09-20T02:20:33Zhttps://wakespace.lib.wfu.edu/server/oai/request

oai:null:10339/923772026-09-02T09:40:25Zcom_10339_14934col_10339_38132

Feng, Fan 2018-08-23T08:35:37Z 2023-09-01T08:30:06Z 2018 https://wakespace.lib.wfu.edu/handle/10339/92377 In this thesis we consider price dynamics on an $n$-node graph, with particular emphasis on population distribution and movement. We propose a general model wherein at each time step population distributes to adjacent nodes with minimal price, and prices are modified to reflect local population demand. We prove some inequalities regarding local and global load balancing (in the case of trees), for a simplified model wherein prices do not decline. In regards to global load balancing, we obtain a bound in terms of the size of the edge-set of the graph; this bound is attained for star graphs. Connections to recent work on non-revisiting random walks are discussed, and some further conjectures are proposed. en Wake Forest University Load Balancing Networks Price Dynamics Random Walks Trees Price Dynamics on Networks Thesis Berenhaut, Kenneth S. Norris, James Jiang, Miaohua Mathematics and Statistics 2023-09-01 open.access