Exact and Efficient Generation of Geometric Random Variates and Random Graphs

DOI10.1007/978-3-642-39206-1_23zbMath1336.05114OpenAlexW1756477312MaRDI QIDQ5326567

Tobias Friedrich, Karl Bringmann

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_23

zbMATH Keywords

Erdős-Rényi random graphsRAM model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Efficient sampling methods for discrete distributions, A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence, Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules, The cost of randomness in evolutionary algorithms: crossover can save random bits, Geometric inhomogeneous random graphs, Exact sublinear binomial sampling, Sampling Geometric Inhomogeneous Random Graphs in Linear Time

Uses Software

• LEDA