Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Existence and Construction of Edge-Disjoint Pathson Expander Graphs
SIAM Journal on Computing
Randomized algorithms
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Regular Article: The Diameter of Sparse Random Graphs
Advances in Applied Mathematics
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Approximating Aggregate Queries about Web Pages via Random Walks
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
A General Model of Undirected Web Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Random evolution in massive graphs
Handbook of massive data sets
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The cover time of sparse random graphs
Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
ACM Transactions on Algorithms (TALG)
Adversarial Deletion in a Scale-Free Random Graph Process
Combinatorics, Probability and Computing
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Convergence to equilibrium in local interaction games
ACM SIGecom Exchanges
Random dot product graph models for social networks
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
Parallelism in simulation and modeling of scale-free complex networks
Parallel Computing
How to distribute antidote to control epidemics
Random Structures & Algorithms
Rumour spreading and graph conductance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Why rumors spread so quickly in social networks
Communications of the ACM
The small community phenomenon in networks: models, algorithms and applications
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Random Structures & Algorithms
Approximability of the vertex cover problem in power-law graphs
Theoretical Computer Science
Hi-index | 0.02 |
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the number of nodes. Another immediate implication is constant spectral gap between the first and second eigenvalues of the random walk matrix associated with these graphs. We also show that the expected frugality (overpayment in the Vickrey-Clarke-Groves mechanism for shortest paths) of a sparse Erdos-Renyi random graph is bounded by a small constant.