Related papers: Multi-linear forms, graphs, and $L^p$-improving me…
We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence…
For self-similar measures with overlaps, closed formulas of the $L^q$-spectrum have been obtained by Ngai and the author for measures that are essentially of finite type in [J. Aust. Math. Soc. \textbf{106} (2019), 56--103]. We extend the…
Modeling and inference with multivariate sequences is central in a number of signal processing applications such as acoustics, social network analysis, biomedical, and finance, to name a few. The linear-Gaussian state-space model is a…
The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or biological networks, and so on. A key tool for analyzing these signals is the so called Graph Fourier Transform…
In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…
Given a finite regular graph G=(V,E) and a metric space (X,d_X), let $gamma_+(G,X) denote the smallest constant $\gamma_+>0$ such that for all f,g:V\to X we have: \frac{1}{|V|^2}\sum_{x,y\in V} d_X(f(x),g(y))^2\le \frac{\gamma_+}{|E|}…
(This is a report for the Proceedings of ``Journees Relativistes 1993'' written in September 1993. Containes a short description of the results published elsewhere in the joint paper with A. Ashtekar) Integral calculus on the space of gauge…
We shall consider the truncated singular integral operators T_{\mu, K}^{\epsilon}f(x)=\int_{\mathbb{R}^{n}\setminus B(x,\epsilon)}K(x-y)f(y)d\mu y and related maximal operators $T_{\mu,K}^{\ast}f(x)=\underset{\epsilon >0}{\sup}|…
Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…
A continuation of the joint work by Vadim Gorin and the author, J. Funct. Anal. 270 (2016), 375-418; arXiv:1504.06832. The extended Gelfand-Tsetlin graph, introduced in that paper, is a novel combinatorial object. Its q-boundary is formed…
Estimation of graph parameters based on a collection of graphs is essential for a wide range of graph inference tasks. In practice, weighted graphs are generally observed with edge contamination. We consider a weighted latent position graph…
Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…
The interplay between the quantum state space and a specific set of measurements can be effectively captured by examining the set of jointly attainable expectation values. This set is commonly referred to as the (convex) joint numerical…
Each rule $f$ that assigns a vector $f(G)$ to an $(n+1)$-graph $G$ determines a class (or property) of $n$-manifold invariants. An invariant $v=v(M)$ is in this class if, for any triangulated manifold $|G|=M$, one has that $v(M)$ is a…
Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…
Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…
The algebraic connectivity $a(G)$ of a graph $G$ is defined as the second smallest eigenvalue of its Laplacian matrix $L(G)$. It also admits a variational characterization as the minimum of a quadratic form associated with $L(G)$, subject…
Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…
Let G be a torus and M a G-Hamiltonian manifold with Kostant line bundle L and proper moment map. Let P be the weight lattice of G. We consider a parameter k and the multiplicity $m(\lambda,k)$ of the quantized representation associated to…
Let $\kappa \ge 2, \lambda > 1$ and define the multilinear Littlewood-Paley-Stein operators by $$g_{\lambda,\mu}^*(\vec{f})(x) = \bigg(\iint_{\mathbb{R}^{n+1}_{+}} \vartheta_t(x, y) \bigg|\int_{\mathbb{R}^{n \kappa}} s_t(y,\vec{z})…