Chan Hoi-Yeung = 網絡與競爭系統的物理 : 個體為本模型中的網絡效應 / 陳凱揚. / Thesis submitted in: September 2005. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 191-197). / Text in English; abstracts in English and Chinese. / Chan Hoi-Yeung = Wang luo yu jing zheng xi tong de wu li : ge ti wei ben mo xing zhong de wang luo xiao ying / Chen Kaiyang. / Abstract --- p.i / Acknowledgments --- p.v / Contents --- p.vii / Chapter 1 --- Overview --- p.1 / Chapter I --- Networks --- p.3 / Chapter 2 --- Networks in nature --- p.4 / Chapter 2.1 --- Introduction --- p.4 / Chapter 2.2 --- Terminology of the networks studies --- p.6 / Chapter 2.2.1 --- Nodes --- p.6 / Chapter 2.2.2 --- Links --- p.6 / Chapter 2.2.3 --- Adjacency matrix --- p.9 / Chapter 2.2.4 --- Connectivity --- p.10 / Chapter 2.2.5 --- Clustering coefficient --- p.11 / Chapter 2.2.6 --- Shortest path --- p.11 / Chapter 2.2.7 --- Connectivity correlation --- p.12 / Chapter 2.3 --- Topology in the real-world networks --- p.13 / Chapter 2.3.1 --- The Internet --- p.13 / Chapter 2.3.2 --- The WWW --- p.15 / Chapter 2.3.3 --- Collaboration networks --- p.15 / Chapter 2.3.4 --- Food webs --- p.16 / Chapter 2.3.5 --- Power grids --- p.17 / Chapter 2.4 --- Discussion --- p.17 / Chapter 3 --- Review on Network Models --- p.19 / Chapter 3.1 --- Introduction --- p.19 / Chapter 3.2 --- Graph Theory --- p.20 / Chapter 3.2.1 --- Classical random graph --- p.20 / Chapter 3.3 --- Evolving networks --- p.23 / Chapter 3.3.1 --- Random growing network --- p.23 / Chapter 3.3.2 --- Fitness growing network --- p.25 / Chapter 3.3.3 --- Barabasi-Albert model --- p.27 / Chapter 3.3.4 --- Fitness model --- p.31 / Chapter 3.4 --- Lattice --- p.33 / Chapter 3.4.1 --- Regular hypercubic lattices (Periodic) --- p.33 / Chapter 3.4.2 --- Regular hypercubic lattices (Free boundary conditions) . --- p.35 / Chapter 3.5 --- Discussion --- p.35 / Chapter 4 --- Network Properties --- p.38 / Chapter 4.1 --- More derivations on existing models --- p.38 / Chapter 4.1.1 --- Classical random graphs --- p.38 / Chapter 4.1.2 --- Barabasi-Albert model --- p.40 / Chapter 4.1.3 --- Fitness Model --- p.42 / Chapter 4.1.4 --- Regular hypercubic lattices (Periodic) --- p.45 / Chapter 4.2 --- New model --- p.48 / Chapter 4.2.1 --- Fitness-BA hybrid model --- p.48 / Chapter 4.3 --- Link removal --- p.55 / Chapter 4.3.1 --- Introduction --- p.55 / Chapter 4.3.2 --- Formalism in connectivity --- p.55 / Chapter 4.3.3 --- Pruned BA Model --- p.56 / Chapter 4.4 --- Link addition --- p.58 / Chapter 4.4.1 --- Introduction --- p.58 / Chapter 4.4.2 --- Regular hypercubic lattices (Periodic) --- p.58 / Chapter 4.5 --- Discussion --- p.60 / Chapter II --- Games --- p.62 / Chapter 5 --- Review on Agent-based models of competing population --- p.63 / Chapter 5.1 --- Introduction --- p.63 / Chapter 5.2 --- The El Farol Bar attendance problem --- p.65 / Chapter 5.2.1 --- Model --- p.65 / Chapter 5.2.2 --- Strategies --- p.66 / Chapter 5.2.3 --- Discussion --- p.66 / Chapter 5.3 --- Minority game --- p.67 / Chapter 5.3.1 --- Model --- p.67 / Chapter 5.3.2 --- Strategies --- p.68 / Chapter 5.3.3 --- Attendance --- p.69 / Chapter 5.3.4 --- History and quasi-Eulerian state --- p.69 / Chapter 5.3.5 --- Success rate and Hamming distance --- p.71 / Chapter 5.3.6 --- Volatility --- p.73 / Chapter 5.3.7 --- Crowd-anticrowd theory --- p.75 / Chapter 5.3.8 --- Discussion --- p.76 / Chapter 6 --- B-A-R model : Dynamics --- p.78 / Chapter 6.1 --- Model --- p.78 / Chapter 6.2 --- Results: Plateaux and periodicity --- p.81 / Chapter 6.3 --- A microscopic view: Agents' decisions and strategy performance --- p.86 / Chapter 6.4 --- A macroscopic view: Bit-string patterns --- p.92 / Chapter 6.4.1 --- The history space --- p.92 / Chapter 6.4.2 --- Bit-string statistics of different states --- p.94 / Chapter 6.5 --- The (max = 1 states --- p.97 / Chapter 6.5.1 --- Values of wm3iX --- p.97 / Chapter 6.5.2 --- "Strategy ranking evolvement: ni, (w)" --- p.101 / Chapter 6.5.3 --- Substates . --- p.105 / Chapter 7 --- B-A-R model : Formalism --- p.108 / Chapter 7.1 --- Resource level at transitions of Cmax = 0 state --- p.108 / Chapter 7.2 --- Resource levels at transitions of Cmax 二 1 states --- p.109 / Chapter 7.2.1 --- Method --- p.109 / Chapter 7.2.2 --- Lmin for upper substate --- p.110 / Chapter 7.2.3 --- Lmin for lower substate --- p.113 / Chapter 7.3 --- Discussion --- p.116 / Chapter 8 --- B-A-R model : Statistics --- p.121 / Chapter 8.1 --- Problem --- p.121 / Chapter 8.2 --- Bit-string statistics --- p.122 / Chapter 8.2.1 --- Allowed transitions --- p.122 / Chapter 8.2.2 --- Grouping the history space --- p.122 / Chapter 8.2.3 --- "Grouping the states, Cmax" --- p.127 / Chapter 8.2.4 --- "Labelling each state, /(C)" --- p.129 / Chapter 8.3 --- Discussion --- p.130 / Chapter III --- Networked games --- p.131 / Chapter 9 --- Networked minority game --- p.132 / Chapter 9.1 --- Model --- p.132 / Chapter 9.2 --- Preliminary results: Agents' success rates --- p.133 / Chapter 9.3 --- Ranking the strategies --- p.135 / Chapter 9.3.1 --- Ranking pattern --- p.136 / Chapter 9.3.2 --- Fraction of strategies in each rank --- p.140 / Chapter 9.4 --- Number of agents using a best strategy belonging to rank r --- p.141 / Chapter 9.4.1 --- Unconnected population --- p.141 / Chapter 9.4.2 --- Networked population . --- p.142 / Chapter 9.5 --- Application: Mean success rate --- p.143 / Chapter 9.6 --- Mean success rate of agents with degree k --- p.147 / Chapter 9.7 --- Application in other networks --- p.149 / Chapter 9.8 --- Discussion --- p.151 / Chapter 10 --- Interacting agents: Networked B-A-R model --- p.154 / Chapter 10.1 --- Model --- p.154 / Chapter 10.2 --- The quasi-Eulerian state (wmax = 1/2 state) --- p.155 / Chapter 10.3 --- The emergent states --- p.159 / Chapter 10.3.1 --- General results --- p.159 / Chapter 10.3.2 --- The Cmax = 0 state --- p.160 / Chapter 10.3.3 --- The Cmax = 1 state --- p.161 / Chapter 10.4 --- Discussion --- p.162 / Chapter IV --- Conclusion --- p.164 / Chapter 11 --- Conclusion --- p.165 / Chapter V --- Appendices --- p.172 / Chapter A --- List of symbols --- p.173 / Chapter A.1 --- Networks --- p.173 / Chapter A.2 --- Games --- p.174 / Chapter A.3 --- Networked games --- p.176 / Chapter B --- Distance distribution in classical random graphs --- p.177 / Chapter B.1 --- Method --- p.177 / Chapter B.2 --- Distance distribution --- p.177 / Chapter B.3 --- Behaviour at small L --- p.178 / Chapter B.4 --- Behaviour at large L --- p.179 / Chapter C --- Co-ordination number in infinite hypercubic lattice --- p.181 / Chapter C.1 --- Method --- p.181 / Chapter C.1.1 --- ID lattice --- p.181 / Chapter C.1.2 --- 2D square lattice --- p.182 / Chapter C.1.3 --- Higher dimension hypercubic lattices --- p.183 / Chapter C.2 --- Coefficients --- p.185 / Chapter D --- Connectivity distribution in fitness-BA hybrid model --- p.187 / Chapter D.1 --- Mean field approach --- p.187 / Chapter D.2 --- Connectivity distribution --- p.188 / Chapter D.3 --- Power-law exponent --- p.190 / Bibliography --- p.191
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_325487 |
| Date | January 2006 |
| Contributors | Chan, Hoi-Yeung., Chinese University of Hong Kong Graduate School. Division of Physics. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English, Chinese |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, xix, 197 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0026 seconds