33 citations · 75 across the 13 of their papers we have counts for
16 papers
Boosted second moment method in random regular graphs
Balázs Gerencsér, Viktor Harangi
Determining the asymptotic independence ratio of random regular graphs is a key challenge in the area of sparse random graphs. Due to the interpolation method, we have very good up…
RSB bounds on the maximum cut
Viktor Harangi
In the context of random regular graphs, the size of the maximum cut is probably the second most studied graph parameter after the independence ratio. Zdeborová and Boettcher used…
Conditional graph entropy as an alternating minimization problem
Viktor Harangi, Xueyan Niu, Bo Bai
Conditional graph entropy is known to be the minimal rate for a natural functional compression problem with side information at the receiver. In this paper we show that it can be f…
Generalizing Körner's graph entropy to graphons
Viktor Harangi, Xueyan Niu, Bo Bai
Körner introduced the notion of graph entropy in 1973 as the minimal code rate of a natural coding problem where not all pairs of letters can be distinguished in the alphabet. Late…
Improved replica bounds for the independence ratio of random regular graphs
Viktor Harangi
Studying independent sets of maximum size is equivalent to considering the hard-core model with the fugacity parameter tending to infinity. Finding the independence ratio of ra…
Entropy and expansion
Endre Csóka, Viktor Harangi, Bálint Virág
Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individ…