About: Random tree

An Entity of Type: plant, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics and computer science, a random tree is a tree or arborescence that is formed by a stochastic process. Types of random trees include: * Uniform spanning tree, a spanning tree of a given graph in which each different tree is equally likely to be selected * Random minimal spanning tree, spanning trees of a graph formed by choosing random edge weights and using the minimum spanning tree for those weights * Random binary tree, binary trees with a given number of nodes, formed by inserting the nodes in a random order or by selecting all possible trees uniformly at random * Random recursive tree, increasingly labelled trees, which can be generated using a simple stochastic growth rule. * Treap or randomized binary search tree, a data structure that uses random choices to simul

Property Value
dbo:abstract
  • En théorie des probabilités un arbre aléatoire est un arbre défini en utilisant une loi de probabilité sur un ensemble d'arbres (au sens de graphe). Par exemple, un arbre aléatoire à n nœuds peut être choisi aléatoirement parmi tous les arbres à n nœuds suivant une loi de probabilité, par exemple avec une loi uniforme. Il existe d'autres manières de générer certains arbres particuliers (binaires par exemple). Les arbres de Galton-Watson sont des cas particuliers d'arbres aléatoires. (fr)
  • In mathematics and computer science, a random tree is a tree or arborescence that is formed by a stochastic process. Types of random trees include: * Uniform spanning tree, a spanning tree of a given graph in which each different tree is equally likely to be selected * Random minimal spanning tree, spanning trees of a graph formed by choosing random edge weights and using the minimum spanning tree for those weights * Random binary tree, binary trees with a given number of nodes, formed by inserting the nodes in a random order or by selecting all possible trees uniformly at random * Random recursive tree, increasingly labelled trees, which can be generated using a simple stochastic growth rule. * Treap or randomized binary search tree, a data structure that uses random choices to simulate a random binary tree for non-random update sequences * Rapidly exploring random tree, a fractal space-filling pattern used as a data structure for searching high-dimensional spaces * Brownian tree, a fractal tree structure created by diffusion-limited aggregation processes * Random forest, a machine-learning classifier based on choosing random subsets of variables for each tree and using the most frequent tree output as the overall classification * Branching process, a model of a population in which each individual has a random number of children (en)
  • 在電腦科學和數學裡面,一個隨機樹是一個經由隨機過程建立的樹或者樹狀圖(arborescence)。 隨機樹有以下幾種類別: * (Uniform spanning tree) * 隨機最小生成樹(random minimal spanning tree) * * (Random recursive tree) * Treap或者說隨機二元搜尋樹 * (Rapidly-exploring random tree) * (brownian tree) * 隨機森林 * (zh)
dbo:wikiPageID
  • 22192834 (xsd:integer)
dbo:wikiPageLength
  • 1675 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1123066869 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • En théorie des probabilités un arbre aléatoire est un arbre défini en utilisant une loi de probabilité sur un ensemble d'arbres (au sens de graphe). Par exemple, un arbre aléatoire à n nœuds peut être choisi aléatoirement parmi tous les arbres à n nœuds suivant une loi de probabilité, par exemple avec une loi uniforme. Il existe d'autres manières de générer certains arbres particuliers (binaires par exemple). Les arbres de Galton-Watson sont des cas particuliers d'arbres aléatoires. (fr)
  • 在電腦科學和數學裡面,一個隨機樹是一個經由隨機過程建立的樹或者樹狀圖(arborescence)。 隨機樹有以下幾種類別: * (Uniform spanning tree) * 隨機最小生成樹(random minimal spanning tree) * * (Random recursive tree) * Treap或者說隨機二元搜尋樹 * (Rapidly-exploring random tree) * (brownian tree) * 隨機森林 * (zh)
  • In mathematics and computer science, a random tree is a tree or arborescence that is formed by a stochastic process. Types of random trees include: * Uniform spanning tree, a spanning tree of a given graph in which each different tree is equally likely to be selected * Random minimal spanning tree, spanning trees of a graph formed by choosing random edge weights and using the minimum spanning tree for those weights * Random binary tree, binary trees with a given number of nodes, formed by inserting the nodes in a random order or by selecting all possible trees uniformly at random * Random recursive tree, increasingly labelled trees, which can be generated using a simple stochastic growth rule. * Treap or randomized binary search tree, a data structure that uses random choices to simul (en)
rdfs:label
  • Arbre aléatoire (fr)
  • Random tree (en)
  • 隨機樹 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License