Related papers: Signed graphs: from modulo flows to integer-valued…
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A $\textit{streamed graph}$ is a stream of edges $e_1,e_2,...,e_m$ on a vertex set $V$. A streamed graph is $\omega$-$\textit{stream…
This master thesis looks at the gradient flow of the length functional on embedded loops. The space of embedded loops is endowed with a scale structure so that the length functional becomes scale smooth. For certain underlying manifolds,…
X. Hou, H.-J. Lai, P. Li and C.-Q. Zhang [J. Graph Theory 69 (2012) 464-470] showed that for a simple graph $G$ with $|V(G)|\ge 44$, if $\min\{\delta(G),\delta(G^c)\}\ge 4$, then either $G$ or its complementary graph $G^c$ has a…
We will consider a {\it $\tau$-flow}, given by the equation $\frac{d}{dt}g_{ij} = -2R_{ij} + \frac{1}{\tau}g_{ij}$ on a closed manifold $M$, for all times $t\in [0,\infty)$. We will prove that if the curvature operator and the diameter of…
Let $D=(V,A)$ be a digraph. For an integer $k\geq 1$, a $k$-arc-connected flip is an arc subset of $D$ such that after reversing the arcs in it the digraph becomes (strongly) $k$-arc-connected. The first main result of this paper introduces…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
Normalizing flows model complex probability distributions by combining a base distribution with a series of bijective neural networks. State-of-the-art architectures rely on coupling and autoregressive transformations to lift up invertible…
We relate one-loop scattering amplitudes of massless open- and closed-string states at the level of their low-energy expansion. The modular graph functions resulting from integration over closed-string punctures are observed to follow from…
We study the convergence of a modified Kaeher-Ricci flow defined by Zhou Zhang. We show that the flow converges to a singular metric when the limit class is degenerate. This proves a conjecture of Zhang.
This paper introduces a new method to build linear flows, by taking the exponential of a linear transformation. This linear transformation does not need to be invertible itself, and the exponential has the following desirable properties: it…
In this paper, we introduce a class of new logarithmic curvature flow. The flows are designed to embrace the monotonicity of the related functional, and the convergence of this flow would tackle the solvability of the weighted…
We analyze in the context of Leavitt path algebras some graph operations introduced in the context of symbolic dynamics by Williams, Parry and Sullivan, and Franks. We show that these operations induce Morita equivalence of the…
An elliptic Newton flow is a dynamical system that can be interpreted as a continuous version of Newton's iteration method for finding the zeros of an elliptic function f. Previous work focusses on structurally stable flows (i.e., the phase…
Flow criteria are used to efficiently extract computations, either in the form of measurement patterns or quantum circuits, from ZX-diagrams. Existing criteria such as causal flow, generalised flow, and Pauli flow, were all originally…
The single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single path. One of the most heavily studied SSUF objectives is to…
Kirchhoff-type Laws for signed graphs are characterized by generalizing transpedances through the incidence-oriented structure of bidirected graphs. The classical $2$-arborescence interpretation of Tutte is shown to be equivalent to…
Normalizing flows map an independent set of latent variables to their samples using a bijective transformation. Despite the exact correspondence between samples and latent variables, their high level relationship is not well understood. In…
We consider random labelings of finite graphs conditioned on a small fixed number of peaks. We introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals. Next we…
The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of \v{S}olt{\'e}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being…
A manifestly gauge invariant continuous renormalization group flow equation is constructed for pure SU(N) gauge theory. The formulation makes sense without gauge fixing and manifestly gauge invariant calculations may thus be carried out.…