Related papers: A note on observables for counting trails and path…
We report on the computation of the effective actions describing the interaction of gravity both for an abelian and a non-abelian gauge theory, mediated by the trace anomaly.
Andreka and her colleagues have described various geometrically inspired first-order theories of special and general relativity, while Szekely's PhD dissertation focuses on an intermediate logic of accelerated observers. In this paper we…
In this work we consider temporal graphs, i.e. graphs, each edge of which is assigned a set of discrete time-labels drawn from a set of integers. The labels of an edge indicate the discrete moments in time at which the edge is available. We…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system traces, we show how this leads to natural definitions of a…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
In seeking to arrive at a theory of ``quantum gravity'', one faces several choices among alternative approaches. I list some of these ``forks in the road'' and offer reasons for taking one alternative over the other. In particular, I…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
Evaluation of regular path queries (RPQs) is a central problem in graph databases. We investigate the corresponding enumeration problem, that is, given a graph and an RPQ, enumerate all paths in the graph that match the RPQ. We consider…
With the constant flow of data from vast sources over the past decades, a plethora of advanced analytical techniques have been developed to extract relevant information from different data types ranging from labeled data, quasi-labeled…
For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a…
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
Protocols for observing gravity induced entanglement typically comprise the interaction of two particles prepared either in a superposition of two discrete paths, or in a continuously delocalized (harmonic oscillator) state of motion. An…
The questions of describing observables and observation in quantum gravity appear to be centrally important to its physics. A relational approach holds significant promise, and a classification of different types of relational observables…
We present a line by line derivation of canonical quantum mechanics stemming from the compatibility of the statistical geometry of distinguishable observations with the canonical Poisson structure of Hamiltonian dynamics. This viewpoint can…
We propose a general construction of an observable measuring the time of occurence of an effect in quantum theory. Time delay in potential scattering is computed as a straightforward application.
Feynman's path integrals provide a hidden variable description of quantum mechanics (and quantum field theories). The expectation values defined through path integrals obey Bell's inequalities in Euclidean time, but not in Minkowski time.…
The number of observable degrees of freedom is typically limited in experiments. Here, we consider discrete Markov networks in which an observer has access to a few visible transitions and the waiting times between these transitions.…
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is…
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…