-
作者：Seidenfeld, T; Schervish, MJ; Kadane, JB
作者单位：Carnegie Mellon University; Carnegie Mellon University
-
作者：Bahadoran, C.; Guiol, H.; Ravishankar, K.; Saada, E.
作者单位：Universite Clermont Auvergne (UCA); State University of New York (SUNY) System; University at Albany, SUNY; SUNY New Paltz; Communaute Universite Grenoble Alpes; Institut National Polytechnique de Grenoble; Universite Grenoble Alpes (UGA); Universite de Rouen Normandie; Centre National de la Recherche Scientifique (CNRS); CNRS - National Institute for Mathematical Sciences (INSMI)
摘要：We consider attractive irreducible conservative particle systems on Z, without necessarily nearest-neighbor jumps or explicit invariant measures. We prove that for such systems, the hydrodynamic limit under Enter time scaling exists and is given by the entropy solution to some scalar conservation law with Lipschitz-continuous flux. Our approach is a generalization of Bahadoran et al. [Stochastic Process. Appl. 99 (2002) 1-30], from which we relax the assumption that the process has explicit in...
-
作者：Mathieu, Pierre
作者单位：Aix-Marseille Universite
摘要：We extend the Carne-Varopoulos upper bound on the probability transitions of a Markov chain to a certain class of nonreversible processes by introducing the definition of a centering measure. In the case of random walks on a group, we study the connections between different notions of centering.
-
作者：Timar, Adam
作者单位：Indiana University System; Indiana University Bloomington
摘要：We show that for a transitive unimodular graph, the number of ends is the same for every tree of the free minimal spanning forest. This answers a question of Lyons, Peres and Schramm.
-
作者：Berestycki, Nathanael
作者单位：University of British Columbia; Universite PSL; Ecole Normale Superieure (ENS)
摘要：Turn the set of permutations of n objects into a graph G, by connecting two permutations that differ by one transposition, and let at be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In Discrete Random Walks (2005) 17-26] showed that the limiting behavior of the distance from the identity at time cn/2 has a phase transition at c = 1. Here we investigate some consequences of this result for the geometry of G, Our first result can be interpreted as a breakdow...
-
作者：Yukich, JE; Zhang, Y
作者单位：Lehigh University; University of Colorado System; University of Colorado at Colorado Springs
摘要：Let 0 < a < b < infinity be fixed scalars. Assign independently to each edge in the lattice Z(2) the value a with probability p or the value b with probability 1 - p. For all u, v is an element of Z(2), let T(u, v) denote the first passage time between u and v. We show that there are points x is an element of R-2 such that the time constant in the direction of x, namely, lim(n ->infinity) n(-1) E-p[T(0, nx)], is not a three times differentiable function of p.
-
作者：Hammond, Alan
作者单位：University of California System; University of California Berkeley
摘要：Assign to each site of the integer lattice Z(d) a real score, sampled according to the same distribution F, independently of the choices made at all other sites. A lattice animal is a finite connected set of sites, with its weight being the sum of the scores at its sites. Let N-n be the maximal weight of those lattice animals of size if that contain the origin. Denote by N the almost sure finite constant limit of n(-1) N-n which exists under a mild condition on the positive tail of F. We study...
-
作者：Timar, Adam
作者单位：Indiana University System; Indiana University Bloomington
摘要：We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance I from one another or, in other words, that such graphs exhibit cluster repulsion. This partially answers a question of Haggstrom, Peres and Schonmann.
-
作者：Timar, Adam
作者单位：Indiana University System; Indiana University Bloomington
摘要：We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite clusters at critical Bernoulli percolation. In the case of heavy clusters, this result has already been established, but it also follows from one of our results. We give a general necessary condition for nonunimodular graphs to have a phase with infinitely many heavy clusters. We present an invariant spanning tree with p(c)...
-
作者：Peligrad, Magda; Utev, Sergey
作者单位：University System of Ohio; University of Cincinnati; University of Nottingham
摘要：We establish the central limit theorem for linear processes with dependent innovations including martingales and mixingale type of assumptions as defined in McLeish [Ann. Probab. 5 (1977) 616-621] and motivated by Gordin [Soviet Math. Dokl. 10 (1969) 1174-1176]. In doing so we shall preserve the generality of the coefficients, including the long range dependence case, and we shall express the variance of partial sums in a form easy to apply. Ergodicity is not required.
