Related papers: Action convergence of operators and graphs
Recently, Bansah and Sehba studied in [3] the boundedness of a family of Hilbert-type integral operators, where they characterized the $L^{p}-L^{q}$ boundedness of the operators for $1\leq p\leq q\leq \infty$. In this paper, we deal with…
Motivated by the problem of understanding theoretical bounds for the performance of the Belkin-Niyogi Laplacian eigencoordinate approach to dimension reduction in machine learning problems, we consider the convergence of random graph…
An operator on an $l^{p}$-space is called band-dominated if it can be approximated, in the operator norm, by operators with a banded matrix representation. It is known that a rich band-dominated operator is $\mathcal{P}$-Fredholm (which is…
We present a brief introduction to the theory of operator limits of random matrices to non-experts. Several open problems and conjectures are given. Connections to statistics, integrable systems, orthogonal polynomials, and more, are…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
Let X_N= (X_1^(N), ..., X_p^(N)) be a family of N-by-N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices Y_N =(Y_1^(N), ..., Y_q^(N)), possibly random but independent of…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
Our main theorem is in the generality of the axioms of Hilbert space, and the theory of unbounded operators. Consider two Hilbert spaces such that their intersection contains a fixed vector space D. It is of interest to make a precise…
Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…
We consider a system of $N$ particles whose interactions are characterized by a (weighted) graph $G^N$. Each particle is a node of the graph with an internal state. The state changes according to Markovian dynamics that depend on the states…
How might one "reduce" a graph? That is, generate a smaller graph that preserves the global structure at the expense of discarding local details? There has been extensive work on both graph sparsification (removing edges) and graph…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…
We study $L^p$-theory of second-order elliptic divergence type operators with complex measurable coefficients. The major aspect is that we allow complex coefficients in the main part of the operator, too. We investigate generation of…
We study the boundedness problem for maximal operators $\mathbb{M}$ associated to averages along families of finite type curves in the plane, defined by $$\mathbb{M}f(x) \, := \, \sup_{1 \leq t \leq 2} \left|\int_{\mathbb{C}} f(x-ty) \,…
We prove a central limit theorem for network formation models with strategic interactions and homophilous agents. Since data often consists of observations on a single large network, we consider an asymptotic framework in which the network…
We study the $L^p$ mapping properties of the strong spherical maximal function, which is a multiparameter generalisation of Stein's spherical maximal function. We show that this operator is bounded on $L^p$ for $p > 2$ in all dimensions $n…
We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…
In this paper, we investigate the approximation behavior of both one and multidimensional neural network type operators for functions in $L^p(I^d,\rho)$, where $1\leq p<\infty$, associated with a general measure $\rho$ defined over a…
This chapter deals with the notion of the resolvent of a self-adjoint operator. We pay special attention to the convergence of unbounded self-adjoint operators in several resolvent senses, and how they are related to the convergence of…