Intrinsic Degree: An Estimator of the Local Growth Rate in Graphs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 11223 LNCS, Page: 195-208
2018
- 2Citations
- 1Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
The neighborhood size of a query node in a graph often grows exponentially with the distance to the node, making a neighborhood search prohibitively expensive even for small distances. Estimating the growth rate of the neighborhood size is therefore an important task in order to determine an appropriate distance for which the number of traversed nodes during the search will be feasible. In this work, we present the intrinsic degree model, which captures the growth rate of exponential functions through the analysis of the infinitesimal vicinity of the origin. We further derive an estimator which allows to apply the intrinsic degree model to graphs. In particular, we can locally estimate the growth rate of the neighborhood size by observing the close neighborhood of some query points in a graph. We evaluate the performance of the estimator through experiments on both artificial and real networks.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85055120405&origin=inward; http://dx.doi.org/10.1007/978-3-030-02224-2_15; https://link.springer.com/10.1007/978-3-030-02224-2_15; https://dx.doi.org/10.1007/978-3-030-02224-2_15; https://link.springer.com/chapter/10.1007/978-3-030-02224-2_15
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know