1,068
个编辑
更改
无编辑摘要
== 概况==
== 概况==
保罗·埃尔德什Paul Erdős(1913年至1996年）是一位在业界产生有影响力的匈牙利数学家，其一生中大量的时间都在与很多同事合作撰写论文，致力于解决困扰已久的疑难数学问题。<ref name="newman2001">{{cite journal|last=Newman|first=Mark E. J.|title=The structure of scientific collaboration networks|journal=[[Proceedings of the National Academy of Sciences of the United States of America]]| year=2001| doi=10.1073/pnas.021544898| volume=98|issue=2|pages=404–409|pmid=11149952|pmc=14598}}</ref> 他一生中所发表的论文（至少1,525篇<ref>{{cite web |url=http://www.oakland.edu/enp/pubinfo/ |title=Publications of Paul Erdős | first=Jerry | last=Grossman |access-date=1 Feb 2011}}</ref>）比历史上其他任何数学家都多<ref name="newman2001"/>。莱昂哈德·欧拉Leonhard Euler发表过的数学论文页数更多，但单独的论文却较少（大约800篇）。<ref>{{cite web| url=https://www.math.dartmouth.edu/~euler/FAQ.html| work=The Euler Archive| title=Frequently Asked Questions| publisher=Dartmouth College}}</ref>而埃尔德什的大部分时间都在旅居中，其拜访过全球500多个合作者。
保罗·埃尔德什Paul Erdős(1913年至1996年）是一位在业界产生有影响力的匈牙利数学家，其一生中大量的时间都在与很多同事合作撰写论文，致力于解决困扰已久的疑难数学问题。<ref name="newman2001">{{cite journal|last=Newman|first=Mark E. J.|title=The structure of scientific collaboration networks|journal=Proceedings of the National Academy of Sciences of the United States of America| year=2001| doi=10.1073/pnas.021544898| volume=98|issue=2|pages=404–409|pmid=11149952|pmc=14598}}</ref> 他一生中所发表的论文（至少1,525篇<ref>{{cite web |url=http://www.oakland.edu/enp/pubinfo/ |title=Publications of Paul Erdős | first=Jerry | last=Grossman |access-date=1 Feb 2011}}</ref>）比历史上其他任何数学家都多<ref name="newman2001"/>。莱昂哈德·欧拉Leonhard Euler发表过的数学论文页数更多，但单独的论文却较少（大约800篇）。<ref>{{cite web| url=https://www.math.dartmouth.edu/~euler/FAQ.html| work=The Euler Archive| title=Frequently Asked Questions| publisher=Dartmouth College}}</ref>而埃尔德什的大部分时间都在旅居中，其拜访过全球500多个合作者。
|volume = 21
|volume = 21
|year = 1999
|year = 1999
|url-status = dead
|url-status = dead
|archive-url = https://web.archive.org/web/20150924054224/http://www.oakland.edu/upload/docs/Erdos%20Number%20Project/trails.pdf
|archive-url = https://web.archive.org/web/20150924054224/http://www.oakland.edu/upload/docs/Erdos%20Number%20Project/trails.pdf
=== 语言学领域 ===
=== 语言学领域 ===
罗马尼亚数学家和计算语言学家Solomon Marcus在1957年与埃尔德什合作了《 Acta Mathematica Hungarica》中的一篇论文，因此他的埃尔德什数为1。<ref>{{cite journal|first1=Paul|last1= Erdős |author1-link=Paul Erdős|first2= Solomon|last2= Marcus|author2-link=Solomon Marcus| year=1957|title= Sur la décomposition de l'espace euclidien en ensembles homogènes |trans-title= On the decomposition of the Euclidean space into homogeneous sets|journal=[[Acta Mathematica Hungarica]]|volume=8|issue= 3–4 |pages=443–452|mr=0095456|doi=10.1007/BF02020326|s2cid= 121671198 }}</ref>
罗马尼亚数学家和计算语言学家Solomon Marcus在1957年与埃尔德什合作了《 Acta Mathematica Hungarica》中的一篇论文，因此他的埃尔德什数为1。<ref>{{cite journal|first1=Paul|last1= Erdős |author1-link=Paul Erdős|first2= Solomon|last2= Marcus|author2-link=Solomon Marcus| year=1957|title= Sur la décomposition de l'espace euclidien en ensembles homogènes |trans-title= On the decomposition of the Euclidean space into homogeneous sets|journal=[[Acta Mathematica Hungarica]]|volume=8|issue= 3–4 |pages=443–452|mr=0095456|doi=10.1007/BF02020326 }}</ref>
马丁·汤帕 Martin Tompa<ref>{{cite journal|last=Tompa|first=Martin|title=Figures of merit|journal=ACM SIGACT News|volume=20|issue=1|pages=62–71|year=1989|doi=10.1145/65780.65782|s2cid=34277380}} {{cite journal|last=Tompa|first= Martin|title=Figures of merit: the sequel|journal=ACM SIGACT News|volume=21|issue=4|pages=78–81|year=1990|doi=10.1145/101371.101376|s2cid= 14144008}}</ref> 提出了埃尔德什数问题的有向图版本，通过定向协作图，将字母顺序更早的作者到字母顺序更晚的作者进行排列，并将作者的单调埃尔德什数定义为该有向图中从埃尔德什到作者的最长路径的长度。他发现这种路径长度为12。
马丁·汤帕 Martin Tompa<ref>{{cite journal|last=Tompa|first=Martin|title=Figures of merit|journal=ACM SIGACT News|volume=20|issue=1|pages=62–71|year=1989|doi=10.1145/65780.65782}} {{cite journal|last=Tompa|first= Martin|title=Figures of merit: the sequel|journal=ACM SIGACT News|volume=21|issue=4|pages=78–81|year=1990|doi=10.1145/101371.101376}}</ref> 提出了埃尔德什数问题的有向图版本，通过定向协作图，将字母顺序更早的作者到字母顺序更晚的作者进行排列，并将作者的单调埃尔德什数定义为该有向图中从埃尔德什到作者的最长路径的长度。他发现这种路径长度为12。
有人提出：“对于独立研究人员而言，诸如埃尔德什数之类的量度可以捕获网络的结构特性，而''h''指数则可以捕获出版物的引文影响。” 并且“可以很容易地使人相信，共同作者网络中的排名应该同时考虑到两种方法，以产生现实且可接受的排名。”<ref name=Dixit>Kashyap Dixit, S Kameshwaran, Sameep Mehta, Vinayaka Pandit, N Viswanadham, ''[http://domino.research.ibm.com/library/cyberdig.nsf/papers/2B600A90C54E51B18525755800283D37/$File/RR_ranking.pdf Towards simultaneously exploiting structure and outcomes in interaction networks for node ranking]'', IBM Research Report R109002, February 2009; also appeared as {{Cite journal | doi = 10.1145/1871437.1871470| last1 = Kameshwaran | first1 = S. | last2 = Pandit | first2 = V. | last3 = Mehta | first3 = S. | last4 = Viswanadham | first4 = N. | last5 = Dixit | first5 = K. | title = Outcome aware ranking in interaction networks | pages = 229–238| year = 2010 | isbn = 978-1-4503-0099-5| journal = Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM '10)| s2cid = 16370569| url = http://www.cse.iitd.ernet.in/%7Epandit/cikm_camera_ready.pdf}}</ref>
有人提出：“对于独立研究人员而言，诸如埃尔德什数之类的量度可以捕获网络的结构特性，而''h''指数则可以捕获出版物的引文影响。” 并且“可以很容易地使人相信，共同作者网络中的排名应该同时考虑到两种方法，以产生现实且可接受的排名。”<ref name=Dixit>Kashyap Dixit, S Kameshwaran, Sameep Mehta, Vinayaka Pandit, N Viswanadham, ''[http://domino.research.ibm.com/library/cyberdig.nsf/papers/2B600A90C54E51B18525755800283D37/$File/RR_ranking.pdf Towards simultaneously exploiting structure and outcomes in interaction networks for node ranking]'', IBM Research Report R109002, February 2009; also appeared as {{Cite journal | doi = 10.1145/1871437.1871470| last1 = Kameshwaran | first1 = S. | last2 = Pandit | first2 = V. | last3 = Mehta | first3 = S. | last4 = Viswanadham | first4 = N. | last5 = Dixit | first5 = K. | title = Outcome aware ranking in interaction networks | pages = 229–238| year = 2010 | isbn = 978-1-4503-0099-5| journal = Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM '10)| url = http://www.cse.iitd.ernet.in/%7Epandit/cikm_camera_ready.pdf}}</ref>