Sciweavers

267 search results - page 4 / 54
» Anti-Ramsey properties of random graphs
Sort
View
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
13 years 12 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
14 years 6 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 5 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 6 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
LATA
2010
Springer
14 years 3 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann