Related papers: Stochastic incompleteness for graphs and weak Omor…
Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…
We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…
Graphical data is comprised of a graph with marks on its edges and vertices. The mark indicates the value of some attribute associated to the respective edge or vertex. Examples of such data arise in social networks, molecular and systems…
For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…
In recent years, the study of the interplay between (fully) non-linear potential theory and geometry received important new impulse. The purpose of this work is to move a step further in this direction by investigating appropriate versions…
A fundamental result of K\"uhn and Osthus [The minimum degree threshold for perfect graph packings, Combinatorica, 2009] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect H-tiling.…
Asymptotics of maximum likelihood estimation for $\alpha$-stable law are analytically investigated with a continuous parameterization. The consistency and asymptotic normality are shown on the interior of the whole parameter space. Although…
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
We generalize the Omori-Yau almost maximum principle of the Laplace-Beltrami operator on a complete Riemannian manifold $M$ to a second-order linear semi-elliptic operator $L$ with bounded coefficients and no zeroth order term. Using this…
We consider the problem of testing a null hypothesis defined by equality and inequality constraints on a statistical parameter. Testing such hypotheses can be challenging because the number of relevant constraints may be on the same order…
We show that arbitrarily small antisymmetric perturbations of the zero function are sufficient to produce the stickiness phenomenon for planar nonlocal minimal graphs (with the same quantitative bounds obtained for the case of even…
We consider the problem of modelling restricted interactions between continuously-observed time series as given by a known static graph (or network) structure. For this purpose, we define a parametric multivariate Graph Ornstein-Uhlenbeck…
We derive explicit formulas for the Lin-Lu-Yau curvature and the Ollivier-Ricci curvature in terms of graph parameters and an optimal assignment. Utilizing these precise expressions, we examine the relationship between the Lin-Lu-Yau…
Based on ideas of L. Al\'ias, D. Impera and M. Rigoli developed in "Hypersurfaces of constant higher order mean curvature in warped products", we develope a fairly general weak/Omori-Yau maximum principle for trace operators. We apply this…
We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. The main result of this paper gives a necessary and sufficient condition, stated in the language of…
We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…
In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with…
In many applications, the observations can be represented as a signal defined over the vertices of a graph. The analysis of such signals requires the extension of standard signal processing tools. In this work, first, we provide a class of…