260 search results - page 13 / 52 » Dynamic Random Geometric Graphs |
151
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
165
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
141
click to vote
PAM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
145
click to vote
ICNP
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
135
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...