Bora, Ashish and Borkar, VS and Garg, Dinesh and Sundaresan, Rajesh (2017) Edge Conductance Estimation Using MCMC. In: 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), SEP 27-30, 2016, Monticello, IL, pp. 202-208.
PDF
2016_54th_Ann_All_Con_Com_Con_Com_202.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy |
Official URL: http://dx.doi.org/10.1109/ALLERTON.2016.7852230
Abstract
We propose an iterative and distributed Markov Chain Monte Carlo scheme for estimation of effective edge conductances in a graph. A sample complexity analysis is provided. The theoretical guarantees on the performance of the proposed algorithm are weak compared to those of existing algorithms. But numerical experiments suggest that the algorithm might still be effective while offering the advantages of low per iterate computation and memory requirements.
Item Type: | Conference Proceedings |
---|---|
Series.: | Annual Allerton Conference on Communication Control and Computing |
Publisher: | IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA |
Additional Information: | 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, SEP 27-30, 2016 |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 10 Jun 2017 04:41 |
Last Modified: | 27 Feb 2019 10:18 |
URI: | http://eprints.iisc.ac.in/id/eprint/57203 |
Actions (login required)
View Item |