Geodesic
Properties of random difference graphs
Christopher Ross1
1Ohio State University
The electronic journal of combinatorics, Tome 19 (2012) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Generate a bipartite graph on a partitioned set of vertices by randomly assigning to each vertex $v$ some weight $w(v) \in [0,1]$ and adding an edge between vertices $u$ and $v$ (in distinct parts) if and only if $w(v) + w(v) > 1$; the results of such processes are known as difference graphs.Random difference graphs of a given size can be produced either by uniformly random generation of weights or by choosing a graph uniformly at random from the set of all such graphs. We prove that these two methods give rise to the same distribution, and use this equivalence to find exact results for the likelihood of connectivity and Hamiltonicity. We also find the distribution of other properties, such as matching number and degeneracy.
DOI : 10.37236/2354
Classification : 05C80, 05C70, 05C30, 60C05
Mots-clés : difference graphs, random graphs

Christopher Ross  1

1 Ohio State University 
@article{10_37236_2354,
     author = {Christopher Ross},
     title = {Properties of random difference graphs},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {4},
     doi = {10.37236/2354},
     zbl = {1266.05156},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2354/}
}
TY  - JOUR
AU  - Christopher Ross
TI  - Properties of random difference graphs
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2354/
DO  - 10.37236/2354
ID  - 10_37236_2354
ER  - 
%0 Journal Article
%A Christopher Ross
%T Properties of random difference graphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/2354/
%R 10.37236/2354
%F 10_37236_2354
Christopher Ross. Properties of random difference graphs. The electronic journal of combinatorics, Tome 19 (2012) no. 4. doi: 10.37236/2354

Cité par Sources :