Related papers: Graph Laplace and Markov operators on a measure sp…
We establish the equivalence of the analytic and probabilistic notions of subharmonicity in the framework of general symmetric Hunt processes on locally compact separable metric spaces, extending an earlier work of the first named author on…
In this work, we consider the bilinear Schr\"odinger equation $i\partial_t\psi=-\Delta\psi+u(t)B\psi$ in the Hilbert space $L^2(\mathcal{G},\mathbb{C})$ with $\mathcal{G}$ an infinite graph. The Laplacian $-\Delta$ is equipped with…
In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…
This paper explores the application diffusion maps as graph shift operators in understanding the underlying geometry of graph signals. The study evaluates the improvements in graph learning when using diffusion map generated filters to the…
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…
Symmetric independence relations are often studied using graphical representations. Ancestral graphs or acyclic directed mixed graphs with $m$-separation provide classes of symmetric graphical independence models that are closed under…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
A powerful framework for studying graphs is to consider them as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius.…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
In a recent paper, Caron and Fox suggest a probabilistic model for sparse graphs which are exchangeable when associating each vertex with a time parameter in $\mathbb{R}_+$. Here we show that by generalizing the classical definition of…
Given two weighted graphs $(X,b_k,m_k)$, $k=1,2$ with $b_1\sim b_2$ and $m_1\sim m_2$, we prove a weighted $L^1$-criterion for the existence and completeness of the wave operators $ W_{\pm}(H_{2},H_1, I_{1,2})$, where $H_k$ denotes the…
A new measure to assess the centrality of vertices in an undirected and connected graph is proposed. The proposed measure, L1 centrality, can adequately handle graphs with weights assigned to vertices and edges. The study provides tools for…
We study a measure-theoretic notion of connectedness for sets of finite perimeter in the setting of doubling metric measure spaces supporting a weak $(1,1)$-Poincar\'{e} inequality. The two main results we obtain are a decomposition theorem…
Successive divisions of compact metric spaces appear in many different areas of mathematics such as the construction of self-similar sets, Markov partitions associated with hyperbolic dynamical systems, dyadic cubes associated with a…
Let \( G \) be a finite simple undirected graph. Four graph parameters related to network monitoring are the \emph{geodetic set}, \emph{edge geodetic set}, \emph{strong edge geodetic set}, and \emph{monitoring edge geodetic set}, with…
We establish that, for a Markov semi-group, $L^2$ hypocoercivity, i.e. contractivity for a modified $L^2$ norm, implies quantitative deviation bounds for additive functionals of the associated Markov process and exponential integrability of…
In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to…
In the setting of a non-complete doubling metric measure space $(\Omega,d,\mu)$, we construct various bounded linear trace and extension operators for homogeneous and inhomogeneous Besov spaces $B^\alpha_{p,q}$. Equipping the boundary…
We study Markov processes on weighted directed hypergraphs where the state of at most one vertex can change at a time. Our setting is general enough to include simplicial epidemic processes, processes on multilayered networks or even the…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…