65 search results - page 4 / 13 » Mixing Time of Exponential Random Graphs |
114
Voted
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
83
Voted
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
104
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
168
click to vote
COR
2011
14 years 7 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
121
click to vote
RSA
2010
14 years 10 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...