相关论文: Integrable cluster dynamics of directed networks a…

We describe a graphical calculus for completely positive maps and in doing so review the theory of open quantum systems and other fundamental primitives of quantum information theory using the language of tensor networks. In particular we…

Poisson brackets admit infinitesimal symmetries which are encoded using oriented graphs; this construction is due to Kontsevich (1996). We formulate several open problems about combinatorial and topological properties of the graphs…

$\gamma$-Liouville quantum gravity ($\gamma$-LQG) constitutes a family of planar random geometries whose geodesics exhibit intricate fractal behaviour. As is observed in various planar models of random geometry as part of the phenomenon of…

We derive integrable discrete systems which are contiguity relations of two equations in the Painlev\'e-Gambier classification depending on some parameter. These studies extend earlier work where the contiguity relations for the six…

In this paper, we prove intractability results about sampling from the set of partitions of a planar graph into connected components. Our proofs are motivated by a technique introduced by Jerrum, Valiant, and Vazirani. Moreover, we use…

We derive a new constructive procedure to rapidly generate ensembles of phase-covariant dynamical maps that may be associated to the individual spins of a closed quantum system. We do this by first computing the single-spin dynamical maps…

We investigate equilibrium properties of small world networks, in which both connectivity and spin variables are dynamic, using replicated transfer matrices within the replica symmetric approximation. Population dynamics techniques allow us…

Graph Neural Networks often struggle with long-range information propagation and in the presence of heterophilous neighborhoods. We address both challenges with a unified framework that incorporates a clustering inductive bias into the…

We construct a direct quasi-isomorphism from Kontsevich's graph complex GC_n to the oriented graph complex OGC_{n+1}, thus providing an alternative proof that the two complexes are quasi-isomorphic. Moreover, the result is extended to the…

In this paper we investigate the controllability and observability properties of a family of linear dynamical systems, whose structure is induced by the Laplacian of a grid graph. This analysis is motivated by several applications in…

Starting from a contact Hamiltonian description of Li\'enard systems, we introduce a new family of explicit geometric integrators for these nonlinear dynamical systems. Focusing on the paradigmatic example of the van der Pol oscillator, we…

In a recent work \cite{LiuJoladSchZia13}, we introduced dynamic networks with preferred degrees and presented simulation and analytic studies of a single, homogeneous system as well as two interacting networks. Here, we extend these studies…

Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice has three…

This work studies the classical spectral clustering algorithm which embeds the vertices of some graph $G=(V_G, E_G)$ into $\mathbb{R}^k$ using $k$ eigenvectors of some matrix of $G$, and applies $k$-means to partition $V_G$ into $k$…

We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…

The paper introduces a partial integration map from the first Hochschild cohomology of any cohomologically unital A-infinity category over a field of characteristic zero to its derived Picard group. We discuss useful properties such as…

Simple algebraic rules can produce complex networks with rich structures. These graphs are obtained when looking at a monoid operating on a ring. There are relations to dynamical systems theory and number theory. This document illustrates…

We study the problem of clustering nodes in a dynamic graph, where the connections between nodes and nodes' cluster memberships may change over time, e.g., due to community migration. We first propose a dynamic stochastic block model that…

The theory of complexes of directed trees was initiated by Kozlov to answer a question by Stanley, and later on, results from the theory were used by Babson and Kozlov in their proof of the Lovasz conjecture. We develop the theory and prove…

We show that many cluster-theoretic properties of the Markov quiver hold also for adjacency quivers of triangulations of once-punctured closed surfaces of arbitrary genus. Along the way we consider the class P of quivers introduced by…