相关论文: Pl\"unnecke inequalities for measure graphs with a…

An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…

The Bell numbers count the number of different ways to partition a set of $n$ elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex set of a graph into stable sets. This relation between graph…

Stein's method for concentration inequalities was introduced to prove concentration of measure in problems involving complex dependencies such as random permutations and Gibbs measures. In this paper, we provide some extensions of the…

Given a sequence of subsets A_n of {0,...,n-1}, the Furstenberg correspondence principle provides a shift-invariant measure on Cantor space that encodes combinatorial information about infinitely many of the A_n's. Here it is shown that…

We prove a pointwise ergodic theorem and a maximal inequality for actions of amenable groups on noncommutative measure spaces. To do so, we establish a square function estimate quantifying the difference between ergodic averages and some…

In this article we study the expanding properties of random perturbations of contracting Lorenz maps satisfying the summability condition of exponent 1. Under general conditions on the maps and perturbation types, we prove stochastic…

We prove a moderate deviation principle for subgraph count statistics of Erdos-Renyi random graphs. This is equivalent in showing a moderate deviation principle for the trace of a power of a Bernoulli random matrix. It is done via an…

We study measure preserving systems, called Furstenberg systems, that model the statistical behavior of sequences defined by smooth functions with at most polynomial growth. Typical examples are the sequences $(n^\frac{3}{2})$,…

We derive Bell inequalities for graph states by generalizing the approach proposed by Ardehali [Phys. Rev. A 46, 5375 (1992)] for Greenberger-Horne-Zeilinger (GHZ) states. Using this method, we demonstrate that Bell inequalities with…

Many trace inequalities can be expressed either as concavity/convexity theorems or as monotonicity theorems. A classic example is the joint convexity of the quantum relative entropy which is equivalent to the Data Processing Inequality. The…

It is well known and not difficult to prove that if $C$ of integers has positive upper Banach density, the set of differences $C-C$ is syndetic, i.e. the length of gaps is uniformly bounded. More surprisingly, Renling Jin showed that…

We develop a new approach to formulate and prove the weak uncertainty inequality which was recently introduced by Okoudjou and Strichartz. We assume either an appropriate measure growth condition with respect to the effective resistance…

The paper is devoted to establishing some general exponential inequalities for supermartingales. The inequalities improve or generalize many exponential inequalities of Bennett, Freedman, de la Pe\~{n}a, Pinelis and van de Geer. Moreover,…

We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…

In this paper, we continue the investigation on the connection between observability and inverse problems for a class of parabolic equations with unbounded first order coefficients. We prove new logarithmic stability estimates for a class…

By measured graphs we mean graphs endowed with a measure on the set of vertices. In this context, we explore the relations between the appropriate Cheeger constant and Poincar\'{e} inequalities. We prove that the so-called Cheeger…

In this paper it is shown that if $\mu$ is an n-dimensional Ahlfors-David regular measure in $R^d$ which satisfies the so-called weak constant density condition, then $\mu$ is uniformly rectifiable. This had already been proved by David and…

We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…

We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and…

In this paper we introduce a nonextensive quantum information theoretic measure which may be defined between any arbitrary number of density matrices, and we analyze its fundamental properties in the spectral graph-theoretic framework.…