Related papers: Dynamic Complexity of Expansion
The universal concept of complexity by the dynamic redundance paradigm and the ensuing concept of extended dynamic fractality (physics/9806002) are applied here to higher levels of complexity corresponding to living systems. After recalling…
Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes. In this paper,…
Dynamic aperture is an important concept for the study of non-linear beam dynamics in circular accelerators. It describes the extent of the phase-space region where a particle's motion remains bounded over a given number of turns.…
We prove that dynamical degrees of rational self-maps on projective varieties can be interpreted as spectral radii of naturally defined operators on suitable Banach spaces. Generalizing Shokurov's notion of b-divisors, we consider the space…
The pentagram map, introduced by Schwartz in 1992, is a dynamical system on the moduli space of polygons in the projective plane. Its real and complex dynamics have been explored in detail. We study the pentagram map over an arbitrary…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
We developed DyGETViz, a novel framework for effectively visualizing dynamic graphs (DGs) that are ubiquitous across diverse real-world systems. This framework leverages recent advancements in discrete-time dynamic graph (DTDG) models to…
It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…
We study the implications of coupling Langmuir kinetics (LK) process with the dynamics of an extending lattice. The model that we consider couples dynamically extending exclusion process (DEEP) with the process of random attachment and…
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different…
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…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
Dynamic graph neural networks (DyGNNs) have demonstrated powerful predictive abilities by exploiting graph structural and temporal dynamics. However, the existing DyGNNs fail to handle distribution shifts, which naturally exist in dynamic…
For a dominant rational self-map on a smooth projective variety defined over a number field, Shu Kawaguchi and Joseph H. Silverman conjectured that the dynamical degree is equal to the arithmetic degree at a rational point whose forward…
In this chapter, we utilize dynamical systems to analyze several aspects of machine learning algorithms. As an expository contribution we demonstrate how to re-formulate a wide variety of challenges from deep neural networks, (stochastic)…
We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first…
The pentagram map that associates to a projective polygon a new one formed by intersections of short diagonals was introduced by R. Schwartz and was shown to be integrable by V. Ovsienko, R. Schwartz and S. Tabachnikov. Recently, M. Glick…
It is by now well established that, by means of the integration by part identities, all the integrals occurring in the evaluation of a Feynman graph of given topology can be expressed in terms of a few independent master integrals. It is…