Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The b may be vied as a directed graph each of whose vertices is a static HTML b page, and each of whose edges corresponds to a hyperlink from one b page to another.   study the model of random graph (i.e., scale-free random graph process) introduced by Barabasi and Albert and formalized by Bollobas, Riordan, Spencer, and Tusnady, which obey two properties known as por laws for vertex degrees and “small-world phenomenon.” In the paper  give some exact formulas and fair estimations for expectations of the number of vertices of given degree and the degree of given vertex. Moreover, based on Hajek-Renyi inequality  give the rate of concentration of the number of vertices of given degree. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005
['Jerzy Szymański']
I am writing a research paper on a idea Concentration of vertex degrees in a scale-free random graph process
[{"from": "human", "value": "I am writing a research paper on a idea Concentration of vertex degrees in a scale-free random graph process"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The b may be vied as a directed graph each of whose vertices is a static HTML b page, and each of whose edges corresponds to a hyperlink from one b page to another.   study the model of random graph (i.e., scale-free random graph process) introduced by Barabasi and Albert and formalized by Bollobas, Riordan, Spencer, and Tusnady, which obey two properties known as por laws for vertex degrees and \u201csmall-world phenomenon.\u201d In the paper  give some exact formulas and fair estimations for expectations of the number of vertices of given degree and the degree of given vertex. Moreover, based on Hajek-Renyi inequality  give the rate of concentration of the number of vertices of given degree. \u00a9 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005"}]