Related papers: Path Integral on Star Graph
We consider the problem of finding an edge in a hidden undirected graph $G = (V, E)$ with $n$ vertices, in a model where we only allowed queries that ask whether or not a subset of vertices contains an edge. We study the non-adaptive model…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
We discuss the factorization and continuity properties of fields in the Euclidean gravitational path integral with higher dimension operators constructed from powers of the Riemann tensor. We construct the boundary terms corresponding to…
For description of the quantum dynamics on a curved group manifold the path integrals in a space of the group parameters is offered. The formalism is illustrated by the $H$-atom problem.
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…
Free scalar field theory on a flat spacetime can be cast into a generally covariant form known as parametrised field theory in which the action is a functional of the scalar field as well as the embedding variables which describe arbitrary,…
The formulation of the relativistic spinless path integral on the general affine space is presented. For the one dimensional space, the Duru-Kleinert (DK) method and the $\delta $-function perturbation technique are applied to solve the…
We study one of the simplest integrable two-dimensional quantum field theories with a boundary: $N$ free non-compact scalars in the bulk, constrained non-linearly on the boundary to lie on an $(N-1)$-sphere of radius $1/\sqrt{g}$. The $N=1$…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
In the path integral formulation of the partition function of quantum spin models, most current treatments employ the so-called static approximation to simplify the process of summing over all possible paths. Although sufficient for…
We construct a family of integrable vertex model based on the typical four-dimensional representations of the quantum group deformation of the Lie superalgebra $sl(2|1)$. Upon alternation of such a representation with its dual this model…
We consider the problem of untangling a given (non-planar) straight-line circular drawing $\delta_G$ of an outerplanar graph $G=(V, E)$ into a planar straight-line circular drawing by shifting a minimum number of vertices to a new position…
The method of hypergraph containers, introduced recently by Balogh, Morris, and Samotij, and independently by Saxton and Thomason, has proved to be an extremely useful tool in the study of various monotone graph properties. In particular, a…
We introduce a novel class of graphical models, termed profile graphical models, that represent, within a single graph, how an external factor influences the dependence structure of a multivariate set of variables. This class is quite…
Feynman's path integral is herein generalized to the nonextensive canonical density matrix based on Tsallis entropy. This generalization is done in two ways by using unnormalized and normalized constraints. Firstly, we consider the path…
The spin of a free electron is stable but its position is not. Recent quantum information research by G. Svetlichny, J. Tolar, and G. Chadzitaskos have shown that the Feynman \emph{position} path integral can be mathematically defined as a…
We propose a method for demonstrating equivalences beyond the saddlepoint approximation between quantities in quantum gravity that are defined by the Euclidean path integral, without assumptions about holographic duality. The method…
A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each of its component is a star. Clearly, every graph without isolated vertices has a star factor. A graph $G$ is called {\it star-uniform} if all star-factors of…
We present and implement an algorithm for computing the invariant circle and the corresponding stable manifolds for 2-dimensional maps. The algorithm is based on the parameterization method, and it is backed up by an a-posteriori theorem…
We study the spread of information in finite and infinite inhomogeneous spatial random graphs. We assume that each edge has a transmission cost that is a product of an i.i.d. random variable L and a penalty factor: edges between vertices of…