Sciweavers

1542 search results - page 74 / 309
» The metamathematics of random graphs
Sort
View
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 4 months ago
Eigenvectors of Random Graphs: Nodal Domains
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
Yael Dekel, James R. Lee, Nathan Linial
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
15 years 7 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
15 years 2 months ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 4 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips
DM
2010
140views more  DM 2010»
14 years 10 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield