English
Related papers

Related papers: Elementary bounds on Poincare and log-Sobolev cons…

200 papers

We build optimal exponential bounds for the probabilities of large deviations of sums \sum_{k=1}^nf(X_k) where (X_k) is a finite reversible Markov chain and f is an arbitrary bounded function. These bounds depend only on the stationary mean…

Probability · Mathematics 2007-05-23 Carlos A. Leon , Francois Perron

The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…

Numerical Analysis · Mathematics 2018-01-15 Simon Foucart , Jean-Bernard Lasserre

The effect of restricting the plaquette to be greater than a certain cutoff value is studied. The action considered is the standard Wilson action with the addition of a plaquette restriction, which should not affect the continuum limit of…

High Energy Physics - Lattice · Physics 2009-10-28 Michael Grady

Stochastic lattice gases with degenerate rates, namely conservative particle systems where the exchange rates vanish for some configurations, have been introduced as simplified models for glassy dynamics. We introduce two particular models…

Statistical Mechanics · Physics 2010-09-21 L. Bertini , C. Toninelli

We consider metrics which are preserved under a $p$-Wasserstein transport map, up to a possible contraction. In the case $p=1$ this corresponds to a metric which is uniformly curved in the sense of coarse Ricci curvature. We investigate the…

Probability · Mathematics 2017-12-08 Florian Völlering

The main goal of the paper is to develop an estimate for the conditional probability function of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We elaborate a decomposition procedure for the…

Data Analysis, Statistics and Probability · Physics 2017-08-09 S. S. Melnik , O. V. Usatenko

We consider a diffusion on a potential landscape which is given by a smooth Hamiltonian $H:\mathbb {R}^n\to \mathbb {R}$ in the regime of low temperature $\varepsilon$. We proof the Eyring-Kramers formula for the optimal constant in the…

Probability · Mathematics 2016-08-14 Georg Menz , André Schlichting

Constant weight codes can arise from an input process sampled from a periodic Markov chain. A previous result showed that, in general, polarization does not occur for input-output processes with an underlying periodic Markov chain. In this…

Information Theory · Computer Science 2025-01-22 Boaz Shuval , Ido Tal

We establish fine bounds for best constants of the fractional subcritical Sobolev embeddings \begin{align*} W_{0}^{s,p}\left(\Omega\right)\hookrightarrow L^{q}\left(\Omega\right), \end{align*} where $N\geq1$, $0<s<1$, $p=1,2$, $1\leq…

Analysis of PDEs · Mathematics 2023-05-17 Daniele Cassani , Lele Du

Remarkable progress has been made in recent years to establish log-Sobolev type inequalities under the assumption of discrete Ricci curvature bounds. More specfically, Salez and Youssef have proven that the log-Sobolev constant can be lower…

Differential Geometry · Mathematics 2025-04-14 Florentin Münch

An up-down chain is a Markov chain in which each transition is a two-step process that moves up to a larger object and then back down to an object of the original size. The first goal of this paper is to present a general framework for…

Probability · Mathematics 2025-12-24 Valentin Féray , Kelvin Rivera-Lopez

Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…

Social and Information Networks · Computer Science 2012-11-01 J. Ray , A. Pinar , C. Seshadhri

We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing…

Probability · Mathematics 2016-09-20 Damjan Skulj

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

Combinatorics · Mathematics 2026-03-17 César Bautista-Ramos , Carlos Guillén-Galván , Paulino Gómez-Salgado

Consider the class of (functions of) strictly stationary Markov chains in which (i) the second moments are finite and (ii) absolute regularity (beta-mixing) is satisfied with exponential mixing rate. For (functions of) Markov chains in that…

Probability · Mathematics 2024-11-07 Richard C. Bradley

We introduce a notion called entropic independence that is an entropic analog of spectral notions of high-dimensional expansion. Informally, entropic independence of a background distribution $\mu$ on $k$-sized subsets of a ground set of…

Data Structures and Algorithms · Computer Science 2021-11-08 Nima Anari , Vishesh Jain , Frederic Koehler , Huy Tuan Pham , Thuy-Duong Vuong

Consider the barycentric subdivision which cuts a given triangle along its medians to produce six new triangles. Uniformly choosing one of them and iterating this procedure gives rise to a Markov chain. We show that almost surely, the…

Probability · Mathematics 2010-07-26 Persi Diaconis , Laurent Miclo

We study the regularity of local minimisers of a prototypical free-discontinuity problem involving both a manifold-valued constraint on the maps (which are defined on a bounded domain $\Omega \subset \R^2$) and a variable-exponent growth in…

Analysis of PDEs · Mathematics 2023-07-18 Federico Luigi Dipasquale , Bianca Stroffolini

In this paper, we study consistent and partially exchangeable sequences of Markov chains on a finite state space. We provide a characterisation of the admissible transition rates via a decomposition into individual and coordinated motion of…

We extend F.Pastjin's construction of uniform decomposable chains of finite rank to those of rank 'finite over a limit' and investigate infinite products and unions of such chains. We derive an extension of Pastjin's characterisation to…

Combinatorics · Mathematics 2007-05-23 F. P. Weber , R. M. Vollmer