Related papers: Fixed Points and 2-Cycles of Synchronous Dynamic C…
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…
We prove that if a continuous piecewise-smooth map on $\mathbb{R}^n$ is comprised of two linear functions, has a bounded orbit, and satisfies a certain non-degeneracy condition, then it has a fixed point. The result has important…
Highly dynamic networks are characterized by frequent changes in the availability of communication links. These networks are often partitioned into several components, which split and merge unpredictably. We present a distributed algorithm…
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree…
This paper investigates concurrency-constrained scheduling problems, where the objective is to construct a schedule for a set of jobs subject to concurrency restrictions. Formally, we are given a conflict graph $G$ defined over a set of $n$…
Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system…
We develop a framework for applying treewidth-based dynamic programming on graphs with "hybrid structure", i.e., with parts that may not have small treewidth but instead possess other structural properties. Informally, this is achieved by…
Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subject to edge deletions and insertions. It is one of the most…
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several…
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…
Many real-world objects can be modeled as a stream of events on the nodes of a graph. In this paper, we propose a class of graphical event models named temporal point process graphical models for representing the temporal dependencies among…
It is known that every homeomorphism of the plane has a fixed point in a non-separating, invariant subcontinuum. Easy examples show that a branched covering map of the plane can be periodic point free. In this paper we show that any…
It is known that the gradient method can be viewed as a dynamic system where various iterative schemes can be designed as a part of the closed loop system with desirable properties. In this paper, the finite-time and fixed-time convergence…
We study two coupled discrete-time equations with different (asynchronous) periodic time scales. The coupling is of the type sample and hold, i.e., the state of each equation is sampled at its update times and held until it is read as an…
In the context of discrete dynamical systems and their applications, fixed points often have a clear interpretation. This is indeed a central topic of gene regulatory mechanisms modeled by Boolean automata networks (BANs), where a…
Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token swapping, the goal is to use the shortest possible sequence of swaps, each of which…
This paper introduce a new class of operators and contraction mapping for a cyclical map T on G-metric spaces and the approximately fixed point properties. Also,we prove two general lemmas regarding approximate fixed Point of cyclical…
In this paper, we address the optimal control of stochastic matching models on general graphs and single arrivals having fixed arrival rates, as introduced in \cite{MaiMoy16}. On the `N-shaped' graph, by following the dynamic programming…
In the GEODETIC SET problem, an input is a (di)graph $G$ and integer $k$, and the objective is to decide whether there exists a vertex subset $S$ of size $k$ such that any vertex in $V(G)\setminus S$ lies on a shortest (directed) path…
The topology of social networks can be understood as being inherently dynamic, with edges having a distinct position in time. Most characterizations of dynamic networks discretize time by converting temporal information into a sequence of…