3-4期

最新文章

• Critical behavior and the limit distribution for long-range oriented percolation. II: Spatial correlation AI翻译
  作者：Chen, Lung-Chi; Sakai, Akira
  作者单位：Hokkaido University; Fu Jen Catholic University
  摘要：We prove that the Fourier transform of the properly scaled normalized two-point function for sufficiently spread-out long-range oriented percolation with index alpha > 0 converges to e(-C)vertical bar k vertical bar(alpha boolean AND 2) for some C is an element of (0, infinity) above the upper- critical dimension d(c) equivalent to 2(alpha boolean AND 2). This answers the open question remained in the previous paper (Chen and Sakai in Probab Theory Relat Fields 142:151-188, 2008). Moreover, we...
• Transportation-information inequalities for Markov processes AI翻译
  作者：Guillin, Arnaud; Leonard, Christian; Wu, Liming; Yao, Nian
  作者单位：Aix-Marseille Universite; Universite Paris Saclay; Centre National de la Recherche Scientifique (CNRS); CNRS - National Institute for Mathematical Sciences (INSMI); Universite Clermont Auvergne (UCA); Wuhan University
  摘要：chi chi chi In this paper, one investigates the transportation-information TcI inequalities: alpha(T-c(nu, mu)) <= I(nu vertical bar mu) for all probability measures nu on a metric space (X, d), where mu is a given probability measure, T-c(nu, mu) is the transportation cost from nu to mu with respect to the cost function c(x, y) on X-2, I(nu vertical bar mu) is the Fisher-Donsker-Varadhan information of nu with respect to mu and alpha : [0, infinity) -> [0, infinity] is a left continuous incre...
• Maximal regularity for stochastic convolutions driven by L,vy processes AI翻译
  作者：Brzezniak, Zdzislaw; Hausenblas, Erika
  作者单位：University of York - UK; Salzburg University
  摘要：We generalize the maximal regularity result from Da Prato and Lunardi (Atti Accad Naz Lincei Cl Sci Fis Mat Natur Rend Lincei (9) Mat Appl 9(1):25-29, 1998) to stochastic convolutions driven by time homogenous Poisson random measures and cylindrical infinite dimensional Wiener processes.
• Branching-coalescing particle systems (vol 131, pg 376, 2005) AI翻译
  作者：Athreya, Siva R.; Swart, Jan M.
  作者单位：Czech Academy of Sciences; Institute of Information Theory & Automation of the Czech Academy of Sciences; Indian Statistical Institute; Indian Statistical Institute Bangalore
• Invariant random graphs with iid degrees in a general geography AI翻译
  作者：Jonasson, Johan
  作者单位：Chalmers University of Technology; University of Gothenburg
  摘要：Let D be a non-negative integer-valued random variable and let G = (V, E) be an infinite transitive finite-degree graph. Continuing the work of Deijfen and Meester (Adv Appl Probab 38:287-298) and Deijfen and Jonasson (Electron Comm Probab 11: 336-346), we seek an Aut(G)-invariant random graph model with V as vertex set, iid degrees distributed as D and finite mean connections (i.e., the sum of the edge lengths in the graph metric of G of a given vertex has finite expectation). It is shown tha...
• The compound Poisson distribution and return times in dynamical systems AI翻译
  作者：Haydn, Nicolai; Vaienti, Sandro
  作者单位：University of Southern California; Centre National de la Recherche Scientifique (CNRS); Aix-Marseille Universite; Aix-Marseille Universite; Aix-Marseille Universite; Universite de Toulon
  摘要：Previously it has been shown that some classes of mixing dynamical systems have limiting return times distributions that are almost everywhere Poissonian. Here we study the behaviour of return times at periodic points and show that the limiting distribution is a compound Poissonian distribution. We also derive error terms for the convergence to the limiting distribution. We also prove a very general theorem that can be used to establish compound Poisson distributions in many other settings.
• The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus AI翻译
  作者：Schweinsberg, Jason
  作者单位：University of California System; University of California San Diego
  摘要：Let x and y be points chosen uniformly at random from Z(n)(4), the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n(2)(log n)(1/6), resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on Z(n)(4) is the Brownian continuum random tree of Aldous. Our proofs use the techniques developed by Peres and Revelle, who studied the scaling limits of the uniform sp...
• Exit problems associated with affine reflection groups AI翻译
  作者：Doumerc, Yan; Moriarty, John
  作者单位：University of Manchester
  摘要：We obtain a formula for the distribution of the first exit time of Brownian motion from the alcove of an affine Weyl group. In most cases the formula is expressed compactly, in terms of Pfaffians. Expected exit times are derived in the type (A) over tilde case. The results extend to other Markov processes. We also give formulas for the real eigenfunctions of the Dirichlet and Neumann Laplacians on alcoves, observing that the 'Hot Spots' conjecture of J. Rauch is true for alcoves.
• Aggregation via empirical risk minimization AI翻译
  作者：Lecue, Guillaume; Mendelson, Shahar
  作者单位：Australian National University; Technion Israel Institute of Technology
  摘要：Given a finite set F of estimators, the problem of aggregation is to construct a new estimator whose risk is as close as possible to the risk of the best estimator in F. It was conjectured that empirical minimization performed in the convex hull of F is an optimal aggregation method, but we show that this conjecture is false. Despite that, we prove that empirical minimization in the convex hull of a well chosen, empirically determined subset of F is an optimal aggregation method.