Searcharxiv⌕ Search

arXiv subjects

Jianhong Xu

Publications and source records attributed to Jianhong Xu.

8 recordsLinked to original sources

A Graph Theory Assisted Method for Determining Limiting Probability Distributions of Higher Order Markov Chains

This paper presents a graph theory assisted method that checks a sufficient condition for the existence of the limiting probability distribution of a higher order Markov chain and identifies this distribution when the condition is satisfied. This method is more effective as compared to the direct verification of the condition since the latter hinges wholly on computations of the full spectrum on a large-size transition matrix. Even though the graph theoretic tools employed here are well known, their utilization in the context of a higher order Markov chain is new. This method is also implemented as an easy-to-use MATLAB function {\tt gtam}. Several illustrative examples are provided too.

math.PR↗

Vibe synthesis: hierarchical agentic decision-making for intent-driven multistep molecule synthesis

The ability to construct complex molecules underpins advances in medicine and the molecular sciences. Yet long-horizon multistep synthesis requires decisions to be revised as evidence accumulates across chemically dependent operations, a capability not readily supported by artificial-intelligence tools and automated platforms organized around predefined tasks and hard-coded workflows. Here we propose and demonstrate a vibe synthesis system (VibeSyn), an intent-driven architecture in which hierarchical agents translate chemist-defined molecular objectives and accumulating evidence into adaptive decisions executed through computational tools and laboratory automation. We evaluate VibeSyn in three demonstrations of increasing scope and autonomy, progressing from evidence-grounded experimental decisions to adaptive execution of a ten-step total synthesis of catharanthine and structure-to-compound synthesis of cyclic peptides containing unnatural amino acids (uAAs). Across the long-horizon campaigns, active human input and simple confirmation account for less than 7.5% and 5.2%, respectively, of recorded workflow actions and outcomes. VibeSyn points towards a future in which chemists define synthetic intent and agent-directed laboratories autonomously navigate the evolving experimental trajectory required to deliver the target compound.

physics.chem-ph↗

An Alternative Framework for Irreducibility and Primitivity of Nonnegative Tensors

Motivated by some recent studies on higher order Markov chains and well-known characterizations for irreducibility and primitivity of nonnegative matrices, we propose in this paper an alternative framework for irreducibility and primitivity of nonnegative tensors, giving rise to two new notions: s-irreducibility and s-primitivity. Our framework includes the relevant results on nonnegative matrices as its special cases, yet it expands existing results regarding irreducibility and primitivity of nonnegative tensors. In addition to its tensor theoretic significance, such a framework has important implications for applied problems such as higher order Markov chains.

math.RA↗

Mean First Passage Times and Fundamental Tensors of Higher Order Markov Chains

The mean first passage times are among the most critical characteristics of a Markov chain. In this paper, we focus on the scenario in which one or more states of a higher order ergodic Markov chain are modified to be absorbing. We prove that the resulting chain has to be absorbing. For a higher order absorbing Markov chain, we prove that the equation its fundamental tensor satisfies must be nonsingular and provide a MATLAB function {\tt fund} for solving the equation. Besides, we connect each horizontal slice of the mean first passage time tensor with a fundamental tensor obtained when one state of a higher order ergodic Markov chain is modified to be absorbing, which also leads to a tensor series representation for selected mean first passage times.

math.PR↗

Can a Higher Order Markov Chain Be Treated as a First Order Markov Chain?

It is well known that any higher order Markov chain can be associated with a first order Markov chain. In this primarily expository article, we present the first fairly comprehensive analysis of the relationship between higher order and first order Markov chains, together with illustrative examples. Our main objective is to address the central question as posed in the title.

math.PR↗

HOMC: A MATLAB Package for Higher Order Markov Chains

We present a MATLAB package, which is the first of its kind, for Higher Order Markov Chains (HOMC). It can be used to easily compute all important quantities in our recent works relevant to higher order Markov chains, such as the $k$-step transition tensor, limiting probability distribution, ever-reaching probability tensor, and mean first passage time tensor. It can also be used to check whether a higher order chain is ergodic or regular, to construct the transition matrix of the associated reduced first order chain, and to determine whether a state is recurrent or transient. A key function in the package is an implementation of the tensor ``box'' product which has a probabilistic interpretation and is different from other tensor products in the literature. This HOMC package is useful to researchers and practitioners alike for tasks such as numerical experimentation and algorithm prototyping involving higher order Markov chains.

stat.CO↗

On Limiting Probability Distributions of Higher Order Markov Chains

The limiting probability distribution is one of the key characteristics of a Markov chain since it shows its long-term behavior. In this paper, for a higher order Markov chain, we establish some properties related to its exact limiting probability distribution, including a sufficient condition for the existence of such a distribution. Our results extend the corresponding conclusions on first order chains. Besides, they complement the existing results concerning higher order chains which rely on approximation schemes or two-phase power iterations. Several illustrative example are also given.

math.PR↗

On the Convergence of the Accelerated Riccati Iteration Method

In this paper, we establish results fully addressing two open problems proposed recently by I. Ivanov, see Nonlinear Analysis 69 (2008) 4012--4024, with respect to the convergence of the accelerated Riccati iteration method for solving the continuous coupled algebraic Riccati equation, or CCARE for short. These results confirm several desirable features of that method, including the monotonicity and boundedness of the sequences it produces, its capability of determining whether the CCARE has a solution, the extremal solutions it computes under certain circumstances, and its faster convergence than the regular Riccati iteration method.

math.OC↗