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

By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…

For a certain class of open quantum systems there exists a dynamical symmetry which connects different time-evolved density matrices. We show how to use this symmetry for dynamics in the Liouville space with time-dependent parameters. This…

We consider the model of random interlacements on transient graphs, which was first introduced by Sznitman [Ann. of Math. (2) (2010) 171 2039-2087] for the special case of ${\mathbb{Z}}^d$ (with $d\geq3$). In Sznitman [Ann. of Math. (2)…

We develop a linear theory of discrete complex analysis on general quad-graphs, continuing and extending previous work of Duffin, Mercat, Kenyon, Chelkak and Smirnov on discrete complex analysis on rhombic quad-graphs. Our approach based on…

It has been shown that the adjacency eigenspace of a network contains key information of its underlying structure. However, there has been no study on spectral analysis of the adjacency matrices of directed signed graphs. In this paper, we…

In this paper we use retraction and discretization maps (see [Barbero Li\~n\'an and Mart\'in de Diego, 2022]) as a tool for deriving in a systematic way numerical integrators preserving geometric structures (such as symplecticity or…

We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues $E_n$ is computable analytically, explicitly, and individually for any given $n$. This is surprising, since quantum graphs are…

We consider a finite group acting on a vector space and the corresponding skew group algebra generated by the group and the symmetric algebra of the space. This skew group algebra illuminates the resulting orbifold and serves as a…

Let $k$ be a field of positive characteristic $p$, and $X$ be a separated of finite type $k$-scheme of dimension $d$. We construct a cycle map from the additive cycle complex to the residual complex of Serre-Grothendieck coherent duality…

The first part of the present paper is devoted to a systematic construction of continuous-time finite-dimensional integrable systems arising from the rational su(2) Gaudin model through certain contraction procedures. In the second part, we…

Miquel dynamics is a discrete time dynamics for circle patterns, which relies on Miquel's six circle theorem. Previous work shows that the evolution of the circle centers satisfy the dSKP equation on the octahedral lattice $A_3$. As a…

The logistic map is a paradigmatic dynamical system originally conceived to model the discrete-time demographic growth of a population, which shockingly, shows that discrete chaos can emerge from trivial low-dimensional non-linear dynamics.…

We provide a graphical calculus for computing averages of tensor network diagrams with respect to the distribution of random vectors containing independent uniform complex phases. Our method exploits the order structure of the partially…

We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides useful visualization, even for very large networks; and allows…

We study some classical integrable systems naturally associated with multiplicative quiver varieties for the (extended) cyclic quiver with $m$ vertices. The phase space of our integrable systems is obtained by quasi-Hamiltonian reduction…

We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…

Decision Diagrams (DDs) have emerged as a powerful tool for discrete optimization, with rapidly growing adoption. DDs are directed acyclic layered graphs; restricted DDs are a generalized greedy heuristic for finding feasible solutions, and…

Graph clustering is a fundamental problem that has been extensively studied both in theory and practice. The problem has been defined in several ways in literature and most of them have been proven to be NP-Hard. Due to their high practical…

We propose a new approach to building log-canonical coordinate charts for any simply-connected simple Lie group $\G$ and arbitrary Poisson-homogeneous bracket on $\G$ associated with Belavin--Drinfeld data. Given a pair of representatives…

Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice for large graphs. In this paper we leverage the…