Sciweavers

267 search results - page 3 / 54
» Anti-Ramsey properties of random graphs
Sort
View
EJC
2008
13 years 5 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
13 years 9 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 10 days ago
Random Walk on Directed Dynamic Graphs
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
Oksana Denysyuk, Luis Rodrigues
SDM
2009
SIAM
104views Data Mining» more  SDM 2009»
14 years 2 months ago
On Randomness Measures for Social Networks.
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
Xiaowei Ying, Xintao Wu