English
Related papers

Related papers: On binomial sums, additive energies, and lazy rand…

200 papers

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…

High Energy Physics - Lattice · Physics 2008-11-26 A. Gonzalez-Arroyo

We consider the sum of the coordinates of a simple random walk on the K-dimensional hypercube, and prove a double asymptotic of this process, as both the time parameter n and the space parameter K tend to infinity. Depending on the…

Probability · Mathematics 2019-09-23 Fabien Montégut

A short and elementary proof of the joint convexity of relative entropy is presented, using nothing beyond linear algebra. The key ingredients are an easily verified integral representation and the strategy used to prove the Cauchy-Schwarz…

Quantum Physics · Physics 2016-09-08 Mary Beth Ruskai

We prove that for $d\geq 0$ and $k\geq 2$, for any subset $A$ of a discrete cube $\{0,1\}^d$, the $k-$higher energy of $A$ (the number of $2k-$tuples $(a_1,a_2,\dots,a_{2k})$ in $A^{2k}$ with $a_1-a_2=a_3-a_4=\dots=a_{2k-1}-a_{2k}$) is at…

Combinatorics · Mathematics 2023-09-04 Jaume de Dios Pont , Rachel Greenfeld , Paata Ivanisvili , José Madrid

The entropy, the spectral radius and the drift are important numerical quantities associated to random walks on countable groups. We prove sharp inequalities relating those quantities for walks with a finite second moment, improving upon…

Probability · Mathematics 2014-02-11 Sébastien Gouëzel , Frédéric Mathéus , François Maucourant

We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the…

Combinatorics · Mathematics 2024-11-27 Francesco Esposito , Mario Marietti , Grant T. Barkley , Christian Gaetz

The great enumerator Germain Kreweras empirically discovered this intriguing fact, and then needed lots of pages[K], and lots of human ingenuity, to prove it. Other great enumerators, for example, Heinrich Niederhausen[N], Ira Gessel[G1],…

Combinatorics · Mathematics 2008-06-27 Manuel Kauers , Doron Zeilberger

Recent advances have linked various statements involving sumsets and cardinalities with corresponding statements involving sums of random variables and entropies. In this vein, this paper shows that the quantity $2{\bf H}\{X, Y\} - {\bf…

Combinatorics · Mathematics 2026-05-27 Marcel K. Goh

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibility suggests that equality should hold for…

Information Theory · Computer Science 2010-10-21 Oliver Johnson , Yaming Yu

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…

Dynamical Systems · Mathematics 2026-05-27 Timothée Bénard , Weikun He

Following a growing number of studies that, over the past 15 years, have established entropy inequalities via ideas and tools from additive combinatorics, in this work we obtain a number of new bounds for the differential entropy of sums,…

Information Theory · Computer Science 2025-11-20 Rupert Li , Lampros Gavalakis , Ioannis Kontoyiannis

We consider two recent conjectures of Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship…

Combinatorics · Mathematics 2023-03-22 John Haslegrave

The harmonic measure $\nu$ on the boundary of the group $Sol$ associated to a discrete random walk of law $\mu$ was described by Kaimanovich. We investigate when it is absolutely continuous or singular with respect to Lebesgue measure. By…

Probability · Mathematics 2015-12-10 Jérémie Brieussel , Ryokichi Tanaka

It is proven that a conjecture of Tao (2010) holds true for log-concave random variables on the integers: For every $n \geq 1$, if $X_1,\ldots,X_n$ are i.i.d. integer-valued, log-concave random variables, then $$ H(X_1+\cdots+X_{n+1}) \geq…

Probability · Mathematics 2023-10-19 Lampros Gavalakis

Motivated by random walks on subsets of the hypercube, we prove two discrete functional inequalities on the hypercube. First, we give a short, elementary proof of the Poincar\'e inequality on increasing subsets of the cube recently…

Combinatorics · Mathematics 2025-11-11 Fan Chang , Guowei Sun , Lei Yu

A random Lie group action on a compact manifold generates a discrete time Markov process. The main object of this paper is the evaluation of associated Birkhoff sums in a regime of weak, but sufficiently effective coupling of the…

Mathematical Physics · Physics 2010-11-22 Christian Sadel , Hermann Schulz-Baldes

Let $G$ be a real Lie group, $\Lambda\subseteq G$ a lattice, and $X=G/\Lambda$. We fix a probability measure $\mu$ on $G$ and consider the left random walk induced on $X$. It is assumed that $\mu$ is aperiodic, has a finite first moment,…

Probability · Mathematics 2021-12-14 Timothée Bénard

This paper addresses the correspondence between linear inequalities of Shannon entropy and differential entropy for sums of independent group-valued random variables. We show that any balanced (with the sum of coefficients being zero)…

Information Theory · Computer Science 2016-09-12 Ashok Vardhan Makkuva , Yihong Wu

We study a simple random walk on an n-dimensional hypercube. For any starting position we find the probability of hitting vertex a before hitting vertex b, whenever a and b share the same edge. This generalizes the model in Doyle, P., and…

Probability · Mathematics 2007-11-19 Stanislav Volkov , Timothy Wong

We embark on a systematic study of the $(k+1)$-th derivative of $x^{k-r}H(x^r)$, where $H(x):=-x\log x-(1-x)\log(1-x)$ is the binary entropy and $k>r\geq 1$ are integers. Our motivation is the conjectural entropy inequality $\alpha_k…

Information Theory · Computer Science 2025-01-15 Tanay Wakhare
‹ Prev 1 2 3 10 Next ›