Related papers: Action convergence of operators and graphs
Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the…
Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived directly from a specific graph. In many cases, the network is…
A graph operator is a function $\Gamma$ defined on some set of graphs such that whenever two graphs $G$ and $H$ are isomorphic, written $G\simeq H$, then $\Gamma(G)\simeq \Gamma(H)$. For a graph $G$ not in the domain of $\Gamma$, we put…
Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…
We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…
Random matrix theory has played an important role in recent work on statistical network analysis. In this paper, we review recent results on regimes of concentration of random graphs around their expectation, showing that dense graphs…
The paper is devoted to the problem of establishing right-convergence of sparse random graphs. This concerns the convergence of the logarithm of number of homomorphisms from graphs or hyper-graphs $\G_N, N\ge 1$ to some target graph $W$.…
We prove $L^p$ boundedness results, $p > 2$, for local maximal averaging operators over a smooth 2D hypersurface $S$ with either a $C^1$ density function or a density function with a singularity that grows as $|(x,y)|^{-\beta}$ for $\beta <…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
We study the boundedness problem for maximal operators $\mathcal{M}$ associated to averages along families of hypersurfaces $S$ of finite type in $\mathbb{R}^n.$ In this paper, we prove that if $S$ is a finite type hypersurface which is of…
Guided by the theory of graph limits, we investigate a variant of the cut metric for limit objects of sequences of discrete probability distributions. Apart from establishing basic results, we introduce a natural operation called {\em…
We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
We discuss how graph expansion is related to the behavior of $L^{p}$-functions on the covering tree. We show that the non-trivial eigenvalues of the adjacency operator on aa $(q+1)$-regular graph are bounded by $q^{1/p}+q^{(p-1)/p}$ - the…
The collective dynamics of interacting dynamical units on a network crucially depends on the properties of the network structure. Rather than considering large but finite graphs to capture the network, one often resorts to graph limits and…
We prove $L^p$ bounds in the range $1<p<\infty$ for a maximal dyadic sum operator on $\rn$. This maximal operator provides a discrete multidimensional model of Carleson's operator. Its boundedness is obtained by a simple twist of the proof…
We study the design of graph filters to implement arbitrary linear transformations between graph signals. Graph filters can be represented by matrix polynomials of the graph-shift operator, which captures the structure of the graph and is…
For a constant $\gamma \in[0,1]$ and a graph $G$, let $\omega_{\gamma}(G)$ be the largest integer $k$ for which there exists a $k$-vertex subgraph of $G$ with at least $\gamma\binom{k}{2}$ edges. We show that if $0<p<\gamma<1$ then…
Despite the celebrated popularity of Graph Neural Networks (GNNs) across numerous applications, the ability of GNNs to generalize remains less explored. In this work, we propose to study the generalization of GNNs through a novel…