We investigate the relationship between one of the classical notions of boundaries for infinite graphs, , and self-adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph. We introduce the notion of for ends of a metric graph and show that finite volume graph ends is the proper notion of a boundary for Markovian extensions of the Kirchhoff Laplacian. In contrast to manifolds and weighted graphs, this provides a transparent geometric characterization of the uniqueness of Markovian extensions, as well as of the self-adjointness of the Gaffney Laplacian - the underlying metric graph does not have finite volume ends. If, however, finitely many finite volume ends occur (as is the case of edge graphs of normal, locally finite tessellations or Cayley graphs of amenable finitely generated groups), we provide a complete description of Markovian extensions upon introducing a suitable notion of traces of functions and normal derivatives on the set of graph ends.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9303478PMC
http://dx.doi.org/10.1112/jlms.12539DOI Listing

Publication Analysis

Top Keywords

markovian extensions
16
metric graph
12
finite volume
12
kirchhoff laplacian
8
graph finite
8
volume ends
8
extensions
5
graphs
5
self-adjoint markovian
4
extensions infinite
4

Similar Publications

Non-Markovian dynamics arising from the strong coupling of a system to a structured environment is essential in many applications of quantum mechanics and emerging technologies. Deriving an accurate description of general quantum dynamics including memory effects is, however, a demanding task, prohibitive to standard analytical or direct numerical approaches. We present a major release of our open source software package, OQuPy (Open Quantum System in Python), which provides several recently developed numerical methods that address this challenging task.

View Article and Find Full Text PDF

All published methods for learning about demographic history make the simplifying assumption that the genome evolves neutrally, and do not seek to account for the effects of natural selection on patterns of variation. This is a major concern, as ample work has demonstrated the pervasive effects of natural selection and in particular background selection (BGS) on patterns of genetic variation in diverse species. Simulations and theoretical work have shown that methods to infer changes in effective population size over time (()) become increasingly inaccurate as the strength of linked selection increases.

View Article and Find Full Text PDF

The quantum dynamics of a low-dimensional system in contact with a large but finite harmonic bath is theoretically investigated by coarse-graining the bath into a reduced set of effective energy states. In this model, the couplings between the system and the bath are obtained from statistically averaging over the discrete, degenerate effective states. Our model is aimed at intermediate bath sizes in which non-Markovian processes and energy transfer between the bath and the main system are important.

View Article and Find Full Text PDF

Quantum Trajectories for Time-Local Non-Lindblad Master Equations.

Phys Rev Lett

October 2023

Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstrasse 36, 10623 Berlin, Germany.

For the efficient simulation of open quantum systems, we often use quantum jump trajectories given by pure states that evolve stochastically to unravel the dynamics of the underlying master equation. In the Markovian regime, when the dynamics is described by a Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation, this procedure is known as Monte Carlo wave function approach. However, beyond ultraweak system-bath coupling, the dynamics of the system is not described by an equation of GKSL type, but rather by the Redfield equation, which can be brought into pseudo-Lindblad form.

View Article and Find Full Text PDF

We propose an algorithm to simulate Markovian SIS epidemics with homogeneous rates and pairwise interactions on a fixed undirected graph, assuming a distributed memory model of parallel programming and limited bandwidth. This setup can represent a broad class of simulation tasks with compartmental models. Existing solutions for such tasks are sequential by nature.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!