Related papers: Action convergence of operators and graphs
We study the model $G_\alpha\cup G(n,p)$ of randomly perturbed dense graphs, where $G_\alpha$ is any $n$-vertex graph with minimum degree at least $\alpha n$ and $G(n,p)$ is the binomial random graph. We introduce a general approach for…
In the dense graph limit theory, the topology of the set of graphs is defined by the distribution of the subgraphs spanned by finite number of random vertices. Vera T. S\'os proposed a question that if we consider only the number of edges…
This paper is devoted to establishing the kernel theorems for $\alpha$-modulation spaces in terms of boundedness and compactness. We characterize the boundedness of a linear operator $A$ from an $\alpha$-modulation space…
Right multiplication operators $R_w: l_2G \rightarrow l_2G$, $w \in \C[G]$, are interpreted as random-walk operators on labelled graphs that are analogous to Cayley graphs. Applying a generalization of the graph convergence defined by R.…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…
Using some resolution of singularities and oscillatory integral methods in conjunction with appropriate damping and interpolation techniques, L^p boundedness theorems for p > 2 are obtained for maximal operators over a wide range of…
We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The…
In this paper we show how to produce a large number of representations of a graph C*-algebra in the space of the bounded linear operators in $L^2(X,\mu)$. These representations are very concrete and, in the case of graphs that satisfy…
Sparse graphs with bounded average degree form a rich class of discrete structures where local geometry strongly influences global behavior. The Benjamini-Schramm (BS) convergence offers a natural framework to describe their asymptotic…
A linear operator $T$ between two lattice-normed spaces is said to be $p$-compact if, for any $p$-bounded net $x_\alpha$, the net $Tx_\alpha$ has a $p$-convergent subnet. $p$-Compact operators generalize several known classes of operators…
We investigate asymptotic behaviour of averaging operators for actions of simple rank-one Lie groups. It was previously known that these averaging operators converge almost everywhere, and we establish a more precise asymptotic formula that…
In the random geometric graph $G(n,r_n)$, $n$ vertices are placed randomly in Euclidean $d$-space and edges are added between any pair of vertices distant at most $r_n$ from each other. We establish strong laws of large numbers (LLNs) for a…
This is a continuation of our previous research about an oscillatory integral operator $T_{\alpha, \beta}$ on compact manifolds $\mathbb{M}$. We prove the sharp $H^{p}$-$L^{p,\infty}$ boundedness on the maximal operator $T^{*}_{\alpha,…
Defining a sound shift operator for signals existing on a certain graph structure, similar to the well-defined shift operator in classical signal processing, is a crucial problem in graph signal processing, since almost all operations, such…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in the $1$-cut metric. On the other hand, we give examples of…
Let $G=(V,E)$ be a finite graph and $M_G$ be the centered Hardy-Littlewood maximal operator defined there. We find the optimal value $\bf{C}_{G,p}$ such that the inequality $$\text{Var}_{p}(M_{G}f)\leq {\textbf{C}}_{G,p}\text{Var}_{p}(f)$$…
A family of random matrices $\boldsymbol{X}^N=(X_1^N,\ldots,X_d^N)$ is said to converge strongly to a family of bounded operators $\boldsymbol{x}=(x_1,\ldots,x_d)$ when $\|P(\boldsymbol{X}^N,\boldsymbol{X}^{N*})\|\to\|P(\boldsymbol{x},…