相关论文: Rate equation limit for a combinatorial solution o…
This paper establishes asymptotic results for the maximum likelihood and restricted maximum likelihood (REML) estimators of the parameters in the nested error regression model for clustered data when both of the number of independent…
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…
This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the…
A simple reaction-diffusion-advection equation is proposed in a dichotomous tree network to discuss an optimal network. An optimal size ratio r is evaluated by the principle of maximization of total reaction rate. In the case of…
We consider a model applicable in many communication systems where the sum of n stochastic sinusoidal signals of the same frequency, but with random amplitudes as well as phase angles is present. The exact probability distribution of the…
We propose a continuous-time formulation of persistent contrastive divergence (PCD) for maximum likelihood estimation (MLE) of unnormalised densities. Our approach expresses PCD as a coupled, multiscale system of stochastic differential…
Finite mixture models provide a flexible framework for approximating and estimating multivariate probability densities. We study mixtures formed from translated and rescaled copies of a fixed density kernel and obtain explicit results for…
Scalar relativistic corrections to atomization energies of 1st-and 2nd-row molecules can be rationalized in terms of a simple additive model, linear in changes in atomic s populations. In a sample of 200 first-and second-row molecules, such…
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…
This paper is concerned with a chemotaxis aggregation model for cells, more precisely with a parabolic-elliptic semilinear Patlak-Keller-Segel system in a ball of $\mathbb{R}^N$ for $N\geq 2$. For $N=2$, this system is well known for its…
This paper studies proofs of strong convergence of various iterative algorithms for computing the unique zeros of set-valued accretive operators that also satisfy some weak form of uniform accretivity at zero. More precisely, we extract…
The steady-state nucleation rate and flux of composite nucleus at the saddle point is studied by extending the theory of binary nucleation. The Fokker-Planck equation that describes the nucleation flux is derived using the Master equation…
In this paper we present the exact solution for the average minimum energy of the random bipartite matching model with an arbitrary finite number of elements where random paired interactions are described by independent exponential…
Smoluchowski's equation is a macroscopic description of a many particle system with coagulation and shattering interactions. We give a microscopic model of the system from which we derive this equation rigorously. Provided the existence of…
We study the popular distributed consensus method over networks composed of a number of densely connected clusters with a sparse connection between them. In these cluster networks, the method often constitutes two-time-scale dynamics, where…
We consider a $N$-particle interacting particle system with the vision geometrical constraints and reflected noises, proposed as a model for collective behavior of individuals. We rigorously derive a continuity-type of mean-field equation…
Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process…
Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues or subject to non-independent traffic inputs is…
In this paper, we consider the Markov-Chain Monte Carlo (MCMC) approach for random sampling of combinatorial objects. The running time of such an algorithm depends on the total mixing time of the underlying Markov chain and is unknown in…
We consider two simple models for the formation of polymers where at the initial time, each monomer has a certain number of potential links (called arms in the text) that are consumed when aggregations occur. Loosely speaking, this imposes…