Sciweavers

267 search results - page 2 / 54
» Anti-Ramsey properties of random graphs
Sort
View
MFCS
2007
Springer
13 years 11 months ago
Expander Properties and the Cover Time of Random Intersection Graphs
Sotiris E. Nikoletseas, Christoforos Raptopoulos, ...
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
13 years 11 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
13 years 6 months ago
On properties of random dissections and triangulations
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
CAI
2007
Springer
13 years 11 months ago
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
Sotiris E. Nikoletseas, Christoforos Raptopoulos, ...
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 5 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty