Sciweavers

113 search results - page 1 / 23
» Rigid Components of Random Graphs
Sort
View
CCCG
2009
13 years 6 months ago
Rigid Components of Random Graphs
We study the emergence of rigid components in an Erdos-R
Louis Theran
CPC
2007
76views more  CPC 2007»
13 years 4 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
JGT
2007
112views more  JGT 2007»
13 years 4 months ago
The 2-dimensional rigidity of certain families of graphs
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius
ALGORITHMICA
2007
82views more  ALGORITHMICA 2007»
13 years 5 months ago
Rigid Components in Molecular Graphs
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
Bill Jackson, Tibor Jordán
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 5 months ago
Component structure induced by a random walk on a random graph
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
Colin Cooper, Alan M. Frieze