17 citations · 64 across the 23 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.FA2016★ 1 cited
The log-Sobolev inequality with quadratic interactions
Ioannis Papageorgiou
We assume one site measures without a boundary that satisfy a log-Sobolev inequality. We prove that if these measures are perturbed with quadratic interactions, the…
math.PR2016★ 1 cited
Cutoff for random walks on graphs with bottlenecks
Ioannis Papageorgiou
We examine the mixing time for random walks on graphs. In particular we are interested on investigating graphs with bottlenecks. Furthermore, the cutoff phenomenon is examined.