INFOCOM
2012
IEEE
12 years 1 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
INFOCOM
2012
IEEE
12 years 1 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
STACS
2012
Springer
12 years 6 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
CN
2010
13 years 7 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
RSA
2010
13 years 9 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
JDWM
2010
13 years 9 months ago
2010
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
TCAD
2002
13 years 10 months ago
2002
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
AML
1999
13 years 10 months ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...
COMBINATORICS
2000
13 years 10 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...