Related papers: Path Integral on Star Graph
Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…
The first part of the paper studies star-cycle factors of graphs. It characterizes star-cycle factors of a graph $G$ and proves upper bounds for the minimum number of $K_{1,2}$-components in a $\{K_{1,1}, K_{1,2}, C_n\colon n\ge 3\}$-factor…
We consider problems of finding a maximum size/weight $t$-matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t+1$, where $t$ is an integer greater than $2$. Depending on the variant forbidden…
A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-hard in general and…
We develop a geometric representation for the ground state of the spin-1/2 quantum XXZ ferromagnetic chain in terms of suitably weighted random walks in a two-dimensional lattice. The path integral model so obtained admits a genuine…
We study maps from a 2D world-sheet to a 2D target space which include folds. The geometry of folds is discussed and a metric on the space of folded maps is written down. We show that the latter is not invariant under area preserving…
When employing Feynman path integrals to compute propagators in quantum physics, the concept of summing over the set of all paths is not always naive. In fact, an auxiliary phase often has to be included as a weight for each summand. In…
A hallmark feature of topological physics is the presence of one-way propagating chiral modes at the system boundary. The chirality of edge modes is a consequence of the topological character of the bulk. For example, in a non-interacting…
The in-in path integral of a scalar field propagating in a fixed background is formulated in a suitable function space. The free kinetic operator, whose inverse gives the propagators of the in-in perturbation theory, becomes essentially…
A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an…
We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to both classical problems, such as partitioning into…
Understanding the topology of the state space has proven to be extremely efficient for dynamical systems with a continuous state space. On the other hand, for particle systems on finite simple graphs, it has not yet been subject to deep…
We construct a family of planar graphs $\{G_n\}_{n\geq 4}$, where $G_n$ has $n$ vertices including a source vertex $s$ and a sink vertex $t$, and edge weights that change linearly with a parameter $\lambda$ such that, as $\lambda$ varies in…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
The existence of an observer independent minimum length scale can lead to the modification of the Heisenberg uncertainty principle to the generalized uncertainty principle. This in turn would be responsible for the modification of the…
One of several possibilities to construct a quantum theory of gravity is employing the Feynman path integral. This approach is plagued by some problems: the integration measure is not uniquely defined, the Einstein-Hilbert action unbounded,…
Motivated by the conduction properties of graphene discovered and studied in the last decades, we consider the quantum dynamics of a massless, charged, spin 1/2 relativistic particle in three dimensional space-time, in the presence of an…
In this paper, we introduce a novel star partitioning problem for simple connected graphs $G=(V,E)$. The goal is to find a partition of the edges into stars that minimizes the maximum number of stars a node is contained in while…