Results 301 to 310 of about 1,095,825 (329)
Some of the next articles are maybe not open access.

On the asymmetry of random regular graphs and random graphs

Random Structures & Algorithms, 2002
AbstractThis paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the random d‐regular graph on n vertices almost surely has no nontrivial automorphisms. This answers an open question of N. Wormald [13]. © 2002 Wiley Periodicals, Inc. Random Struct.
Jeong Han Kim, Van Vu, Benny Sudakov
openaire   +2 more sources

Measures on the Random Graph

Journal of the London Mathematical Society, 1994
Abstract: "We consider the problem of characterizing the finitely additive probability measures on the definable subsets of the random graph which are invariant under the action of the automorphism group of this graph. We show that such measures are all integrals of Bernoulli measures (which arise from the coin-flipping model of the construction of the
openaire   +2 more sources

Random trees in a graph and trees in a random graph

Mathematical Proceedings of the Cambridge Philosophical Society, 1986
This 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

Random graphs

Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006
We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.
openaire   +2 more sources

The phase transition in random graphs and random graph processes

2007
Zufallsgraphen sind Graphen, die durch einen zufälligen Prozess erzeugt werden. Ein im Zusammenhang mit Zufallsgraphen häufig auftretendes Phänomen ist, dass sich die typischen Eigenschaften eines Graphen durch Hinzufügen einer relativ kleinen Anzahl von zufälligen Kanten radikal verändern. Wir betrachten den Zufallsgraphen G(n,p), der n Knoten enthält
openaire   +3 more sources

Multiparametric prostate magnetic resonance imaging in the evaluation of prostate cancer

Ca-A Cancer Journal for Clinicians, 2016
Baris Turkbey   +2 more
exaly  

Recent advances in fundamentals and applications of random fiber lasers

Advances in Optics and Photonics, 2015
Ilya D Vatnik, Han Wu, Zinan Wang
exaly  

Home - About - Disclaimer - Privacy