SearcharxivSearch

arXiv subjects

Yuliy Baryshnikov

Publications and source records attributed to Yuliy Baryshnikov.

At least 19 recordsLinked to original sources

Multi-floor generalization of TASEP

We consider an interacting particle system, which generalizes the classical totally asymmetric simple exclusion process (TASEP), in that each site can contain up to a fixed finite number of particles, and the particle movement is governed by a {\em back-pressure} (BP) algorithm (also often called {\em MaxWeight}). There are $N$ sites (with $N$ finite or infinite), each may contain at most $c$ particles, $1 \le c < \infty$. New particles enter the system at the left-most site $1$ as a Poisson process of rate $α\le 1$, unless site $1$ has $c$ particles. Particles (if any) are removed from the right-most site $N$ as a Poisson process of rate $β\le 1$. The left-to-right movement of particles between neighboring sites is governed by the BP rule: one particle moves from site $n$ to $n+1$ at epochs of a rate $1$ Poisson process, as long as the former site has strictly more particles than the latter. When $c=1$, this is the standard TASEP. Our main results address the asymptotics of the stationary distribution of a finite system, and especially the limit of the flux (current) as $N\to\infty$. In particular, we prove that interesting non-trivial phase transitions take place in a system with $c>1$. For example, if $c>1$ and $1/2 \le β\le 1$, the maximum limiting flux $1/4$ is achieved as long as $α\ge α_c^*$, where $α_c^* < 1/2$ is some non-trivial threshold. (For the standard TASEP the threshold is $1/2$.) We also put forward a general conjecture about the stationary distribution asymptotics under an arbitrary parameter setting. We illustrate our formal results and the conjecture by simulations, and identify interesting directions for further research.

math.PR

Ising Disks: Topology Preserving Glauber Dynamics

We introduce a dynamic model where the state space is the set of contractible cubical sets in the Euclidian space. The permissible state transitions, that is addition and removal of a cube to/from the set, are closest to Eden model with topological constraints, and, we show, are locally decidable. We prove that in the planar special case the state space is connected. We then define a continuous time Markov chain with a fugacity (tendency to grow) parameter. Using the correspondence between our model on the plane and the self-avoiding polygons, we prove that the Markov chain is irreducible (due to state connectivity), and is also ergodic if the fugacity is smaller than a threshold.

math.PR

Global dynamical structures from infinitesimal data

Scientists and engineers alike target modeling of complex, high dimensional, and nonlinear dynamical systems as a central goal. Machine learning breakthroughs alongside mounting computation and data advance the efficacy of learning from trajectory measurements. However scientifically interpreting data-driven models, e.g., localizing attracting sets and their basins, remains elusive. Such limitations particularly afflict identification of system-level regulatory mechanisms characteristic of living systems, e.g., stabilizing control for whole-body locomotion, where discontinuous, transient, and multiscale phenomena are common and prior models are rare. As a next step towards theory-grounded discovery of behavioral mechanisms in biology and beyond, we introduce VERT, a framework for discovering attracting sets from trajectories without recourse to any global model. Our infinitesimal-local-global (ILG) pipeline estimates the proximity of any sampled state to an attracting set, if one exists, with formal accuracy guarantees. We demonstrate our approach on phenomenological and physical oscillators with hierarchical and impulsive dynamics, finding sensitivity to both global and intermediate attractors composed in sequence and parallel. Application of VERT to human running kinematics data reveals insight into control modules that stabilize task-level dynamics, supporting a longstanding neuromechanical control hypothesis. The VERT framework promotes rigorous inference of underlying dynamical structure even for systems where learning a global dynamics model is impractical or impossible.

q-bio.QM

Minimal Unimodal Decomposition is NP-Hard on Graphs

A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of decomposing a given density function into its minimal unimodal components is fundamental in topological statistics. We show that finding a minimal unimodal decomposition of an edge-linear function on a graph is NP-hard. Given any $k \geq 2$, we establish the NP-hardness of finding a unimodal decomposition consisting of $k$ unimodal functions. We also extend the NP-hardness result to related variants of the problem, including restriction to planar graphs, inapproximability results, and generalizations to higher dimensions.

math.AT

Reparametrization of 3D CSC Dubins Paths Enabling 2D Search

This paper addresses the Dubins path planning problem for vehicles in 3D space. In particular, we consider the problem of computing CSC paths -- paths that consist of a circular arc (C) followed by a straight segment (S) followed by a circular arc (C). These paths are useful for vehicles such as fixed-wing aircraft and underwater submersibles that are subject to lower bounds on turn radius. We present a new parameterization that reduces the 3D CSC planning problem to a search over 2 variables, thus lowering search complexity, while also providing gradients that assist that search. We use these equations with a numerical solver to explore numbers and types of solutions computed for a variety of planar and 3D scenarios. Our method successfully computes CSC paths for the large majority of test cases, indicating that it could be useful for future generation of robust, efficient curvature-constrained trajectories.

cs.RO

Time Series, Persistent Homology and Chirality

We investigate the point process of persistent diagram for Brownian motions with drift, obtaining some of its basic characteristics. Further we introduce and study the refinement of the persistent homology, assigning to each bar its chirality.

math.PR

A large-scale particle system with independent jumps and distributed synchronization

We study a system consisting of $n$ particles, moving forward in jumps on the real line. Each particle can make both independent jumps, whose sizes have some distribution, or ``synchronization'' jumps, which allow it to join a randomly chosen other particle if the latter happens to be ahead of it. System state is the empirical distribution of particle locations. The mean-field asymptotic regime, where $n\to\infty$, is considered. We prove that $v_n$, the steady-state speed of the particle system advance, converges, as $n\to\infty$, to a limit $v_{**}$ which can be easily found from a {\em minimum speed selection principle.} Also, as $n\to\infty$, we prove the convergence of the system dynamics to that of a deterministic mean-field limit (MFL). We show that the average speed of advance of any MFL is lower bounded by $v_{**}$, and the speed of a ``benchmark'' MFL, resulting from all particles initially co-located, is equal to $v_{**}$. In the special case of exponentially distributed independent jump sizes, we prove that a traveling wave MFL with speed $v$ exists if and only if $v\ge v_{**}$, with $v_{**}$ having simple explicit form; we also show the existence of traveling waves for the modified systems, with a left or right boundary moving at a constant speed $v$. Using these traveling wave existence results, we provide bounds on an MFL average speed of advance, depending on the right tail exponent of its initial state. We conjecture that these results for exponential jump sizes generalize to general jump sizes.

math.PR

A Topological Proof of The Gibbard-Satterthwaite Theorem

We give a new proof of the Gibbard-Satterthwaite Theorem. We construct two topological spaces: one for the space of preference profiles and another for the space of outcomes. We show that social choice functions induce continuous mappings between the two spaces. By studying the properties of this mapping, we prove the theorem.

econ.TH

Flux in tilted potential systems: negative resistance and persistence

Many real-world systems are well-modeled by Brownian particles subject to gradient dynamics plus noise arising, e.g., from the thermal fluctuations of a heat bath. Of central importance to many applications in physics and biology (e.g., molecular motors) is the net steady-state particle current or "flux" enabled by the noise and an additional driving force. However, this flux cannot usually be calculated analytically. Motivated by this, we investigate the steady-state flux generated by a nondegenerate diffusion process on a general compact manifold; such fluxes are essentially equivalent to the stochastic intersection numbers of Manabe (1982). In the case that noise is small and the drift is "gradient-like" in an appropriate sense, we derive a graph-theoretic formula for the small-noise asymptotics of the flux using Freidlin-Wentzell theory. When additionally the drift is a local gradient sufficiently close to a generic global gradient, there is a natural flux equivalent to the entropy production rate -- in this case our graph-theoretic formula becomes Morse-theoretic, and the result admits a description in terms of persistent homology. As an application, we provide a mathematically rigorous explanation of the paradoxical "negative resistance" phenomenon in Brownian transport discovered by Cecchi and Magnasco (1996).

math.PR

Asymptotics of multivariate sequences IV: generating functions with poles on a hyperplane arrangement

Let F be the quotient of an analytic function with a product of linear functions. Working in the framework of analytic combinatorics in several variables, we compute asymptotic formulae for the Taylor coefficients of F using multivariate residues and saddle-point approximations. Because the singular set of F is the union of hyperplanes, we are able to make explicit the topological decompositions which arise in the multivariate singularity analysis. In addition to effective and explicit asymptotic results, we provide the first results on transitions between different asymptotic regimes, and provide the first software package to verify and compute asymptotics in non-smooth cases of analytic combinatorics in several variables. It is also our hope that this paper will serve as an entry to the more advanced corners of analytic combinatorics in several variables for combinatorialists.

math.CO

Asymptotics of multivariate sequences in the presence of a lacuna

We explain a discontinuous drop in the exponential growth rate for certain multivariate generating functions at a critical parameter value, in even dimensions d at least 4. This result depends on computations in the homology of the algebraic variety where the generating function has a pole. These computations are similar to, and inspired by, a thread of research in applications of complex algebraic geometry to hyperbolic PDEs, going back to Leray, Petrowski, Atiyah, Bott and Garding. As a consequence, we give a topological explanation for certain asymptotic phenomenon appearing in the combinatorics and number theory literature. Furthermore, we show how to combine topological methods with symbolic algebraic computation to determine explicitly the dominant asymptotics for such multivariate generating functions, giving a significant new tool to attack the so-called connection problem for asymptotics of P-recursive sequences. This in turn enables the rigorous determination of integer coefficients in the Morse-Smale complex, which are difficult to determine using direct geometric methods.

math.CO

Biparametric persistence for smooth filtrations

The goal of this note is to define biparametric persistence diagrams for smooth generic mappings $h=(f,g):M\to V\cong \mathbb{R}^2$ for smooth compact manifold $M$. Existing approaches to multivariate persistence are mostly centered on the workaround of absence of reasonable algebraic theories for quiver representations for lattices of rank 2 or higher, or similar artificial obstacles. We approach the problem from the Whitney theory perspective, similar to how single parameter persistence can be viewed through the lens of Morse theory.

math.AT

On Random Quantum Random Walks

Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we discuss the localizations of such quantum random walks, and establish some strong constraints on the achievable speeds.

math-ph

Stationary points at infinity for analytic combinatorics

On complex algebraic varieties, height functions arising in combinatorial applications fail to be proper. This complicates the description and computation via Morse theory of key topological invariants. Here we establish checkable conditions under which the behavior at infinity may be ignored, and the usual theorems of classical and stratified Morse theory may be applied. This allows for simplified arguments in the field of analytic combinatorics in several variables, and forms the basis for new methods applying to problems beyond the reach of previous techniques.

math.CO

Minimal Unimodal Decompositions on Trees

The decomposition of a density function on a domain into a minimal sum of unimodal components is a fundamental problem in statistics, leading to the topological invariant of unimodal category of a density. This paper gives an efficient algorithm for the construction of a minimal unimodal decomposition of a tame density function on a finite metric tree.

math.AT

Diagonal asymptotics for symmetric rational functions via ACSV

We consider asymptotics of power series coefficients of rational functions of the form $1/Q$ where $Q$ is a symmetric multilinear polynomial. We review a number of such cases from the literature, chiefly concerned either with positivity of coefficients or diagonal asymptotics. We then analyze coefficient asymptotics using ACSV (Analytic Combinatorics in Several Variables) methods. While ACSV sometimes requires considerable overhead and geometric computation, in the case of symmetric multilinear rational functions there are some reductions that streamline the analysis. Our results include diagonal asymptotics across entire classes of functions, for example the general 3-variable case and the Gillis-Reznick-Zeilberger (GRZ) case, where the denominator in terms of elementary symmetric functions is $1 - e_1 + c e_d$ in any number $d$ of variables. The ACSV analysis also explains a discontinuous drop in exponential growth rate for the GRZ class at the parameter value $c = (d-1)^{d-1}$, previously observed for $d=4$ only by separately computing diagonal recurrences for critical and noncritical values of $c$.

math.CO

On the topology of no $k$-equal spaces

We consider the topology of real no $k$-equal spaces via the theory of cellular spanning trees. Our main theorem proves that the rank of the $(k-2)$-dimensional homology of the no $k$-equal subspace of $\mathbb{R}$ is equal to the number of facets in a $k$-dimensional spanning tree of the $k$-skeleton of the $n$-dimensional hypercube.

math.CO