Random subgraphs of finite graphs: I. The scaling window under the triangle condition.
Christian BorgsJennifer T. ChayesRemco van der HofstadGordon SladeJoel H. SpencerPublished in: Random Struct. Algorithms (2005)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph structures
- reachability queries
- subgraph matching
- labeled graphs
- graph properties
- maximum common subgraph
- connected subgraphs
- subgraph mining
- sufficient conditions
- graph patterns
- graph data
- query graph
- sliding window
- graph matching
- topological information
- graph theoretic
- window size
- frequent subgraph mining
- pattern mining
- data structure
- finite number
- dense subgraphs
- directed graph
- frequent subgraphs
- pattern discovery
- link prediction
- graph theory
- functional modules
- graph structure
- regular expressions
- quasi cliques
- graph clustering