Related papers: Measured expanders
We introduce \emph{expander evolution algebras} (EEAs), a class of nonassociative algebras defined over an arbitrary field $\K$ in which the underlying undirected loopless graph of the algebra -- in the sense of Kowalski -- is an expander…
Let $G$ be a graph which satisfies $c^{-1} a^r \le |B(v,r)| \le c a^r$, for some constants $c,a>1$, every vertex $v$ and every radius $r$. We prove that this implies the isoperimetric inequality $|\partial A| \ge C |A| / \log(2+ |A|)$ for…
Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned…
In this paper, we study some functional inequalities (such as Poincar\'e inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy…
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…
This paper is aimed to study the ergodic short-term behaviour of discretizations of circle expanding maps. More precisely, we prove some asymptotics of the distance between the $t$-th iterate of Lebesgue measure by the dynamics $f$ and the…
We introduce a concept of isoperimetric dimension for magnetic graphs, that is, graphs where every edge is assigned a complex number of modulus one. In analogy with the classical case, we show that isoperimetric inequalities imply Sobolev…
In this paper, we defined three kinds of measures depending on the given finite directed graphs. For the given finite directed graph, we can construct the free semigroupoid, the diagram set and the reduced diagram set, as algebraic…
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…
Given an undirected graph $G$, the classical Cheeger constant, $h_G$, measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon the sizes of the parts. The well-known Cheeger's inequality…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
We characterize the symmetric measures which satisfy the one dimensional convex Poincar\'e inequality. For these measures the tenesorization argument yields concentration inequalities for their products and convex sets in R^n.
We study the Cheeger constant and Cheeger set for domains obtained as strip-like neighbourhoods of curves in the plane. If the reference curve is complete and finite (a "curved annulus"), then the strip itself is a Cheeger set and the…
In this paper, we consider a structural and geometric property of graphs, namely the presence of large expanders. The problem of finding such structures was first considered by Krivelevich [SIAM J. Disc. Math. 32 1 (2018)]. Here, we show…
We study a metric on the set of finite graphs in which two graphs are considered to be similar if they have similar bounded dimensional "factors". We show that limits of convergent graph sequences in this metric can be represented by…
On metric spaces equipped with doubling measures, we prove that a differentiability theorem holds for Lipschitz functions if and only if the space supports nontrivial (metric) derivations in the sense of Weaver that satisfy an additional…
Poincar{\'e} inequalities are ubiquitous in probability and analysis and have various applications in statistics (concentration of measure, rate of convergence of Markov chains). The Poincar{\'e} constant, for which the inequality is tight,…
In several works, Mendel and Naor have introduced and developed theory surrounding a nonlinear expansion constant similar to the spectral gap for sequences of graphs, in which one considers embeddings of a graph $G$ into a metric space $X$…
We introduce a family of multi-way Cheeger-type constants $\{h_k^{\sigma}, k=1,2,\ldots, n\}$ on a signed graph $\Gamma=(G,\sigma)$ such that $h_k^{\sigma}=0$ if and only if $\Gamma$ has $k$ balanced connected components. These constants…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…