Related papers: Can smooth graphons in several dimensions be repre…
We study families of self-adjoint operators with given spectra whose sum is a scalar operator. Such families are $*$-representations of certain algebras which can be described in terms of graphs and positive functions on them. The main…
In this article we present a unified way to smooth certain multiple structures called ropes on smooth varieties. We prove that most ropes of arbitrary multiplicity, supported on smooth curves can be smoothed. By a rope being smoothable we…
We establish a large deviation principle (LDP) for probability graphons, which are symmetric functions from the unit square into the space of probability measures. This notion extends classical graphons and provides a flexible framework for…
For a connected graph $G$, let $\mu(G)$ denote the distance spectral radius of $G$. A matching in a graph $G$ is a set of disjoint edges of $G$. The maximum size of a matching in $G$ is called the matching number of $G$, denoted by…
In crystal growth, surfactants are additive molecules used in dilute amount or as dense, permeable layers to control surface morphologies. Here, we investigate the properties of a strikingly different surfactant: a two-dimensional and…
In this paper, we characterize the geometry of solutions to one-phase inhomogeneous fully nonlinear Stefan problem with flat free boundaries under a new nondegeneracy assumption. This continues the study of regularity of flat free…
We prove a version of Tao's algebraic regularity lemma for asymptotic classes in the context of graphons. We apply it to study expander difference polynomials over fields with powers of Frobenius.
In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons…
Graph signal processing is an emerging field which aims to model processes that exist on the nodes of a network and are explained through diffusion over this structure. Graph signal processing works have heretofore assumed knowledge of the…
Given $s\in(1,2]$, define $$H_s[0,1]=\{f\in C[0,1]:{\dim}_HG_f([0,1])=s\}$$ and $$\overline{B}_s[0,1]=\{f\in C[0,1]:\overline{{\dim}}_BG_f([0,1])=s\}.$$ The main goal of this paper is to study the $(\alpha,\beta)$-lineability/spaceability…
We provide a counter-example to Hutchinson's original proof of $C^{1,\alpha}$ representation of curvature $m$-varifolds with $L^q$-integrable second fundamental form and $q>m$ in [6]. We also provide an alternative proof of the same result…
Modelling exchangeable relational data can be described by \textit{graphon theory}. Most Bayesian methods for modelling exchangeable relational data can be attributed to this framework by exploiting different forms of graphons. However, the…
We consider smooth representations of the unit group $G = \mathcal{A}^{\times}$ of a finite-dimensional split basic algebra $\mathcal{A}$ over a non-Archimedean local field. In particular, we prove a version of Gutkin's conjecture, namely,…
Let {(Z_i,W_i):i=1,...,n} be uniformly distributed in [0,1]^d * G(k,d), where G(k,d) denotes the space of k-dimensional linear subspaces of R^d. For a differentiable function f from [0,1]^k to [0,1]^d we say that f interpolates (z,w) in…
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…
We show that a compact complex surface which fibers smoothly over a curve of genus >1 with fibers of genus >1 fibers holomorphically. We deduce an improvement of a result in [D Kotschick, Math. Research Letters, 5 (1998) 227-234], and a…
We present a framework for representing and modeling data on graphs. Based on this framework, we study three typical classes of graph signals: smooth graph signals, piecewise-constant graph signals, and piecewise-smooth graph signals. For…
Let $X$ be a smooth projective variety. Define a stable map $f:C\to X$ to be "eventually smoothable" if there is an embedding $X\hookrightarrow\mathbb{P}^N$ such that $(C,f)$ occurs as the limit of a $1$-parameter family of stable maps to…
We present a characterization of Robinsonian $L^p$ graphons for $p > 5$. Each $L^p$ graphon $w$ is the limit object of a sequence of edge density-normalized simple graphs $\{G_n/\|G_n\|_1\}$ under the cut distance $\delta_{\Box}$. A graphon…
Let $\Gamma(\cdot,\lambda)$ be smooth, i.e.\, $\mathcal C^\infty$, embeddings from $\bar{\Omega}$ onto $\bar{\Omega^{\lambda}}$, where $\Omega$ and $\Omega^\lambda$ are bounded domains with smooth boundary in the complex plane and $\lambda$…