Related papers: Unstable Graphs: A Fresh Outlook via TF-Automorphi…

Linear stability of stratified two-phase flows in horizontal channels to arbitrary wavenumber disturbances is studied. The problem is reduced to Orr-Sommerfeld equations for the stream function disturbances, defined in each sublayer and…

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…

Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…

We present the first non-trivial fully dynamic algorithm maintaining exact single-source distances in unweighted graphs. This resolves an open problem stated by Sankowski [COCOON 2005] and van den Brand and Nanongkai [FOCS 2019]. Previous…

For a fixed topological Markov shift, we consider measure-preserving dynamical systems of Gibbs measures for 2-locally constant functions on the shift. We also consider isomorphisms between two such systems. We study the set of all…

Let $F$ be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set $\mathbb{Z}$, so that the degrees of the vertices are i.i.d.\ random…

The two-fold singularity has played a significant role in our understanding of uniqueness and stability in piecewise smooth dynamical systems. When a vector field is discontinuous at some hypersurface, it can become tangent to that surface…

In this work, we study the dynamics of piecewise smooth systems on a codimension-2 transverse intersection of two codimension-1 discontinuity sets. The Filippov convention can be extended to such intersections, but this approach does not…

We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…

Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an…

The connection between network topology and stability remains unclear. General approaches that clarify this relationship and allow for more efficient stability analysis would be desirable. Inspired by chemical reaction networks, I…

Kinetic simulations have demonstrated that three-dimensional reconnection in collisionless regimes proceeds through the formation and interaction of magnetic flux ropes, which are generated due to the growth of tearing instabilities at…

The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any…

The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…

In this article it is proved that the dynamical properties of a broad class of semilinear parabolic problems are sensitive to arbitrarily small but smooth perturbations of the nonlinear term, when the spatial dimension is either equal to…

Let $X$ be a connected Cayley graph on an abelian group of odd order, such that no two distinct vertices of $X$ have exactly the same neighbours. We show that the direct product $X \times K_2$ (also called the "canonical double cover" of…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

The canonical double cover $\D(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\Aut(\D(\Gamma))\cong\Aut(\Gamma)\times\ZZ_2$ then $\Gamma$ is called stable; otherwise $\Gamma$ is called unstable. An unstable…

We construct a smooth algebraic stack of tuples consisting of genus two nodal curves, simple effective divisors away from the nodes, and twisted fields. It provides a desingularization of the moduli of genus two stable maps to projective…

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…