期刊文献+

基于复杂网络点度统计量的大学生就业区域流向分析

Analysis of the Regional Flow Direction of College Students’ Employment Based on Complex Network Node Statistics
原文传递
导出
摘要 通过近年吉林省普通高校毕业生(以下简称"毕业生")的就业相关数据统计对比发现,毕业的就业流向区域差异性明显,且各区域之间流入、流出的毕业生比例相对稳定。毕业生就业区域流向是大学生就业研究领域的重要分支,是毕业生就业状况分析的重要组成部分,其中存在的原因和规律值得深入探究。本次研究主要以复杂网络理论中节点度的统计量作为分析工具,为毕业生就业区域流向研究提供新的分析视角。 Through the statistical comparison of the employment data of college graduates in recent years,it is found that there are obvious differences in the flow direction of graduates from different regions,and the number and proportion of graduates flowing in and out of each region are relatively stable.The regional flow of graduates’employment is an important branch of the research field of College students’employment,and an important part of the analysis of the employment situation of graduates.The reasons and rules of the regional flow direction of graduates’employment are worthy of further exploration.Based on the calculation and analysis method of node degree correlation in complex network,this paper provides a new perspective for the analysis of regional flow direction of graduates’employment.
作者 王颖 郝亚光 WANG Ying;HAO Ya-guang
出处 《中国大学生就业》 2021年第8期53-57,共5页 China University Students Career Guide
关键词 大学生就业 复杂网络 点度分布 区域流向 College students’employment complex network node degree distribution regional flow direction
  • 相关文献

参考文献2

二级参考文献26

  • 1陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:89
  • 2段凡丁.关于最短路径的SPFA快速算法[J].西南交通大学学报,1994,29(2):207-212. 被引量:57
  • 3王林,张婧婧.复杂网络的中心化[J].复杂系统与复杂性科学,2006,3(1):13-20. 被引量:61
  • 4谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 5CALLAWAY D S,NEWMAN M E J,STROGATEZ SH,et al. Network robustness and fragility:percolationon random graphs[J]. Phys. Rev. Lett. , 2000,85(25):5468-5471.
  • 6BRIN S, PAGE L. The anatomy of a largescalehypertextual web search engine[J]. Computer Networks& ISDN Systems,1998,30:107-117.
  • 7KLEINBERG J M. Authoritative sources in ahyperlinked environment[C]∥Proceedings of the NinthAnnual ACMSIAM Symposium on Discrete Algorithms,SODA 98, Society for Industrial and AppliedMathematics. Philadelphia:[s. n.],1998:668-677.
  • 8CORLEY H W,SHA D Y. Most vital links and nodesin weighted networks[J]. Operations Research Letters,1982,1(4):157-160.
  • 9NARDELLI E,PROIETTI G,WIDMAYER P. Findingthe most vital node of a shortest path[J]. TheoreticalComputer Science,2001,296(1):167-177.
  • 10CHEN Duanbing,L Linyuan. SHANG Mingsheng,etal. Identifying influential nodes in complexnetworks[J]. Physica A,2012,391(4):1777-1787.

共引文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部