Related papers: The Feller Property for Graphs
In manifold learning, algorithms based on graph Laplacians constructed from data have received considerable attention both in practical applications and theoretical analysis. In particular, the convergence of graph Laplacians obtained from…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
The study of complex systems benefits from graph models and their analysis. In particular, the eigendecomposition of the graph Laplacian lets emerge properties of global organization from local interactions; e.g., the Fiedler vector has the…
Recently, much of the existing work in manifold learning has been done under the assumption that the data is sampled from a manifold without boundaries and singularities or that the functions of interest are evaluated away from such points.…
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
Fixing $t \in \mathbb{R}$ and a finite field $\mathbb{F}_q$ of odd characteristic, we give an explicit upper bound on the proportion of genus $g$ hyperelliptic curves over $\mathbb{F}_q$ whose zeta function vanishes at $\frac{1}{2} + it$.…
For graphs with non-negative Ollivier curvature, we prove the Liouville property, i.e., every bounded harmonic function is constant. Moreover, we improve Ollivier's results on concentration of the measure under positive Ollivier curvature.
We consider a metric graph consisting of two edges, one of which has length $\varepsilon$ which we send to zero. On this graph we study the resolvent and spectrum of the Laplacian subject to a general vertex condition at the connecting…
We study some semi-linear equations for the $(m,p)$-Laplacian operator on locally finite weighted graphs. We prove existence of weak solutions for all $m\in\mathbb{N}$ and $p\in(1,+\infty)$ via a variational method already known in the…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
In this article, we study Hartnell's Firefighter Problem through the group theoretic notions of growth and quasi-isometry. A graph has the $n$-containment property if for every finite initial fire, there is a strategy to contain the fire by…
We show that the deficiency indices of the minimal Gaffney Laplacian on an infinite locally finite metric graph are equal to the number of finite volume graph ends. Moreover, we provide criteria, formulated in terms of finite volume graph…
A graph operator is a mapping $\phi$ which maps every graph $G$ from some class of graphs to a new graph $\phi(G)$. In this paper, we introduce and study the properties of the mincut operator, specifically the effects of iteration of the…
We present sufficient conditions for the transience and the existence of local times of a Feller process, and the ultracontractivity of the associated Feller semigroup; these conditions are sharp for L\'{e}vy processes. The proof uses a…
We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…
We present a mapping of dynamical graphs and, in particular, the graphs used in the Quantum Graphity models for emergent geometry, into an Ising hamiltonian on the line graph of a complete graph with a fixed number of vertices. We use this…
We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most $3$ linear parts, with at most $2$ linear parts in the case of a regular…
Eigenvalue spectrum of the Laplacian on a metric graph with arbitrary but fixed vertex conditions is investigated in the limit as the lengths of all edges decrease to zero at the same rate. It is proved that there are exactly four possible…
Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to…
This paper makes 3 contributions. First, it generalizes the Lindeberg\textendash Feller and Lyapunov Central Limit Theorems to Hilbert Spaces by way of $L^2$. Second, it generalizes these results to spaces in which sample failure and…