Related papers: Dynamical Cavity Method for Hypergraphs and its Ap…
The Densest $k$-Subgraph (D$k$S) is a fundamental combinatorial problem known for its theoretical hardness and breadth of applications. Recently, Lu et al. (AAAI 2025) introduced a penalty-based non-convex relaxation that achieves promising…
Inferring the underlying graph topology that characterizes structured data is pivotal to many graph-based models when pre-defined graphs are not available. This paper focuses on learning graphs in the case of sequential data in dynamic…
Knowledge graphs (KGs) are vital for enabling knowledge reasoning across various domains. Recent KG reasoning methods that integrate both global and local information have achieved promising results. However, existing methods often suffer…
The overview-driven visual analysis of large-scale dynamic graphs poses a major challenge. We propose Multiscale Snapshots, a visual analytics approach to analyze temporal summaries of dynamic graphs at multiple temporal scales. First, we…
Uncertainty quantification (UQ) techniques are frequently used to ascertain output variability in systems with parametric uncertainty. Traditional algorithms for UQ are either system-agnostic and slow (such as Monte Carlo) or fast with…
Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure…
Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph…
Finding a list of k teams of experts, referred to as top-k team formation, with the required skills and high collaboration compatibility has been extensively studied. However, existing methods have not considered the specific collaboration…
Random constraint satisfaction problems can exhibit a phase where the number of constraints per variable $\alpha$ makes the system solvable in theory on the one hand, but also makes the search for a solution hard, meaning that common…
Results are presented for the dynamics arising due to a sudden quench of a boson interaction parameter with the simultaneous switching on of a commensurate periodic potential, the latter providing a source of non-linearity that can cause…
In this paper, we develop a novel paradigm, namely hypergraph shift, to find robust graph modes by probabilistic voting strategy, which are semantically sound besides the self-cohesiveness requirement in forming graph modes. Unlike the…
In this paper, we present a quantum algorithm for the 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…
In this article, we develop a set-oriented numerical methodology which allows to perform uncertainty quantification (UQ) for dynamical systems from a global point of view. That is, for systems with uncertain parameters we approximate the…
We study quenching dynamics of a one-dimensional transverse Ising chain with nearest neighbor antiferromagentic interactions in the presence of a longitudinal field which renders the model non-integrable. The dynamics of the spin chain is…
Motivated by the normal form of a fast-slow ordinary differential equation exhibiting a pitchfork singularity we consider the discrete-time dynamical system that is obtained by an application of the explicit Euler method. Tracking…
We study stationary states in a diluted asymmetric (kinetic) Ising model. We apply the recently introduced dynamic cavity method to compute magnetizations of these stationary states. Depending on the update rule, different versions of the…
In this paper, we propose a path following replicator dynamic, and investigate its potentials in uncovering the underlying cluster structure of a graph. The proposed dynamic is a generalization of the discrete replicator dynamic. The…
We introduce a systematic study of "symmetric quantum circuits", a new restricted model of quantum computation that preserves the symmetries of the problems it solves. This model is well-adapted for studying the role of symmetry in quantum…
We study the slow quenching dynamics (characterized by an inverse rate, $\tau^{-1}$) of a one-dimensional transverse Ising chain with nearest neighbor ferromagentic interactions across the quantum critical point (QCP) and analyze the…
We study the quadratic $k$-vertex-disjoint paths problem (Q-$k$-VDP), which seeks $k$ vertex-disjoint paths in a directed graph that minimize a nonconvex quadratic objective function. We formulate the problem as a binary quadratic program…