Related papers: Path Laplacian operators and superdiffusive proces…

We study zero modes of Laplacians on compact and non-compact metric graphs with general self-adjoint vertex conditions. In the first part of the paper the number of zero modes is expressed in terms of the trace of a unitary matrix…

This paper is a sequel to the work of Bhattacharjya et al.\ (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian…

We show that particle transport in a uniform, quantum multi-baker map, is generically ballistic in the long time limit, for any fixed value of Planck's constant. However, for fixed times, the semi-classical limit leads to diffusion. Random…

Discrete versions of the Laplace and Dirac operators haven been studied in the context of combinatorial models of statistical mechanics and quantum field theory. In this paper we introduce several variations of the Laplace and Dirac…

A new approach to the modeling of nonfree particle diffusion is presented. The approach uses a general setup based on geometric graphs (networks of curves), which means that particle diffusion in anything from arrays of barriers and pore…

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…

We study scattering processes on $p$-adic multiloop surfaces represented as multiloop infinite graphs with total valence in each vertex equal $p+1$. They all are spaces of the constant negative curvature since they are quotients of the…

In this paper we study Lipschitz regularity of elliptic PDEs on geometric graphs, constructed from random data points. The data points are sampled from a distribution supported on a smooth manifold. The family of equations that we study…

By introducing a weight function to the Laplace operator, Bakry and \'Emery defined the "drift Laplacian" to study diffusion processes. Our first main result is that, given a Bakry-\'Emery manifold, there is a naturally associated family of…

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 present multiscale graph-based reduction algorithms for upscaling heterogeneous and anisotropic diffusion problems. The proposed coarsening approaches begin by constructing a partitioning of the computational domain into a set of…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

Geometry arising from two diffusion operators (smooth semi-elliptic, second order differential operators) on different spaces but intertwined by a smooth map is described. Particular cases arise from Riemannian submersions when the…

Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…

To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on…

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…

Symmetric matrices with zero row sums occur in many theoretical settings and in real-life applications. When the offdiagonal elements of such matrices are i.i.d. random variables and the matrices are large, the eigenvalue distributions…

A unifying graph theoretic framework for the modelling of metro transportation networks is proposed. This is achieved by first introducing a basic graph framework for the modelling of the London underground system from a diffusion law point…

Diffusion processes are instrumental to describe the movement of a continuous quantity in a generic network of interacting agents. Here, we present a probabilistic framework for diffusion in networks and propose to classify agent…