Related papers: Dynamic Light Spanners in Doubling Metrics
Tree spanners approximate distances within graphs; a subtree of a graph is a tree $t$-spanner of the graph if and only if for every pair of vertices their distance in the subtree is at most $t$ times their distance in the graph. When a…
The Vertex Separator Problem (VSP) on a graph is the problem of finding the smallest collection of vertices whose removal separates the graph into two disjoint subsets of roughly equal size. Recently, Hager and Hungerford [1] developed a…
The Dynamic Hubbard Model represents the physics of a multi-band Hubbard model by using a pseudo-spin degree of freedom to dynamically modify the on-site Coulomb interaction. Here we use a dimer system to obtain analytical results for this…
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…
A spanner graph on a set of points in $R^d$ contains a shortest path between any pair of points with length at most a constant factor of their Euclidean distance. In this paper we investigate new models and aim to interpret why good…
In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n$-vertex graph $G=(V,E,w)$ with positive real edge weights, and our goal is to maintain a tree which is a good…
In geometric measure theory, there is interest in studying the interaction of measures with rectifiable sets. Here, we extend a theorem of Badger and Schul in Euclidean space to characterize rectifiable pointwise doubling measures in…
Relationship for dynamical properties in the vicinity of fixed points between two-dimensional continuous and its positivity-preserving discretized dynamical systems is studied. Based on linear stability analysis, we reveal the conditions…
We investigate the dynamics of the pendulum suspended on the forced Duffing oscillator. The detailed bifurcation analysis in two parameter space (amplitude and frequency of excitation) which presents both oscillating and rotating periodic…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
Dynamic networks consist of a sequence of time-varying networks, and it is of great importance to detect the network change points. Most existing methods focus on detecting abrupt change points, necessitating the assumption that the…
The unit disk graph (UDG) is a widely employed model for the study of wireless networks. In this model, wireless nodes are represented by points in the plane and there is an edge between two points if and only if their Euclidean distance is…
We propose a forward-backward splitting dynamical system for solving inclusion problems of the form $0\in A(x)+B(x)$ in Hilbert spaces, where $A$ is a maximal operator and $B$ is a single-valued operator. Involved operators are assumed to…
Deep metric learning maps visually similar images onto nearby locations and visually dissimilar images apart from each other in an embedding manifold. The learning process is mainly based on the supplied image negative and positive training…
For solving unsteady hyperbolic conservation laws on cut cell meshes, the so called small cell problem is a big issue: one would like to use a time step that is chosen with respect to the background mesh and use the same time step on the…
A set of vertices $X\subseteq V(G)$ is a $d$-distance dominating set if for every $u\in V(G)\setminus X$ there exists $x\in X$ such that $d(u,x) \le d$, and $X$ is a $p$-packing if $d(u,v) \ge p+1$ for every different $u,v\in X$. The…
A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known…
Dynamic space packing (DSP) is a random process with sequential addition and removal of identical objects into space. In the lattice version, objects are particles occupying single lattice sites, and adding a particle to a lattice site…
We present a numerical scheme to study the dynamics of slow light and light storage in an electromagneticallyinduced- transparency (EIT) medium at finite temperatures. Allowing for the motional coupling, we derive a set of coupled…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…