相关论文: A unified framework for limit results in Chemical …

We consider N single server infinite buffer queues with service rate \beta. Customers arrive at rate N\alpha, choose L queues uniformly, and join the shortest. We study the processes R^N for large N, where R^N_t(k) is the fraction of queues…

The production of molecules in a chemical reaction network is modelled as a Poisson process with a Markov-modulated arrival rate and an exponential decay rate. We analyze the distributional properties of $M$, the number of molecules, under…

Model reduction of fast-slow chemical reaction networks based on the quasi-steady state approximation fails when the fast subsystem has first integrals. We call these first integrals approximate conservation laws. In order to define fast…

This paper provides a Central Limit Theorem (CLT) for a process $\{\theta_n, n\geq 0\}$ satisfying a stochastic approximation (SA) equation of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H(\theta_n,X_{n+1})$; a CLT for the associated…

We establish limit theorems involving weak convergence of multiple generations of critical and supercritical branching processes. These results arise naturally when dealing with the joint asymptotic behavior of functionals defined in terms…

Let $(A_n)_{n\in\mathbb{N}}$ be a stationary sequence of topical (i.e., isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n+1,x_0)=A_nx(n,x_0)$. It can model a wide range of systems including…

We study the convergence of a sequence of evolution equations for measures supported on the nodes of a graph. The evolution equations themselves can be interpreted as the forward Kolmogorov equations of Markov jump processes, or…

The general model of coagulation is considered. For basic classes of unbounded coagulation kernels the central limit theorem (CLT) is obtained for the fluctuations around the dynamic law of large numbers (LLN). A rather precise rate of…

We prove a Quantitative Functional Central Limit Theorem for one-hidden-layer neural networks with generic activation function. The rates of convergence that we establish depend heavily on the smoothness of the activation function, and they…

We consider how to generate chemical reaction networks (CRNs) from functional specifications. We propose a two-stage approach that combines synthesis by satisfiability modulo theories and Markov chain Monte Carlo based optimisation. First,…

We obtain functional central limit theorems for both discrete time expressions of the form $1/\sqrt{N}\sum_{n=1}^{[Nt]}(F(X(q_1(n)),\ldots, X(q_{\ell}(n)))-\bar{F})$ and similar expressions in the continuous time where the sum is replaced…

When the underlying random variables are Gaussian, the classical Central Limit Theorem (CLT) is trivial, but the functional CLT is not. The objective of the paper is to investigate the functional CLT for stationary Gaussian processes in the…

This paper develops central limit theorems (CLT's) and large deviations results for additive functionals associated with reflecting diffusions in which the functional may include a term associated with the cumulative amount of boundary…

Let $(X_i)$ be a stationary and ergodic Markov chain with kernel $Q$, $f$ an $L^2$ function on its state space. If $Q$ is a normal operator and $f = (I-Q)^{1/2}g$ (which is equivalent to the convergence of $\sum_{n=1}^\infty…

We address a fundamental problem in chemistry known as chemical reaction product prediction. Our main insight is that the input reactant and reagent molecules can be jointly represented as a graph, and the process of generating product…

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is…

We obtain a functional central limit theorem (CLT) for sums of the form $\xi_N(t)=\frac1{\sqrt N}\sum_{n=1}^{[Nt]}\big(F(X(q_1(n)),...,X(q_\ell(n)))-\bar F\big)$ where $q_1,...,q_\ell$ are polynomials.

We consider stochastic descriptions of chemical reaction networks in which there are both fast and slow reactions, and for which the time scales are widely separated. We develop a computational algorithm that produces the generator of the…

The deleting items theorems of weak law of large numbers (WLLN),strong law of large numbers (SLLN) and central limit theorem (CLT) are derived by substituting partial sum of random variable sequence with deleting items partial sum. We…

Chemical reaction networks (CRNs) formally model chemistry in a well-mixed solution. CRNs are widely used to describe information processing occurring in natural cellular regulatory networks, and with upcoming advances in synthetic biology,…