Related papers: Action convergence of operators and graphs
The recent theory of graph limits gives a powerful framework for understanding the properties of suitable (convergent) sequences $(G_n)$ of graphs in terms of a limiting object which may be represented by a symmetric function $W$ on…
We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
Scalings in which the graph Laplacian approaches a differential operator in the large graph limit are used to develop understanding of a number of algorithms for semi-supervised learning; in particular the extension, to this graph setting,…
Ginzburg--Landau (GL) functionals on graphs, which are relaxations of graph-cut functionals on graphs, have yielded a variety of insights in image segmentation and graph clustering. In this paper, we study large-graph limits of GL…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
The theory of limit operators was developed by Rabinovich, Roch and Silbermann to study the Fredholmness of band-dominated operators on $\ell^p(\mathbb{Z}^N)$ for $p \in \{0\} \cup [1,\infty]$, and recently generalised to discrete metric…
We study the boundedness of the linear operator $S$ on $L^{p}_{a}(dA_{\alpha})$ $(0<p<\infty)$. In particular, we obtain a sufficient and necessary condition for the compactness of the linear operator $S$ on $L^{p}_{a}(dA_{\alpha})$…
Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.
This paper presents the Fredholm theory on l^p-spaces for band-dominated operators and important subclasses, such as operators in the Wiener algebra. It particularly closes several gaps in the previously known results for the case p=\infty…
We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
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…
Originally arising in the context of interacting particle systems in statistical physics, dynamical systems and differential equations on networks/graphs have permeated into a broad number of mathematical areas as well as into many…
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…
We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number,…
In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over $\sigma$-finite measure spaces has been introduced. In this paper, we…
We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…