2003年 引用6次（第一作者）
http://www.cqvip.com/qk/94832x/200306/7903935.html
题目：基于遗传算法的大规模流量工程问题求解
摘要：研究了大规模网络中的流量工程问题，其实质是在复杂约束条件下的多业务多目标网络流问题。提出了一种经过优化的遗传算法，该算法引入预处理机制，采用启发式变异操作并且采用爆破处理。仿真实验证明，该算法是快速有效的。
期刊：《计算机应用》
~~大二的工作，使自己的第一个研究项目和发表的第一篇研究论文，得知接收的时候，鼻孔都朝天了~~前几天收到一封PR的接收函，只是觉得辛苦了很久的文章终于不用再改了，当年的那种快乐永远都没有了，怀念~~
2004年 引用24次（第一作者）
http://www.mendeley.com/research/modeling-stock-market-based-genetic-cellular-automata/
题目：Modeling Stock Market Based on Genetic Cellular Automata
作者：Tao Zhou, Pei-Ling Zhou, Bing-Hong Wang, Zi-Nan Tang, Jun Liu
摘要：An artificial stock market is established with the modeling method and ideas of cellular automata. Cells are used to represent stockholders, who have the capability of self-teaching and are affected by the investing history of the neighboring ones. The neighborhood relationship among the stockholders is the expanded Von Neumann relationship, and the interaction among them is realized through selection operator and crossover operator. Experiment shows that the large events are frequent in the fluctuations of the stock price generated by the artificial stock market when compared with a normal process and the price returns distribution is a Levy distribution in the central part followed by an approximately exponential truncation.
期刊：International Journal of Modern Physics B
~~绝对的烂文一篇，但是是我的第一篇SCI论文~~我本科论文的倒是周佩玲教授带我去参加第一届海峡两岸统计物理会议，还把自己的邀请报告机会给我，那个时候我才大三~~这篇论文是后来在那个论文集出版的~~在那次会议上，我认识了汪秉宏老师~~
2005年，引用154次（第一作者）
http://pre.aps.org/abstract/PRE/v71/i4/e046141
题目：Maximal planar networks with large clustering coefficient and power-law degree distribution
作者：Tao Zhou, Gang Yan, Bing-Hong Wang
摘要：In this article, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called random Apollonian networks (RANs) as they can be considered as a variation of Apollonian networks. We obtain the analytic results of power-law exponent γ=3 and clustering coefficient C=46/3−36 ln 3/2≈0.74, which agree with the simulation results very well. We prove that the increasing tendency of average distance of RANs is a little slower than the logarithm of the number of nodes in RANs. Since most real-life networks are both scale-free and small-world networks, RANs may perform well in mimicking the reality. The RANs possess hierarchical structure as C(k)∼k−1 that are in accord with the observations of many real-life networks. In addition, we prove that RANs are maximal planar networks, which are of particular practicability for layout of printed circuits and so on. The percolation and epidemic spreading process are also studied and the comparisons between RANs and Barabási-Albert (BA) as well as Newman-Watts (NW) networks are shown. We find that, when the network order N (the total number of nodes) is relatively small (as N∼104), the performance of RANs under intentional attack is not sensitive to N, while that of BA networks is much affected by N. And the diseases spread slower in RANs than BA networks in the early stage of the suseptible-infected process, indicating that the large clustering coefficient may slow the spreading velocity, especially in the outbreaks.
期刊：Physical Review E
~~本科时候最重要的一个工作，开始具备研究生的基本素质了~~当然，这个工作也只是Herrmann小组一个工作的简单跟踪研究，使用的手法和技术也只是很常规的技术，引用文献的选择风格更是完全不符合规范~~
2006年，引用203次（通讯作者）
http://pre.aps.org/abstract/PRE/v73/i4/e046108
题目：Efficient routing on complex networks
作者：Gang Yan, Tao Zhou, Bo Hu, Zhong-Qian Fu, Bing-Hong Wang
摘要：We propose a routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called efficient path, which considers the possible congestion in the nodes along actual paths. Since the nodes with the largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our strategy, can be redistributing traffic load in central nodes to other noncentral nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.
期刊：Physical Review E
~~很艰辛的一篇论文，开始的想法和赵良的很相似，我们刚刚做了，他们就发表了[Onset of trafficcongestion in complex networks]~~后来投到PRL，审了四轮，每次都是一个接收一个不接收，最后在PRE发表，已经耽搁一年了~~事实上后来06年网络方面PRL所有论文里面也只有3篇引用超过200次，都超过不多~~顺便说一句，06年PRE所有复杂网络的文章里面，引用最厉害的是Newman的[Finding community structure in networksusing the eigenvectors of matrices]，751次，内容也确实非同凡响，第二就是我们那篇，已经差很多很多了~~
2007年，引用161次（第一作者）
http://pre.aps.org/abstract/PRE/v76/i4/e046115
题目：Bipartite network projection and personal recommendation
作者：Tao Zhou, Jie Ren, Matus Medo, Yi-Cheng Zhang
摘要：One-mode projecting is extensively used to compress bipartite networks. Since one-mode projection is always less informative than the bipartite representation, a proper weighting method is required to better retain the original information. In this article, inspired by the network-based resource-allocation dynamics, we raise a weighting method which can be directly applied in extracting the hidden information of networks, with remarkably better performance than the widely used global ranking method as well as collaborative filtering. This work not only provides a creditable method for compressing bipartite networks, but also highlights a possible way for the better solution of a long-standing challenge in modern information science: How to do a personal recommendation.
期刊：Physical Review E
~~转型期的工作，结果还特别喜欢，这个文章很巧妙的联系了不同的领域，事实上将来可资应用的空间很大~~这篇文章得到Matus和任捷帮助很大，那个时候这两位都比我先入门，任捷和我一起写了两篇论文，一篇我一作他二作，一篇他一作我二作（08年EPL），后一篇工作我觉得更有内涵也更难，但是受到关注反而少~~我后来的研究很多都和这篇论文有关~~这个文章在2007年网络方面PRE论文中引用暂列第一~~
2008年，引用65次（第一作者）
http://iopscience.iop.org/0295-5075/81/5/58004
题目：Effect of initial configuration on network-based recommendation
作者：Tao Zhou, Luo-Luo Jiang, Ri-Qi Su, Yi-Cheng Zhang
摘要：In this paper, based on a weighted object network, we propose a recommendation algorithm, which is sensitive to the configuration of initial resource distribution. Even under the simplest case with binary resource, the current algorithm has remarkably higher accuracy than the widely applied global ranking method and collaborative filtering. Furthermore, we introduce a free parameter β to regulate the initial configuration of resource. The numerical results indicate that decreasing the initial resource located on popular objects can further improve the algorithmic accuracy. More significantly, we argue that a better algorithm should simultaneously have higher accuracy and be more personal. According to a newly proposed measure about the degree of personalization, we demonstrate that a degree-dependent initial configuration can outperform the uniform case for both accuracy and personalization strength.
期刊：EPL
~~2008年是工作及其糟糕的一年，没有任何可以提的成果，或许就是转型的痛苦期吧~~稍微喜欢一点的，是当年和Kiet, Petter, Holme以及汪老师在EPL的关于人类动力学的工作[Role of activity in human dynamics]，可惜以5个引用之差排在第二位~~
2009年，引用52次（第一作者）
http://www.springerlink.com/content/3163573586j84727/
题目：Predicting missing links via local information
作者：Tao Zhou, Linyuan Lu, Yi-Cheng Zhang
摘要：Missing link prediction in networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate a simple framework of link prediction on the basis of node similarity. We compare nine well-known local similarity measures on six real networks. The results indicate that the simplest measure, namely Common Neighbours, has the best overall performance, and the Adamic-Adar index performs second best. A new similarity measure, motivated by the resource allocation process taking place on networks, is proposed and shown to have higher prediction accuracy than common neighbours. It is found that many links are assigned the same scores if only the information of the nearest neighbours is used. We therefore design another new measure exploiting information on the next nearest neighbours, which can remarkably enhance the prediction accuracy.
期刊：European Physical Journal B
~~链路预测的第一篇，也是我非常喜欢的一篇论文，里面有些节点相似性指标微创新，但是这些微创新现在被正面在社团挖掘、含权网络刻画、个性化推荐等等方面的确具有优势，而且已经有了大规模的商业化应用~~虽然期刊很一般，而且是一篇会议论文，但是发表的时候我觉得这个文章应该还不错的~~再看几年吧~~
2010年，引用63次（第一作者）
http://www.pnas.org/content/107/10/4511.short
题目：Solving the apparent diversity-accuracy dilemma of recommender systems
作者：Tao Zhou, Zoltán Kuscsik, Jian-Guo Liu, Matúš Medo, Joseph Rushton Wakeling, Yi-Cheng Zhang
摘要：Recommender systems use data on past user preferences to predict possible future likes and interests. A key challenge is that while the most useful individual recommendations are to be found among diverse niche objects, the most reliably accurate results are obtained by methods that recommend objects based on user or object similarity. In this paper we introduce a new algorithm specifically to address the challenge of diversity and show how it can be used to resolve this apparent dilemma when combined in an elegant hybrid with an accuracy-focused algorithm. By tuning the hybrid appropriately we are able to obtain, without relying on any semantic or context-specific information, simultaneous gains in both accuracy and diversity of recommendations.
期刊：PNAS
~~这个文章显然没有2007年的PRE重要，但是它是那篇文章的一个姐妹篇，实际上那篇文章提出了哥哥算法（守恒扩散），这篇文章给出了耦合的弟弟算法（不守恒的热传导）~~兄弟齐心，其利断金~~真正能够拿得上台面（在数学物理上保持优美性，比如哥哥算法和弟弟算法的Markov概率转移矩阵是互为转置的）的解决信息挖掘多样性问题的，这是第一篇，目前还是唯一的一篇~~值得一提的是，2010年和子柯在Physica A上发表了我们关于Social Tagging Systems的第一篇论文，也获得了50次应用，很多来自顶尖会议和领域顶级期刊，很厉害的哦~~所以内容还是比期刊重要~~
2011年，引用30次（通讯作者）
http://www.sciencedirect.com/science/article/pii/S037843711000991X
题目：Link prediction in complex networks: A survey
作者：Linyuan Lu, Tao Zhou
摘要：Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, and so on. This article summaries recent progress about link prediction algorithms, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods. We also introduce three typical applications: reconstruction of networks, evaluation of network evolving mechanism and classification of partially labeled networks. Finally, we introduce some applications and outline future challenges of link prediction algorithms.
期刊：Physica A
~~花了很大力气的文章，因为是综述，所以引用会多一点，但是11年正式发表，到12年就有30个引用，还是超过我们预期的~~说明我们在链路预测方面2年多的工作还是得到了一定程度的认可~~写综述的时候我和琳媛在链路预测方向上实力差不多，现在她应该强于我了~~我撰写了一、四、七章和第六章的一、二节，琳媛写了二、三、五章和第六章的第三节。
