相关论文: A One-Step Cascade Symmetric Model: Rank-$1$ Packe…

Exclusion processes in one dimension first appeared in the 70s and have since dragged much attention from communities in different domains: stochastic processes, out-of-equilibriums statistical physics, and more recently integrable systems.…

The totally asymmetric simple exclusion process in discrete time is considered on finite rings with fixed number of particles. A translation-invariant version of the backward-ordered sequential update is defined for periodic boundary…

Identifying spatially contiguous clusters and repeated spatial patterns (RSP) characterized by similar underlying distributions that are spatially apart is a key challenge in modern spatial statistics. Existing constrained clustering…

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: they do not scale to process large graphs and/or support only a restricted set of search templates or…

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

We review the circumstances under which test particles can be localized around a spacetime section \Sigma_0 smoothly contained within a codimension-1 embedding space M. If such a confinement is possible, \Sigma_0 is said to be totally…

We consider closed manifolds that possess a so called rank one ray structure. That is a (flat) affine structure such that the linear part is given by the products of a diagonal transformation and a commuting rotation. We show that closed…

The aim of this paper is to give new insights about families of integrable systems lifting a Hamiltonian $S^1$-space. Specifically, we study one-parameter families $(M^4,\omega,F_t=(J,H_t))_{0 \leq t \leq 1}$ of systems with a fixed…

We define a family of asymmetric processes for particles on a one-dimensional lattice, depending on a continuous parameter $\lambda \in [0,1] $, interpolating between the completely asymmetric processes [1] (for $\lambda =1$) and the n=1…

Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…

We outline an algorithm to recover the canonical (or, coarsest) stratification of a given finite-dimensional regular CW complex into cohomology manifolds, each of which is a union of cells. The construction proceeds by iteratively…

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…

Time-delay embedding is a fundamental technique in Topological Data Analysis (TDA) for reconstructing the phase space dynamics of time-series data. Persistent homology effectively identifies global topological features, such as loops…

Optimization under structural constraints is typically analyzed through projection or penalty methods, obscuring the geometric mechanism by which constraints shape admissible dynamics. We propose an operator-theoretic formulation in which…

A path-following control algorithm enables a system's trajectories under its guidance to converge to and evolve along a given geometric desired path. There exist various such algorithms, but many of them can only guarantee local convergence…

We propose a rank-one Riemannian subspace descent algorithm for computing symmetric positive definite (SPD) solutions to nonlinear matrix equations arising in control theory, dynamic programming, and stochastic filtering. For solution…

The symmetric simple exclusion process (SEP), where diffusive particles cannot overtake each other, is a paradigmatic model of transport in the single-file geometry. In this model, the study of currents has attracted a lot of attention, but…

We study the block-coordinate forward-backward algorithm in which the blocks are updated in a random and possibly parallel manner, according to arbitrary probabilities. The algorithm allows different stepsizes along the block-coordinates to…

We study $\mathsf{RCD}$-spaces $(X,d,\mathfrak{m})$ with group actions by isometries preserving the reference measure $\mathfrak{m}$ and whose orbit space has dimension one, i.e. cohomogeneity one actions. To this end we prove a Slice…

We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points…