Related papers: Dynamic Complexity of Expansion
We extend the notion of spectral independence (introduced by Anari, Liu, and Oveis Gharan [ALO20]) from the Boolean domain to general discrete domains. This property characterises distributions with limited correlations, and implies that…
Dynamical systems provide a comprehensive way to study complex and changing behaviors across various sciences. Many modern systems are too complicated to analyze directly or we do not have access to models, driving significant interest in…
Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed,…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues.…
The paper deals with the integral equation approach to steady kinematic dynamo models in finite domains based on Biot-Savart's law. The role of the electric potential at the boundary is worked out explicitly. As an example, a modified…
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of…
We present a perturbation theory by extending a prescription due to Feynman for computing the probability density function for the random flight motion. The method can be applied to a wide variety of otherwise difficult circumstances. The…
We examine the diffraction properties of lattice dynamical systems of algebraic origin. It is well-known that diverse dynamical properties occur within this class. These include different orders of mixing (or higher-order correlations), the…
Graphs naturally appear in several real-world contexts including social networks, the web network, and telecommunication networks. While the analysis and the understanding of graph structures have been a central area of study in algorithm…
Recently, Li et al. [2022] presented a dynamic Dyck-reachability algorithm for bidirected graphs. The basic idea is based on updating edge weights in a data structure called the merged graph $G_m$. As noted in Krishna et al. [2023], the…
Dynamical vertex approximation is a Feynman diagrammatic extension of dynamical mean field theory, including non-local correlations on all time and length scales. Starting with the Dyson and the parquet equations, the lecture notes give an…
In edge orientations, the goal is usually to orient (direct) the edges of an undirected $n$-vertex graph $G$ such that all out-degrees are bounded. When the graph $G$ is fully dynamic, i.e., admits edge insertions and deletions, we wish to…
We consider a time varying analogue of the Erd{\H o}s-R{\' e}nyi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are determined by the edges, which evolve…
The pentagram map was introduced by R. Schwartz more than 20 years ago. In 2009, V. Ovsienko, R. Schwartz and S. Tabachnikov established Liouville complete integrability of this discrete dynamical system. In 2011, M. Glick interpreted the…
Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal $O(n \log n)$ sampling algorithms on bounded-degree graphs…
A constructive version of Newton-Puiseux theorem for computing the Puiseux expansions of algebraic curves is presented. The proof is based on a classical proof by Abhyankar. Algebraic numbers are evaluated dynamically; hence the base field…
We review the progress made on bounding the number of independent sets in $d$-regular and irregular graphs over the last 31 years. We particularly focus on contributions from Kahn, Zhao, and Sah et al. in incrementally proving stronger and…
A multidimensional chaos is generated by a special initial value problem for the non-autonomous impulsive differential equation. The existence of a chaotic attractor is shown, where density of periodic solutions, sensitivity of solutions…
The dynamics of the family of maps $\displaystyle{f_{\alpha, \beta, \gamma, \delta}(z)=\frac{\alpha z + \beta}{\gamma z^2 +\delta z}}$ in complex plane is investigated computationally. This dynamical system $z_{n+1}=f_{\alpha, \beta,…