Sciweavers

CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 3 months ago
The Degree Sequence of Random Apollonian Networks
We analyze the asymptotic behavior of the degree sequence of Random Apollonian Networks [11]. For previous weaker results see [10, 11].
Charalampos E. Tsourakakis
RSA
2006
110views more  RSA 2006»
13 years 11 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
JGT
2008
77views more  JGT 2008»
13 years 11 months ago
Graph classes characterized both by forbidden subgraphs and degree sequences
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
Michael D. Barrus, Mohit Kumbhat, Stephen G. Hartk...
IM
2006
13 years 11 months ago
Protean Graphs
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the c...
Tomasz Luczak, Pawel Pralat
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
13 years 11 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald
DM
2008
88views more  DM 2008»
13 years 11 months ago
Degree sequence and supereulerian graphs
A sequence d = (d1, d2,
Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhan...
DAM
2008
145views more  DAM 2008»
13 years 11 months ago
Unicyclic and bicyclic graphs having minimum degree distance
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
Alexandru Ioan Tomescu
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 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...
ALGORITHMICA
2007
93views more  ALGORITHMICA 2007»
13 years 11 months ago
Random 2-SAT with Prescribed Literal Degrees
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
14 years 23 days ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum