Email this article A Model to Select System Core and Its Application
Abstract
The theory of system core is given a method to determine key elements of the system based on graph theory, but it is difficult to apply in practice for the question of how to change a system to a graph and multi-core in a system. This paper gives a method to change a system to a graph based on correlation analysis, and gives a modle to select system core based on cluster analysis. More, in the case of the real estate system of Wuhan, a diffusion index curve is given based on the elements of system core selected by the model, the result illustrates that Wuhan real estate arises in 1991 and to its peak in 1993, and then declines to the bottom in 1996; next, it fluctuates in a small range and becomes smooth since 1999, but a slight upward trend during 2000, this conclusion is consistent with the actual development status of the real estate in Wuhan and prove the validity of the model.
Keywords
References
[1] Xu jin. The theory of system core and its application. XiDian University Press,1994.
[2] W. Duckworth, B. Mans. Connected domination of regular graphs. Discrete Mathematics, Volume 309, Issue 8, 28 April 2009, Pages 2305-2322.
http://dx.doi.org/10.1016/j.disc.2008.05.029
[3] Bruno Escoffier, Laurent Gourvès, Jérôme Monnot. Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Journal of Discrete Algorithms, Volume 8, Issue 1, March 2010, Pages 36-49.
http://dx.doi.org/10.1016/j.jda.2009.01.005
[4] CAO Qiguo,SUN Yugeng. The Hypergraph Design Method of Multibus Structures of Reliable Communication Networks. Acta Electronica Sinica, 1997,(10):55-62.
[5] Konstantin Avrachenkov, Vivek Borkar, Danil Nemirovsky. Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph. Journal of Computational and Applied Mathematics, Volume 234, Issue 11, 1 October 2010, Pages 3075-3090.
http://dx.doi.org/10.1016/j.cam.2010.02.001
[6] OUYANG Kezhi, OUYANG Keyi. Relative Breaktivity of Graphs. Journal of Lanzhou University(Natural Science Edition), 1993(3):78-82.
[7] ZHANG Shenggui, WANG Ziguo. On Using Concept of Degree of Rupture for Designing Reliable Network. Journal of northwestern polytechnical universty, 1995(2):310-313.
[8] Firdovsi Sharifov, Hakan Kutucu. Minimum Cost ≤k Edges Connected Subgraph Problems.Electronic Notes in Discrete Mathematics, Volume 36, 1 August 2010, Pages 25-32.
http://dx.doi.org/10.1016/j.endm.2010.05.004
[9] Hu Xuefeng. On the establishment and improvement of the statistical indexes system of Real estate, The Journal of ShanXi Einance and Economics University, 2002.2,86-89.
[10] Ye Yanbing. Ding Lieyun, Design and study of real estate early warning indexes system. Optimization of Capital Construction, 2001.3,1-3.
[11] Wang Xiaobo. Study on economy cycle and early warning. Press of Metallurgy Industry,1993.
[12] Xu jin, XI Youmin, WANGYingluo. system core and core degree(I). Journal of Systems Science and Mathematical Sciences 1993,(02):20-28.
[13] W. Ananchuen, N. Ananchuen, R.E.L. Aldred. The structure of 4-γ-critical graphs with a cut vertex. Discrete Mathematics, Volume 310, Issues 17-18, 28 September 2010, Pages 2404-2414.
[14] SHOU Jilin, LI Fei, Point Weighted Core and Coritivity of Network System and Its Applications, Systems engineering--theory and practice, 1996(6):58-63.
[15] WANG Jingguang. Study of the Relation Between Reliability & Complexity of Information Systems Structure. Measurement & Control Technology, 2001,(02):26-34.
[16] ZHAO Bingxin; ZHAO Jinghua. Researching on the Core Competence with Networks. Chinese Journal of Management Science, 2000,(S1):45-51.
[17] Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Upper and lower bounds for finding connected motifs in vertex-colored graphs .Journal of Computer and System Sciences, In Press, Corrected Proof, Available online 3 August 2010.
[18] Stephen P. Borgatti.Identifying sets of key players in a social network.Computational & Mathematical Organization Theory, 2006, Volume 12, Number 1, Pages 21-34.
http://dx.doi.org/10.1007/s10588-006-7084-x
[19] Yong Yeon Shin and Jai Sang Koh.An algorithm for generating minimal cutsets of undirected graphs. Journal of Applied Mathematics and Computing, 1998, Volume 5, Number 3, Pages 681-693.
[20] Chang C. Y. Dorea and Ary V. Medino.Anomalous Diffusion Index for Lévy Motions.Journal of Statistical Physics, 2006, Volume 123, Number 3, Pages 685-698.
Full Text: PDF