Sciweavers

70 search results - page 3 / 14
» Degree sequence and supereulerian graphs
Sort
View
RSA
2006
110views more  RSA 2006»
13 years 7 months ago
The degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
Jonathan Jordan
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
ARSCOM
2007
81views more  ARSCOM 2007»
13 years 7 months ago
Graphic Sequences with a Realization Containing a Friendship Graph
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
Michael Ferrara, Ronald J. Gould, John R. Schmitt
TIT
2002
77views more  TIT 2002»
13 years 7 months ago
Capacity-achieving sequences for the erasure channel
Abstract-- This paper starts a systematic study of capacityachieving sequences of low-density parity-check codes for the erasure channel. We introduce a class Aof analytic function...
P. Oswald, A. Shokrollahi