Related papers: Network-theoretic approach to sparsified discrete …
In this paper we develop a theory to describe innovation processes in a network of interacting units. We introduce a stochastic picture that allows for the clarification of the role of fluctuations for the survival of innovations in such a…
Dynamic connectivity is a fundamental dynamic graph problem, and recent algorithmic breakthroughs on dynamic graph sketching have reshaped what is theoretically possible: by encoding the graph as per-vertex linear sketches, these algorithms…
The vortex dynamics and the specific heat of a type II superconducting system with quasi-periodic geometry is studied theoretically for different values of interaction parameters using the numerical simulation technique, where the…
The ability to detect weak distributed activation patterns in networks is critical to several applications, such as identifying the onset of anomalous activity or incipient congestion in the Internet, or faint traces of a biochemical spread…
Wave interaction theory can be used as a tool to understand and predict instability in a variety of homogeneous and stratified shear flows. It is however, most often limited to piecewise-linear profiles of the shear layer background…
We report the experimental observation of vortex leapfrogging in a two-dimensional fluid of light. By imprinting two vortex-antivortex pairs and tracking their real-time evolution through phase-resolved imaging, we observe a dynamics that…
The dynamics of a constrained three-vortex problem, a free point vortex pair in the velocity field of a fixed point vortex, is investigated. The underlying dynamical system is simplified using a coordinate transformation and categorized…
Modern energy systems in vehicles and built infrastructure are governed by high-dimensional dynamics spanning multiple physical domains (e.g., electrical, thermal, mechanical) and timescales. This tutorial paper presents a graph-based…
Inferring topological characteristics of complex networks from observed data is critical to understand the dynamical behavior of networked systems, ranging from the Internet and the World Wide Web to biological networks and social networks.…
The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical…
We get point vortices dynamics equations on a rotating sphere surface directly from the hydrodynamic equations as representing their weak exact solution contrary to the conventional case of the use of a kinematic relationship between a…
The density functional approach for classical associating fluids is used to explore the wetting phase diagrams for model systems consisting of water and graphite-like solid surfaces chemically modified by a small amount of grafted chain…
We analyze the vortex dynamics and vortex-vortex interactions in Bose-Einstein condensates confined in toroidal traps. We show that this particular geometry strongly distorts the vortex dynamics. The numerically calculated vortex…
Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks…
We present a status report on a discrete approach to the the near-equilibrium statistical theory of three-dimensional turbulence, which generalizes earlier work by no longer requiring that the vorticity field be a union of discrete vortex…
Clusters of co-rotating vortices on compact fluid domains exhibit a simple collective dynamics, combining coherent global rotation with a slow breathing of the cluster size. In this work, we investigate an analytically tractable model of…
How might one "reduce" a graph? That is, generate a smaller graph that preserves the global structure at the expense of discarding local details? There has been extensive work on both graph sparsification (removing edges) and graph…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
The theory of point vortex dynamics has existed since Kirchhoff's proposal in 1891 and is still under development with connections to many fields in mathematics. As a strong simplification of the concept of vorticity it excels in…
Built upon the shoulders of graph theory, the field of complex networks has become a central tool for studying real systems across various fields of research. Represented as graphs, different systems can be studied using the same analysis…