相关论文: Non-linear Log-Sobolev inequalities for the Potts …

Log-Sobolev inequalities (LSIs) upper-bound entropy via a multiple of the Dirichlet form (i.e. norm of a gradient). In this paper we prove a family of entropy-energy inequalities for the binary hypercube which provide a non-linear…

For $1<p\le q<\infty$ and $n\in\{3\cdot 2^{k},2^{k}\}$ with $k\ge 1$, we prove that the Poisson-like semigroup $(P_t)_{t\in \mathbb{R}_+}$ on $\mathbb{Z}_n$, associated with the word length $\psi_n(k)=\min(k,n-k)$, is hypercontractive from…

We consider a new functional inequality controlling the rate of relative entropy decay for random walks, the interchange process and more general block-type dynamics for permutations. The inequality lies between the classical logarithmic…

Rooted trees with probabilities are convenient to represent a class of random processes with memory. They allow to describe and analyze variable length codes for data compression and distribution matching. In this work, the Leaf-Average…

We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…

We consider a family of Gagliardo-Nirenberg-Sobolev interpolation inequalities which interpolate between Sobolev's inequality and the logarithmic Sobolev inequality, with optimal constants. The difference of the two terms in the…

We study the relations between (tight) logarithmic Sobolev inequalities, entropy decay and spectral gap inequalities for Markov evolutions on von Neumann algebras. We prove that log-Sobolev inequalities (in the non-commutative form defined…

For reversible Markov chains on finite state spaces, we show that the modified log-Sobolev inequality (MLSI) can be upgraded to a log-Sobolev inequality (LSI) at the surprisingly low cost of degrading the associated constant by $\log…

The Data Processing Inequality (DPI) says that the Umegaki relative entropy $S(\rho||\sigma) := {\rm Tr}[\rho(\log \rho - \log \sigma)]$ is non-increasing under the action of completely positive trace preserving (CPTP) maps. Let ${\mathcal…

We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum…

We consider an inverse problem of recovering a potential associated to a semi-linear wave equation with a quadratic nonlinearity in $1 + 1$ dimensions. We develop a numerical scheme to determine the potential from a noisy…

Consider $k$-colorings of the complete tree of depth $\ell$ and branching factor $\Delta$. If we fix the coloring of the leaves, as $\ell$ tends to $\infty$, for what range of $k$ is the root uniformly distributed over all $k$ colors? This…

The renormalization group (RG) method is an important tool for studying critical phenomena. In this paper, we employ stochastic analysis techniques to investigate the stochastic partial differential equation (SPDE) derived by regularizing…

The exponential ergodicity of partially dissipative McKean-Vlasov SDEs in the \(L^1\)-Wasserstein distance has been extensively studied using asymptotic reflection coupling. However, the reflection coupling method is not applicable for the…

We introduce a numerical framework for reconstructing the potential in two dimensional semilinear elliptic PDEs with power type nonlinearities from the nonlinear Dirichlet to Neumann map. By applying higher order linearization method, we…

In the Densest k-Subgraph problem, given a graph G and a parameter k, one needs to find a subgraph of G induced on k vertices that contains the largest number of edges. There is a significant gap between the best known upper and lower…

Let $G$ be a graph on $n$ vertices of maximum degree $\Delta$. We show that, for any $\delta > 0$, the down-up walk on independent sets of size $k \leq (1-\delta)\alpha_c(\Delta)n$ mixes in time $O_{\Delta,\delta}(k\log{n})$, thereby…

We prove that in the context of general Markov semigroups Beckner inequalities with constants separated from zero as $p\to 1^+$ are equivalent to the modified log Sobolev inequality (previously only one implication was known to hold in this…

The log-density method is a powerful algorithmic framework which in recent years has given rise to the best-known approximations for a variety of problems, including Densest-$k$-Subgraph and Bipartite Small Set Vertex Expansion. These…

We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the…