65 search results - page 7 / 13 » Mixing Time of Exponential Random Graphs |
INFOCOM
2011
IEEE
13 years 9 days ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
NIPS
2007
13 years 10 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
Logit Dynamics [Blume, Games and Economic Behavior, 1993] is a randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random a...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...