Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the expected payment of mechanisms for task allocation: [extended abstract]
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
On the expected payment of mechanisms for task allocation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the scaling of congestion in the internet graph
ACM SIGCOMM Computer Communication Review
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
Proceedings of the 6th ACM conference on Electronic commerce
Proceedings of the 6th ACM conference on Electronic commerce
Isomorphism and embedding problems for infinite limits of scale-free graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Adversarial deletion in a scale free random graph process
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The cover time of two classes of random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Brief announcement: on the expected overpayment of VCG mechanisms in large networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Radio communication in random graphs: extended abstract
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
How much can taxes help selfish routing?
Journal of Computer and System Sciences - Special issue on network algorithms 2005
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Random walk based node sampling in self-organizing networks
ACM SIGOPS Operating Systems Review
The cover time of the preferential attachment graph
Journal of Combinatorial Theory Series B
Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Linked decompositions of networks and the power of choice in Polya urns
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the hardness of optimization in power-law graphs
Theoretical Computer Science
Long-range percolation mixing time
Combinatorics, Probability and Computing
Gossiping (via mobile?) in social networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Fault tolerant mechanism design
Artificial Intelligence
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph
Rumor Spreading in Social Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Average-Case Analyses of Vickrey Costs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A geometric preferential attachment model of networks II
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Anonymity in the wild: mixes on unstructured networks
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Privacy amplification with social networks
Proceedings of the 15th international conference on Security protocols
Random Walks with Look-Ahead in Scale-Free Random Graphs
SIAM Journal on Discrete Mathematics
Rumor spreading in social networks
Theoretical Computer Science
First-passage percolation on a width-2 strip and the path cost in a VCG auction
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Some typical properties of the spatial preferred attachment model
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
On the hardness of optimization in power law graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Opinion Fluctuations and Disagreement in Social Networks
Mathematics of Operations Research
| Hi-index | 0.00 |
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 random graph is bounded by a small constant.