English
Related papers

Related papers: The Feller Property for Graphs

200 papers

A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…

Combinatorics · Mathematics 2026-04-15 J. Nesetril , P. Ossona de Mendez

We characterize the spectrum of the Laplacian of graphs composed of one or two finite or infinite chains connected to a complete graph. We show the existence of localized eigenvectors of two types, eigenvectors that vanish exactly outside…

Spectral Theory · Mathematics 2020-02-21 J. -G. Caputo , G. Cruz-Pacheco , A. Knippel , P. Panayotaros

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

Combinatorics · Mathematics 2020-07-21 Hendrik Heine

We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a…

Combinatorics · Mathematics 2020-06-11 Cong X. Kang , Gretchen L. Matthews , Justin D. Peachey

Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…

Combinatorics · Mathematics 2024-10-10 T. Gomyou , S. Nayatani

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…

Combinatorics · Mathematics 2014-05-28 Svante Janson , Vera T. Sós

We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…

Combinatorics · Mathematics 2025-09-22 Senja Barthel , Fabio Buccoliero

We introduce a principled generative framework for graph signals that enables explicit control of feature heterophily, a key property underlying the effectiveness of graph learning methods. Our model combines a Lipschitz graphon-based…

Machine Learning · Statistics 2025-09-30 Haoyu Wang , Renyuan Ma , Gonzalo Mateos , Luana Ruiz

We study two equivalent characterizations of the strong Feller property for a Markov process and of the associated sub-Markovian semigroup. One is described in terms of locally uniform absolute continuity, whereas the other uses local…

Probability · Mathematics 2011-05-18 René L. Schilling , Jian Wang

We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…

Geometric Topology · Mathematics 2008-06-24 Liviu I. Nicolaescu

Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…

Quantum Physics · Physics 2011-11-15 Chai Wah Wu

We say that a plane set $A$ is {\it graph-null,} if there is a function $g\colon [0,1] \to \mathbb{R}$ such that $\lambda_2 (A+{\rm graph}\, g)=0$. A plane set $A$ has the {\it translational Kakeya property} if, for every translated copy…

Combinatorics · Mathematics 2026-02-03 M. Laczkovich , A. Máthé

We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…

Metric Geometry · Mathematics 2018-06-27 Noema Nicolussi

For a finite not necessarily compact metric graph, one considers the differential expression $-\frac{d^2}{d x^2}$ on each edge. The boundary conditions at the vertices of the graph yielding quasi-m-accretive as well as m-accretive operators…

Analysis of PDEs · Mathematics 2021-03-29 Amru Hussein

In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence…

Combinatorics · Mathematics 2014-07-23 Rong-Ying Pan , Jing Yan , Xiao-Dong Zhang

The existence of Feller semigroups arising in the theory of multidimensional diffusion processes is studied. An elliptic operator of second order is considered on a plane bounded region $G$. Its domain of definition consists of continuous…

Analysis of PDEs · Mathematics 2014-05-05 Pavel Gurevich

The Havel-Hakimi algorithm iteratively reduces the degree sequence of a graph to a list of zeroes. As shown by Favaron, Mah\'eo, and Sacl\'e, the number of zeroes produced, known as the residue, is a lower bound on the independence number…

Combinatorics · Mathematics 2019-09-17 Michael D. Barrus , Grant Molnar

This work revolves around properties and applications of functions whose nonlocal gradient, or more precisely, finite-horizon fractional gradient, vanishes. Surprisingly, in contrast to the classical local theory, we show that this class…

Analysis of PDEs · Mathematics 2024-02-20 Carolin Kreisbeck , Hidde Schönberger

We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…

Spectral Theory · Mathematics 2020-05-05 James B. Kennedy , Pavel Kurasov , Corentin Léna , Delio Mugnolo

We introduce the ergodic condition which assures the existence of an invariant measure for Feller processes defined on an arbitrary complete and separable metric space.

Probability · Mathematics 2007-05-23 Tomasz Szarek
‹ Prev 1 4 5 6 7 8 10 Next ›