Related papers: A graph-dynamical interpretation of Kiselman's sem…
The formation and properties of a supersolid structure in a three-component ultracold Bose gas mixture at T=0 are investigated theoretically. The system consists of 23Na, 39K, and 41K atomic species, in which the binary mixtures of…
Learning unknown stochastic differential equations (SDEs) from observed data is a significant and challenging task with applications in various fields. Current approaches often use neural networks to represent drift and diffusion functions,…
This paper presents a novel approach to analyze quasiperiodically driven dynamical systems. It aims to develop a complete data-driven framework for modeling such unknown dynamics. To achieve this, we characterize Koopman eigenfrequencies as…
Representation learning on dynamic graphs requires capturing complex dependencies that evolve across both time and structure. Existing approaches typically adopt fixed temporal decay schemes or predetermined structural propagation depths,…
A central theme in Iachello's quest for understanding simple ordered patterns in complex quantum systems, is the concept of dynamical symmetry. Relying on his seminal contributions, we present further generalization of this notion to that…
A set $S \subseteq V$ is a dominating set in G if for every u \in V \ S, there exists $v \in S$ such that $(u,v) \in E$, i.e., $N[S] = V$. A dominating set $S$ is an Isolate Dominating Set} (IDS) if the induced subgraph $G[S]$ has at least…
We will construct a theory which can explain the dynamics toward the steady state self-gravitating systems (SGSs) where many particles interact via the gravitational force. Real examples of SGS in the universe are globular clusters and…
Most of the dynamic graph representation learning methods involve dividing a dynamic graph into discrete snapshots to capture the evolving behavior of nodes over time. Existing methods primarily capture only local or global structures of…
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations…
From a logic point of view this is the third in the series to solve the problem of absence of detailed balance. This paper will be denoted as SDS III. The existence of a dynamical potential with both local and global meanings in general…
Hamiltonians of a wide-spread class of strongly coupled quantum system models are expressed as nonlinear functions of $sl(2)$ generators. It enables us to use the $sl(2)$ formalism, in particular, $sl(2)$ generalized coherent states (GCS)…
We present an example of a partial dynamical symmetry (PDS) in an interacting fermion system and demonstrate the close relationship of the associated Hamiltonians with a realistic quadrupole-quadrupole interaction, thus shedding new light…
We address the problem of understanding the variable abundance of 3-node and 4-node subgraphs (motifs) in complex networks from a dynamical point of view. As a criterion in the determination of the functional significance of a n-node…
We consider global dynamics of reaction systems as introduced by Ehrenfeucht and Rozenberg. The dynamics is represented by a directed graph, the so-called transition graph, and two reaction systems are considered equivalent if their…
For a symmetric positive semidefinite linear system of equations $\mathcal{Q} {\bf x} = {\bf b}$, where ${\bf x} = (x_1,\ldots,x_s)$ is partitioned into $s$ blocks, with $s \geq 2$, we show that each cycle of the classical block symmetric…
Let $S_n$ denote the symmetric group of degree $n$ with $n\geq 3$. Set $S=\{c_n=(1\ 2\ldots \ n),c_n^{-1},(1\ 2)\}$. Let $\Gamma_n=\mathrm{Cay}(S_n,S)$ be the Cayley graph on $S_n$ with respect to $S$. In this paper, we show that $\Gamma_n$…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the configuration of neighboring states. More concisely, it is given…
In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given a graph $G=(V,E)$ subject to edge insertions and deletions and a source vertex $s\in V$, and the goal is to maintain the distance $d(s,t)$ for all $t\in V$.…
The transfer operator (TO) formalism of the dynamical systems (DS) theory is reformulated here in terms of the recently proposed supersymetric theory of stochastic differential equations (SDE). It turns out that the stochastically…