Web-based Random-Graph Model
(Redirected from Web-based Random Graph)
Jump to navigation
Jump to search
A Web-based Random-Graph Model is a random graph model that is based on Webgraph.
- Example(s):
- a Random Surfing Model,
- ...
- …
- Counter-Example(s):
- See: Directed Acyclic Graph, Hyperlink, World Wide Web, Directed Graph, PageRank.
References
2021a
- (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Random_graph Retrieved:2021-8-14.
- In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability distribution, or by a random process which generates them.[1] [2] The theory of random graphs lies at the intersection between graph theory and probability theory. From a mathematical perspective, random graphs are used to answer questions about the properties of typical graphs. Its practical applications are found in all areas in which complex networks need to be modeled – many random graph models are thus known, mirroring the diverse types of complex networks encountered in different areas. In a mathematical context, random graph refers almost exclusively to the Erdős–Rényi random graph model. In other contexts, any graph model may be referred to as a random graph.
2021b
- (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Webgraph Retrieved:2021-8-14.
- The webgraph describes the directed links between pages of the World Wide Web. A graph, in general, consists of several vertices, some pairs connected by edges. In a directed graph, edges are directed lines or arcs. The webgraph is a directed graph, whose vertices correspond to the pages of the WWW, and a directed edge connects page X to page Y if there exists a hyperlink on page X, referring to page Y.