Related papers: On Mappings on the Hypercube with Small Average St…

Let $(M,g)$ be a smooth, compact, Riemannian manifold and $\{\phi_h\}$ a sequence of $L^2$-normalized Laplace eigenfunctions on $M$. For a smooth submanifold $H\subset M$, we consider the growth of the restricted eigenfunctions $\phi_h|_H$…

We define a uniformly behaved in ${\mathbb N}$ arithmetic sequence ${\bf a}$ and an ${\bf a}$-mean Lyapunov stable dynamical system $f$. We consider the time-average of a continuous function $\phi$ along the ${\bf a}$-orbit of $f$ up to…

The topic is the average order $A(G)$ of a connected induced subgraph of a graph $G$. This generalizes, to graphs in general, the average order of a subtree of a tree. In 1984, Jamison proved that the average order, over all trees of order…

We obtain large deviation results for non-uniformly expanding maps with non-flat singularities or criticalities and for partially hyperbolic non-uniformly expanding attracting sets. That is, given a continuous function we consider its space…

We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…

Let $\mathcal{A}$ be a $C^*$-algebra and $\phi:\cA\to L(H)$ be a positive unital map. Then, for a convex function $f:I\to \mathbb{R}$ defined on some open interval and a self-adjoint element $a\in \mathcal{A}$ whose spectrum lies in $I$, we…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities or criticalities, where the roof function defining the…

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

This paper is concerned with $d=2$ dimensional lattice field models with action $V(\na\phi(\cdot))$, where $V:\R^d\ra \R$ is a uniformly convex function. The fluctuations of the variable $\phi(0)-\phi(x)$ are studied for large $|x|$ via the…

It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their…

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

An $r$-uniform hypergraph $H$ consists of a set of vertices $V$ and a set of edges whose elements are $r$-subsets of $V$. We define a hypertree to be a connected hypergraph which contains no cycles. A hypertree spans a hypergraph $H$ if it…

We study the variance in the number of points contained within a window $\Omega$ of arbitrary size, and to further illuminate our understanding of {\it hyperuniform} systems, i.e., point patterns that do not possess long-wavelength…

In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is…

Consider $n$ linearly independent vectors in $\mathbb{C}^n$ which form columns of a matrix $A$. The recursive evaluation of eigen directions (normalized eigenvectors) of $A$ is the solution of an eigenvalue problem of the form…

We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…

This work describes a novel image analysis approach to characterize the uniformity of objects in agglomerates by using the propagation of normal wavefronts. The problem of width uniformity is discussed and its importance for the…

For Erd\H{o}s-R\'enyi random graphs with average degree $\gamma$, and uniformly random $\gamma$-regular graph on $n$ vertices, we prove that with high probability the size of both the Max-Cut and maximum bisection are…