Approximate Sampling of Graphs with Near-P-stable Degree Intervals.
Péter L. ErdösTamás Róbert MezeiIstván MiklósPublished in: CoRR (2022)
Keyphrases
- random graphs
- uniform random
- random sampling
- graph matching
- temporal events
- graph theory
- graph representation
- monte carlo
- directed graph
- graph mining
- graph model
- graph theoretic
- power law
- graph clustering
- sampling methods
- degree distribution
- exact solution
- graph data
- data mining
- nearest neighbor
- probability distribution
- data streams