Results 341 to 350 of about 5,579,561 (370)
Some of the next articles are maybe not open access.
Random trees in a graph and trees in a random graph
Mathematical Proceedings of the Cambridge Philosophical Society, 1986This paper treats two related sets of problems in the theory of random graphs. In Sections 2 and 3 we study random spanning subtrees of a complete graph (or, equivalently, random labelled trees). It is shown that the number of common edges of two such random trees asymptotically has a Poisson distribution with expectation 2.
openaire +2 more sources
International Workshop on Robot Motion and Control, 2015
Unmanned manipulator-equipped satellite could perform on-orbit servicing mission or could be used to remove large space debris from orbit. Planning a manipulator trajectory that will lead to a safe capture of a selected grasping point on the target ...
T. Rybus, K. Seweryn
semanticscholar +1 more source
Unmanned manipulator-equipped satellite could perform on-orbit servicing mission or could be used to remove large space debris from orbit. Planning a manipulator trajectory that will lead to a safe capture of a selected grasping point on the target ...
T. Rybus, K. Seweryn
semanticscholar +1 more source
Studia Scientiarum Mathematicarum Hungarica, 2002
In a one-parameter model for evolution of random trees strong law of large numbers and central limit theorem are proved for the number of vertices with low degree. The proof is based on elementary martingale theory.
openaire +2 more sources
In a one-parameter model for evolution of random trees strong law of large numbers and central limit theorem are proved for the number of vertices with low degree. The proof is based on elementary martingale theory.
openaire +2 more sources
On the profile of random trees
Random Structures and Algorithms, 1997Let T be a plane rooted tree with n nodes which is regarded as family tree of a Galton-Watson branching process conditioned on the total progeny. The profile of the tree may be described by the number of nodes or the number of leaves in layer , respectively. It is shown that these two processes converge weakly to Brownian excursion local time.
Bernhard Gittenberger, Michael Drmota
openaire +2 more sources
1972
A random tree is a probabilistic system much like a random walk. In a random walk, a particle moves up or down as time progresses in accordance with some stochastic law. A random tree, on the other hand, starts with one particle at time zero, this particle branches into a number of particles, each of which move up or down in accordance with a ...
openaire +2 more sources
A random tree is a probabilistic system much like a random walk. In a random walk, a particle moves up or down as time progresses in accordance with some stochastic law. A random tree, on the other hand, starts with one particle at time zero, this particle branches into a number of particles, each of which move up or down in accordance with a ...
openaire +2 more sources
Noble-Metal Based Random Alloy and Intermetallic Nanocrystals: Syntheses and Applications
Chemical Reviews, 2021Ming Zhou, Can Li, Jiye Fang
exaly
Multiparametric prostate magnetic resonance imaging in the evaluation of prostate cancer
Ca-A Cancer Journal for Clinicians, 2016Baris Turkbey +2 more
exaly
Deep neural networks, gradient-boosted trees, random forests: Statistical arbitrage on the S&P 500
European Journal of Operational Research, 2017C. Krauss, Xuan Anh Do, Nicolas Huck
semanticscholar +1 more source
Recent advances in fundamentals and applications of random fiber lasers
Advances in Optics and Photonics, 2015Ilya D Vatnik, Han Wu, Zinan Wang
exaly