About: Random tree     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatRandomGraphs, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/c/NKqQiaTzE

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

AttributesValues
rdf:type
rdfs:label
  • Arbre aléatoire (fr)
  • Random tree (en)
  • 隨機樹 (zh)
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)
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has 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)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git147 as of Sep 06 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 55 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software