Related papers: Local-Global Convergence, an analytic and structur…
This is a short note on how a particular graph construction on a subset of edges that lead to a subalgebra construction, provided a tool in proving some ring theoretical properties of Leavitt path algebras.
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable…
The aim of this paper is to construct and examine three candidates for local-to-global spectral sequences for the cohomology of diagrams of algebras with directed indexing. In each case, the $E^2$ -terms can be viewed as a type of local…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
We study locally compact contractive local groups, that is, locally compact local groups with a contractive pseudo-automorphism. We prove that if such an object is locally connected, then it is locally isomorphic to a Lie group. We also…
With a new proof approach we prove in a more general setting the classical convergence theorem that almost everywhere convergence of measurable functions on a finite measure space implies convergence in measure. Specifically, we generalize…
We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…
Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the…
Graph-based clustering has shown promising performance in many tasks. A key step of graph-based approach is the similarity graph construction. In general, learning graph in kernel space can enhance clustering accuracy due to the…
In the local gluing one glues local neighborhoods around the critical point of the stable and unstable manifolds to gradient flow lines defined on a finite time interval $[-T,T]$ for large $T$. If the Riemannian metric around the critical…
We extend the $L^p$ theory of sparse graph limits, which was introduced in a companion paper, by analyzing different notions of convergence. Under suitable restrictions on node weights, we prove the equivalence of metric convergence,…
We prove a compactness result with respect to $\Gamma$-convergence for a class of integral functionals which are expressed as a sum of a local and a non-local term. The main feature is that, under our hypotheses, the local part of the…
Quite often real-world networks can be thought of as being symmetric, in the abstract sense that vertices can be found to have similar or equivalent structural roles. However, traditional measures of symmetry in graphs are based on their…
This paper studies the problem of graph-level clustering, which is a novel yet challenging task. This problem is critical in a variety of real-world applications such as protein clustering and genome analysis in bioinformatics. Recent years…
In this paper, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (locally) in order to destroy P. Estimating the resilience leads to…
Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques,…
Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…