Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLimit theorems for maximum flows on a lattice
166
0
0.0
(
0
)
Authors
Yu Zhang
Ask ChatGPT about the research
No Arabic abstract
We independently assign a non-negative value, as a capacity for the quantity of flows per unit time, with a distribution F to each edge on the Z^d lattice. We consider the maximum flows through the edges of two disjoint sets, that is from a source to a sink, in a large cube. In this paper, we show that the ratio of the maximum flow and the size of source is asymptotic to a constant. This constant is denoted by the flow constant.
rate research
Read More
We derive herein the limiting laws for certain stationary distributions of birth-and-death processes related to the classical model of chemical adsorption-desorption reactions due to Langmuir. The model has been recently considered in the context of a hybridization reaction on an oligonucleotide DNA microarray. Our results imply that the truncated gamma- and beta- type distributions can be used as approximations to the observed distributions of the fluorescence readings of the oligo-probes on a microarray. These findings might be useful in developing new model-based, probe-specific methods of extracting target concentrations from array fluorescence readings.
In this paper, we propose a new interpretation of local limit theorems for univariate and multivariate distributions on lattices. We show that - given a local limit theorem in the standard sense - the distributions are approximated well by the limit distribution, uniformly on intervals of possibly decaying length. We identify the maximally allowable decay speed of the interval lengths. Further, we show that for continuous distributions, the interval type local law holds without any decay speed restrictions on the interval lengths. We show that various examples fit within this framework, such as standardized sums of i.i.d. random vectors or correlated random vectors induced by multidimensional spin models from statistical mechanics.
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number of extracted balls of a certain color given the past is assumed to be hypergeometric. We prove some central limit theorems in the sense of stable convergence and of almost sure conditional convergence, which are stronger than convergence in distribution. The proven results provide asymptotic confidence intervals for the limit proportion, whose distribution is generally unknown. Moreover, we also consider the case of more urns subjected to some random common factors.
In this paper we consider some non linear Hawkes processes with signed reproduction function (or memory kernel) thus exhibiting both self-excitation and inhibition. We provide a Law of Large Numbers, a Central Limit Theorem and large deviation results, as time growths to infinity. The proofs lie on a renewal structure for these processes introduced in Costa et al. (2020) which leads to a comparison with cumulative processes. Explicit computations are made on some examples. Similar results have been obtained in the literature for self-exciting Hawkes processes only.
We consider a particle undergoing Brownian motion in Euclidean space of any dimension, forced by a Gaussian random velocity field that is white in time and smooth in space. We show that conditional on the velocity field, the quenched density of the particle after a long time can be approximated pointwise by the product of a deterministic Gaussian density and a spacetime-stationary random field $U$. If the velocity field is additionally assumed to be incompressible, then $Uequiv 1$ almost surely and we obtain a local central limit theorem.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
