Title:
Inapproximability of the Independent Set Polynomial in the Complex Plane
Inapproximability of the Independent Set Polynomial in the Complex Plane
| dc.contributor.author | Štefankovič, Daniel | |
| dc.contributor.corporatename | Georgia Institute of Technology. Algorithms, Randomness and Complexity Center | en_US |
| dc.contributor.corporatename | University of Rochester. School of Engineering and Applied Sciences | en_US |
| dc.date.accessioned | 2018-05-25T13:05:53Z | |
| dc.date.available | 2018-05-25T13:05:53Z | |
| dc.date.issued | 2018-05-17 | |
| dc.description | Presented as part of the Workshop on Algorithms and Randomness on May 17, 2018 at 2:00 p.m. in the Klaus Advanced Computing Building, Room 1116. | en_US |
| dc.description | Daniel Štefankovič is an Associate Professor in the Department of Computer Science at University of Rochester. He received a PhD from the University of Chicago in 2005 and a BS from Comenius University in 1998. His research interests include graph drawing, counting and sampling, coding theory, mathematical modeling in biology, and learning theory. | en_US |
| dc.description | Runtime: 39:30 minutes | en_US |
| dc.description.abstract | Hard-core model (also known as independent set polynomial) is one of the simplest models in statistical physics. The complexity of approximating the value of the partition function of the model on max-degree-Delta graphs (and also sampling from the Gibbs distribution) is now understood for positive values of the parameter (Weitz'2005, Sly'2009)---the complexity threshold aligns with the uniqueness/non-uniqueness threshold for the existence of multiple Gibbs measures on Delta-regular tree. In the case of complex parameter the complexity of approximating the partition function is not yet understood---the complexity threshold appears to align with the existence of zeros of the partition function on trees of max-degree-Delta. We show that outside of the conjectured zero-free region the problem of approximating the value of the partition function is hard (#P-hard). Joint work with Ivona Bezakova, Andreas Galanis, and Leslie Ann Goldberg. | en_US |
| dc.format.extent | 39:30 minutes | |
| dc.identifier.uri | http://hdl.handle.net/1853/59725 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | Workshop on Algorithms and Randomness 2018 | |
| dc.subject | Algorithms | en_US |
| dc.subject | Complex plane | en_US |
| dc.subject | Gibbs | en_US |
| dc.title | Inapproximability of the Independent Set Polynomial in the Complex Plane | en_US |
| dc.type | Moving Image | |
| dc.type.genre | Lecture | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | Algorithms and Randomness Center | |
| local.contributor.corporatename | College of Computing | |
| local.relation.ispartofseries | ARC Colloquium | |
| relation.isOrgUnitOfPublication | b53238c2-abff-4a83-89ff-3e7b4e7cba3d | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isSeriesOfPublication | c933e0bc-0cb1-4791-abb4-ed23c5b3be7e |
Files
Original bundle
1 - 3 of 3
No Thumbnail Available
- Name:
- stefankovic.mp4
- Size:
- 313.14 MB
- Format:
- MP4 Video file
- Description:
- Download video
No Thumbnail Available
- Name:
- stefankovic_videostream.html
- Size:
- 1.01 KB
- Format:
- Hypertext Markup Language
- Description:
- Streaming video
No Thumbnail Available
- Name:
- transcription.txt
- Size:
- 27.5 KB
- Format:
- Plain Text
- Description:
- Transcription
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 3.13 KB
- Format:
- Item-specific license agreed upon to submission
- Description: