Related papers: Coalgebraic Tools for Randomness-Conserving Protoc…
We introduce the concept of compactly representing a large number of state sequences, e.g., sequences of activities, as a flow diagram. We argue that the flow diagram representation gives an intuitive summary that allows the user to detect…
Proving compositionality of behavioral equivalence on state-based systems with respect to algebraic operations is a classical and widely studied problem. We study a categorical formulation of this problem, where operations on state-based…
A general method is presented for modeling high entropy alloys as ensembles of randomly sampled, ordered configurations on a given lattice. Statistical mechanics is applied post hoc to derive the ensemble properties as a function of…
Reduced-order modeling is an efficient approach for solving parameterized discrete partial differential equations when the solution is needed at many parameter values. An offline step approximates the solution space and an online step…
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of $n$ identical agents (finite state machines) performs a global task like electing a unique leader or determining the…
State abstraction has been an essential tool for dramatically improving the sample efficiency of reinforcement-learning algorithms. Indeed, by exposing and accentuating various types of latent structure within the environment, different…
To date, most probabilistic reasoning systems have relied on a fixed belief network constructed at design time. The network is used by an application program as a representation of (in)dependencies in the domain. Probabilistic inference…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular that we cover not only classical…
We investigate the theory of thermodynamic formalism from the perspective of computable analysis, with a special focus on the computability of equilibrium states. Specifically, we develop two complementary general approaches to verify the…
Resource theories can be used to formalize the quantification and manipulation of resources in quantum information processing such as entanglement, asymmetry and coherence of quantum states, and incompatibility of quantum measurements.…
We introduce structured random matrix ensembles, constructed to model many-body quantum systems with local interactions. These ensembles are employed to study equilibration of isolated many-body quantum systems, showing that rather complex…
We establish a technique to find the states with most robust entanglement in dissipative quantum systems and explicitly construct those state for various environments.
A general framework to describe a vast majority of biology-inspired systems is to model them as stochastic processes in which multiple couplings are in play at the same time. Molecular motors, chemical reaction networks, catalytic enzymes,…
Algorithms to simulate the ring-exchange models using the projected entangled pair states (PEPS) are developed. We generalize the imaginary time evolution (ITE) method to optimize PEPS wave functions for the models with ring-exchange…
We propose a general methodology for performing statistical inference within a `rare-events regime' that was recently suggested by Wagner, Viswanath and Kulkarni. Our approach allows one to easily establish consistent estimators for a very…
We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We show that the subspace constraint leads to an accelerated…
When the dynamics of a system are difficult to model and/or time-consuming to evaluate, such as in deformable object manipulation tasks, motion planning algorithms struggle to find feasible plans efficiently. Such problems are often reduced…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…
A detailed exposition of foundations of a logic-algebraic model for reasoning with knowledge bases specified by propositional (Boolean) logic is presented. The model is conceived from the logical translation of usual derivatives on…
Population balance framework is a useful tool that can be used to describe size distribution of droplets in a liquid-liquid dispersion. Breakup and coalescence models provide closures for mathematical formulation of the population balance…