English
Related papers

Related papers: Weighted Branching Simulation Distance for Paramet…

200 papers

An algorithm for approximating the p-Wasserstein distance between histograms defined on unstructured discrete grids is presented. It is based on the computation of a barycenter constrained to be supported on a low dimensional subspace,…

Numerical Analysis · Mathematics 2020-09-24 Nicolas Papadakis

Phrase structure trees have a hierarchical structure. In many subjects, most notably in Taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which…

Computation and Language · Computer Science 2015-12-04 Mark D. Roberts

Security properties of real-time systems often involve reasoning about hyper-properties, as opposed to properties of single executions or trees of executions. These hyper-properties need to additionally be expressive enough to reason about…

Cryptography and Security · Computer Science 2024-05-21 Nabarun Deka , Minjian Zhang , Rohit Chadha , Mahesh Viswanathan

This paper considers the problem of distributed state estimation using multi-robot systems. The robots have limited communication capabilities and, therefore, communicate their measurements intermittently only when they are physically close…

Robotics · Computer Science 2019-03-12 Reza Khodayi-mehr , Yiannis Kantaros , Michael M. Zavlanos

Branched structures that evolve over time critically determine the function of various natural and engineered systems, including growing vasculature, neural arborization, pulmonary networks such as lungs, river basins, power distribution…

Statistical Mechanics · Physics 2026-03-04 Fabian H. Kreten , Ludger Santen , Reza Shaebani

We discuss two versions of the Fr\'echet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance…

Computational Geometry · Computer Science 2010-04-29 Yam Ki Cheung , Ovidiu Daescu

Reachability problems in infinite-state systems are often subject to extremely high complexity. This motivates the investigation of efficient overapproximations, where we add transitions to obtain a system in which reachability can be…

Formal Languages and Automata Theory · Computer Science 2022-06-28 Moses Ganardi , Rupak Majumdar , Georg Zetzsche

We define a modified Wasserstein distance for distribution clustering which inherits many of the properties of the Wasserstein distance but which can be estimated easily and computed quickly. The modified distance is the sum of two terms.…

Methodology · Statistics 2018-12-31 Isabella Verdinelli , Larry Wasserman

This paper tackles the problem of nonlinear systems, with sublinear growth but unbounded control, under perturbation of some time-varying state constraints. It is shown that, given a trajectory to be approximated, one can find a neighboring…

Optimization and Control · Mathematics 2022-06-22 Pierre-Cyril Aubin-Frankowski

Simulating physical systems is a core component of scientific computing, encompassing a wide range of physical domains and applications. Recently, there has been a surge in data-driven methods to complement traditional numerical simulations…

Machine Learning · Computer Science 2021-08-19 Karl Otness , Arvi Gjoka , Joan Bruna , Daniele Panozzo , Benjamin Peherstorfer , Teseo Schneider , Denis Zorin

In this article, we present a novel inference framework for estimating the parameters of Continuous-State Branching Processes (CSBPs). We do so by leveraging their subordinator representation. Our method reformulates the estimation problem…

In finite-dimensional systems, circuit knitting can be used to simulate non-classical quantum operations using a limited set of resources. In this work, we extend circuit knitting techniques to infinite-dimensional quantum systems. We…

Quantum Physics · Physics 2025-09-10 Shao-Hua Hu , Ray-Kuang Lee

The aim of this paper is to approximate a finite-state Markov process by another process with fewer states, called herein the approximating process. The approximation problem is formulated using two different methods. The first method,…

Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…

Probability · Mathematics 2021-01-29 Noah Forman

The goal of this work is to formally abstract a Markov process evolving in discrete time over a general state space as a finite-state Markov chain, with the objective of precisely approximating its state probability distribution in time,…

Logic in Computer Science · Computer Science 2017-01-11 Sadegh Esmaeil Zadeh Soudjani , Alessandro Abate

With the rapid increase in mobile subscribers, there is a drive towards achieving higher data rates, prompting the use of higher frequencies in future wireless communication technologies. Wave propagation channel modeling for these…

Signal Processing · Electrical Eng. & Systems 2024-06-13 Xueyun Long , Amina Fellan , Mario Pauli , Hans D. Schotten , Thomas Zwick

Simulating the nonequilibrium dynamics of thermal states is a fundamental problem across scales from high energy to condensed matter physics. Quantum computers may provide a way to solve this problem efficiently. Preparing a thermal state…

Quantum Physics · Physics 2023-11-03 Jason Saroni , Henry Lamm , Peter P. Orth , Thomas Iadecola

Localised structures appear in a wide variety of systems, arising from a pinning mechanism due to the presence of a small-scale pattern or an imposed grid. When there is a separation of lengthscales, the width of the pinning region is…

Pattern Formation and Solitons · Physics 2015-05-28 P. C. Matthews , H. Susanto

Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here, we propose a behavioral equivalence for feature transition systems (FTS)…

Logic in Computer Science · Computer Science 2015-04-15 Tessa Belder , Maurice H. ter Beek , Erik P. de Vink

We address the problem of learning temporal properties from the branching-time behavior of systems. Existing research in this field has mostly focused on learning linear temporal properties specified using popular logics, such as Linear…

Logic in Computer Science · Computer Science 2024-07-01 Benjamin Bordais , Daniel Neider , Rajarshi Roy