Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
This paper discusses the techniques of performing distributed page ranking on top of structured peer-to-peer networks. Distributed page ranking are needed because the size of the ...
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...