Sciweavers

37 search results - page 1 / 8
» Asymptotic equivalence and contiguity of some random graphs
Sort
View
RSA
2010
118views more  RSA 2010»
12 years 11 months ago
Asymptotic equivalence and contiguity of some random graphs
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
Svante Janson
CPC
2002
95views more  CPC 2002»
13 years 4 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
RSA
2010
89views more  RSA 2010»
13 years 3 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
CPC
1998
154views more  CPC 1998»
13 years 4 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson
RSA
2010
104views more  RSA 2010»
13 years 3 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson