Related papers: Dynamical Cavity Method for Hypergraphs and its Ap…
Phase space representations of the dynamics of the quantal and classical cat map are used to explore quantum--classical correspondence in a K-system: as $\hbar \to 0$, the classical chaotic behavior is shown to emerge smoothly and exactly.…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
We consider the densest $k$-subgraph problem, which seeks to identify the $k$-node subgraph of a given input graph with maximum number of edges. This problem is well-known to be NP-hard, by reduction to the maximum clique problem. We…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete…
We introduce a new algorithmic framework for designing dynamic graph algorithms in minor-free graphs, by exploiting the structure of such graphs and a tool called vertex sparsification, which is a way to compress large graphs into small…
We develop a generic method to compute the dynamics induced by quenches in completely connected quantum systems. These models are expected to provide a mean-field description at least of the short time dynamics of finite dimensional system.…
In this paper, we develop a dynamical system counterpart to the term sparsity sum-of-squares (TSSOS) algorithm proposed for static polynomial optimization. This allows for computational savings and improved scalability while preserving…
Arising user-centric graph applications such as route planning and personalized social network analysis have initiated a shift of paradigms in modern graph processing systems towards multi-query analysis, i.e., processing multiple graph…
In these two lectures we shall discuss how the cavity approach can be used efficiently to study optimization problems with global (topological) constraints and how the same techniques can be generalized to study inverse problems in…
Force-directed algorithms are widely used for visualizing graphs. However, these algorithms are computationally expensive in producing good quality layouts for complex graphs. The layout quality is largely influenced by execution time and…
We study the phase diagram of a one-dimensional balls-in-boxes (BIB) model that has been proposed as an effective model for the spatial-volume dynamics of (2+1)-dimensional causal dynamical triangulations (CDT). The latter is a statistical…
We discuss the quench dynamics near a quantum critical point focusing on the sine-Gordon model as a primary example. We suggest a unified approach to sudden and slow quenches, where the tuning parameter $\lambda(t)$ changes in time as…
Dynamical decoupling is a central technique in quantum computing for actively suppressing decoherence and systematic imperfections through sequences of single-qubit operations. Conventional sequences typically aim to completely freeze…
Quantum algorithms offer the potential for significant computational advantages; however, in many cases, it remains unclear how these advantages can be practically realized. Causal Set Theory is a discrete, Lorentz-invariant approach to…
A dynamic graph algorithm is a data structure that supports edge insertions, deletions, and specific problem queries. While extensive research exists on dynamic algorithms for graph problems solvable in polynomial time, most of these…
Given an undirected graph and a size parameter $k$, the Densest $k$-Subgraph (D$k$S) problem extracts the subgraph on $k$ vertices with the largest number of induced edges. While D$k$S is NP--hard and difficult to approximate, penalty-based…
In this paper, we study new batch-dynamic algorithms for the $k$-clique counting problem, which are dynamic algorithms where the updates are batches of edge insertions and deletions. We study this problem in the parallel setting, where the…
In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known…
Identifying cohesive subgraphs in hypergraphs is a fundamental problem that has received recent attention in data mining and engineering fields. Existing approaches mainly focus on a strongly induced subhypergraph or edge cardinality,…
We consider data-driven reachability analysis of discrete-time stochastic dynamical systems using conformal inference. We assume that we are not provided with a symbolic representation of the stochastic system, but instead have access to a…