Related papers: Eigenfunctions of the Edge-Based Laplacian on a Gr…
This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex…
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
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…
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 consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of…
We investigate polyharmonic functions associated to Brownian motion and random walks in cones. These are functions which cancel some power of the usual Laplacian in the continuous setting and of the discrete Laplacian in the discrete…
Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph $p$-Laplacian $\Delta_p$, which allows us to analyse and classify non-variational eigenvalues. We show the stability of…
We introduce root-to-leaf path random walks on double covers of graded signed graphs and analyze their behavior in a general setting. Viewing simplicial complexes within this framework, we show that these walks induce the natural…
In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information…
We study random one-Lipschitz integer functions $f$ on the vertices of a finite connected graph, sampled according to the weight $W(f) = \prod_{\langle v, w \rangle \in E} \mathbf{c}^{ \mathbb{I} \{ f(v) = f(w) \} }$ where $\mathbf{c} \geq…
We study eigenvalues and eigenfunctions of the Laplacian on the surfaces of four of the regular polyhedrons: tetrahedron, octahedron, icosahedron and cube. We show two types of eigenfunctions: nonsingular ones that are smooth at vertices,…
We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
We discuss the geometry of Laplacian eigenfunctions $-\Delta \phi = \lambda \phi$ on compact manifolds $(M,g)$ and combinatorial graphs $G=(V,E)$. The 'dual' geometry of Laplacian eigenfunctions is well understood on $\mathbb{T}^d$…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…