Related papers: Convergence theorems for graph sequences
For large fully connected neuron networks, we study the dynamics of homogenous assemblies of interacting neurons described by time elapsed models, indicating how the time elapsed since the last discharge construct the probability density of…
Alternative iterative methods for a nonexpansive mapping in a Banach space are proposed and proved to be convergent to a common solution to a fixed point problem and a variational inequality. We give rates of asymptotic regularity for such…
Several recent papers investigated unbounded and statistical versions of order convergence and topology convergence in locally solid Riesz space. In this papers, we study the statistical unbounded order and topology convergence in Riesz…
We study maximal regularity with respect to continuous functions for strongly continuous semigroups on locally convex spaces as well as its relation to the notion of admissible operators. This extends several results for classical strongly…
We present closed graph and open mapping theorems for $\wt{\C}$-linear maps acting between suitable classes of topological and locally convex topological $\wt{\C}$-modules. This is done by adaptation of De Wilde's theory of webbed spaces…
Let a graph be observed through a finite random sampling mechanism. Spectral methods are routinely applied to such graphs, yet their outputs are treated as deterministic objects. This paper develops finite-sample inference for spectral…
\.{Z}uk proved that if a finitely generated group admits a Cayley graph such that the Laplacian on the links of this Cayley graph has a spectral gap $> \frac{1}{2}$, then the group has property (T), or equivalently, every affine isometric…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
It is a well-known fact in K-theory that the rapidly decreasing matrices of countable size form an associative topological algebra whose set of quasi-invertible elements is open, and such that the quasi-inversion map is continuous. We…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…
The objective of this series is to study metric geometric properties of (coarse) disjoint unions of amenable Cayley graphs. We employ the Cayley topology and observe connections between large scale structure of metric spaces and group…
We study a convergence criterion which generalises the notion of being monotonically decreasing, and introduce a quantitative version of this criterion, a so called metastable rate of asymptotic decreasingness. We then present a concrete…
We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…
Theoretical analyses for graph learning methods often assume a complete observation of the input graph. Such an assumption might not be useful for handling any-size graphs due to the scalability issues in practice. In this work, we develop…
Arbitrary operator A on a Banach space X which is the generator of C_0-group with certain growth condition at infinity is considered. The relationship between its exponential type entire vectors and its spectral subspaces is found. Inverse…
We create a new, functional calculus, approach to approximation of C_0-semigroups on Banach spaces. As an application of this approach, we obtain optimal convergence rates in classical approximation formulas for C_0-semigroups. In fact, our…
This paper introduces statistical order convergence and its pointwise variant for sequences of order bounded operators between Riesz spaces. We establish fundamental properties: uniqueness of the limit, stability under lattice operations,…
The Lipschitz space of an infinite (locally-finite) graph is defined as the set of functions on the vertices of the graph such that the differences of the values between adjacent vertices remain bounded. In this paper we prove that this set…
Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the…