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

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

Based on a geometrical argument introduced by Zukowski, a new multisetting Bell inequality is derived, for the scenario in which many parties make measurements on two-level systems. This generalizes and unifies some previous results.…

In this paper characterizations of graphs satisfying heat kernel estimates for a wide class of space-time scaling functions are given. The equivalence of the two-sided heat kernel estimate and the parabolic Harnack inequality is also shown…

We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…

The classical Grothendieck inequality is viewed as a statement about representations of functions of two variables over discrete domains by integrals of two-fold products of functions of one variable. An analogous statement is proved,…

The problems of continuation of a partially defined metric and a partially defined ultrametric were considered in (O. Dovgoshey, O. Martio and M. Vuorinen, Metrization of weighted graphs, Ann. Comb., 17:455--476, 2013) and (A. A. Dovgoshey…

By using ergodic theoretic techniques following Hillel F\"{u}rstenberg, we prove that measurable subsets of a locally compact abelian group of positive upper density contain Szemer\'{e}di-wise configurations defined by an arbitrary compact…

We analytically study proximity and distance properties of various kernels and similarity measures on graphs. This helps to understand the mathematical nature of such measures and can potentially be useful for recommending the adoption of…

Partition- and moment functions for a general (not necessarily Gaussian) functional measure that is perturbed by a Gibbs factor are calculated using generalized Feynman graphs. From the graphical calculus, a new notion of Wick ordering…

In the first part of the paper, we define an approximated Brunn-Minkowski inequality which generalizes the classical one for length spaces. Our new definition based only on distance properties allows us also to deal with discrete spaces.…

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

Rubei et. al., established results for the distance matrix of positive weighted Petersen graphs. Focusing on the properties of the distance matrix, we generalized positive weighted Petersen graphs results to Kneser graphs. We analyzed…

We consider the stochastic integrals of multivariate point processes and study their concentration phenomena. In particular, we obtain a Bernstein type of concentration inequality through Dol\'eans-Dade exponential formula and a uniform…

The aim of this paper is to study properties of sections of convex bodies with respect to different types of measures. We present a formula connecting the Minkowski functional of a convex symmetric body K with the measure of its sections.…

A metric measure space is said to be Carnot-rectifiable if it can be covered up to a null set by countably many biLipschitz images of compact sets of a fixed Carnot group. In this paper, we give several characterisations of such notion of…

In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…

A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous…

In this paper we develop a measure-theoretic method to treat problems in hypergraph theory. Our central theorem is a correspondence principle between three objects: An increasing hypergraph sequence, a measurable set in an ultraproduct…

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

Our aim is to provide a short and self contained synthesis which generalise and unify various related and unrelated works involving what we call Phi-Sobolev functional inequalities. Such inequalities related to Phi-entropies can be seen in…