5606 search results - page 108 / 1122 » Randomization Techniques for Graphs. |
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
JMLR
2008
13 years 9 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
CPHYSICS
2011
13 years 1 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
AICCSA
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...