1591 search results - page 79 / 319 » Random lifts of graphs |
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
163
click to vote
PAKDD
2009
ACM
16 years 3 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
145
click to vote
SIGECOM
2006
ACM
16 years 8 days 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...
212
click to vote
JMLR
2008
15 years 6 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...
194
click to vote
CPHYSICS
2011
14 years 9 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...