Statistical and Machine Learning Approaches for Network Analysis

References

1. B. Bollobás, Random Graphs, 2nd edn. Cambridge University Press, Cambridge, UK, 2001.

2. S. Janson, T. Łuczak, A. Rucinski, Random Graphs, Wiley, New York, 2000.

3. S. Janson, D.E. Knuth, T. Łuczak, B. Pittel. The birth of the giant component. Random Struct. Algor. 4(3), 233–359 (1993).

4. J. Blasiak, R. Durrett, Random oxford graphs. Stochastic Process. Appl. 115(8), 1257–1278 (2005).

5. R. Pagh, F.F. Rodler. Cuckoo hashing. J. Algorithms 51(2), 122–144 (2004).

6. L. Devroye, P. Morin, Cuckoo hashing: further analysis. Inform. Process. Lett. 86(4), 215–219 (2003).

7. M. Drmota, R. Kutzelnigg, A precise analysis of cuckoo hashing. ACM Trans. Algorithms 8(2), (2012).

8. A. Kirsch, M. Mitzenmacher, U. Wieder, More robust hashing: cuckoo hashing with a stash, in Proceedings of the 16th Annual European Symposium on Algorithms, 2008.

9. R. Kutzelnigg, Bipartite random graphs and cuckoo hashing, in Proceedings of the 4th Colloquium on Mathematics and Computer Science, Discrete Mathematics and Theoretical Computer Science, pp. 403–406, 2006.

10. R. Kutzelnigg, Random Graphs and Cuckoo Hashing, Südwestdeutscher Verlag für Hochschulschriften, Saarbrücken, 2009.

11. R. Kutzelnigg, A further analysis of cuckoo hashing with a stash and random graphs of excess r. DMTCS 12(3), 81–102 (2010).

12. R. Kutzelnigg, An improved version of cuckoo hashing: average case analysis of construction cost and search operations. Math. Comput. Sci. 3(1), 47–60 (2010).

13. P. Flajolet, D.E. Knuth, ...