scholarly journals Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models

2003 ◽  
Vol 31 (1) ◽  
pp. 349-408 ◽  
Author(s):  
Takashi Hara ◽  
Remco van der Hofstad ◽  
Gordon Slade
1997 ◽  
Vol 40 (1) ◽  
pp. 19-38 ◽  
Author(s):  
Eric Derbez ◽  
Gordon Slade

AbstractThis article discusses our recent proof that above eight dimensions the scaling limit of sufficiently spread-out lattice trees is the variant of super-Brownian motion calledintegrated super-Brownian excursion(ISE), as conjectured by Aldous. The same is true for nearest-neighbour lattice trees in sufficiently high dimensions. The proof, whose details will appear elsewhere, uses the lace expansion. Here, a related but simpler analysis is applied to show that the scaling limit of a mean-field theory is ISE, in all dimensions. A connection is drawn between ISE and certain generating functions and critical exponents, which may be useful for the study of high-dimensional percolation models at the critical point.


2004 ◽  
Vol 56 (1) ◽  
pp. 77-114 ◽  
Author(s):  
Mark Holmes ◽  
Antal A. Járai ◽  
Akira Sakai ◽  
Gordon Slade

AbstractWe use the lace expansion to analyse networks of mutually-avoiding self-avoiding walks, having the topology of a graph. The networks are defined in terms of spread-out self-avoiding walks that are permitted to take large steps. We study the asymptotic behaviour of networks in the limit of widely separated network branch points, and prove Gaussian behaviour for sufficiently spread-out networks on ℤd in dimensions d > 4.


2011 ◽  
Vol 11 (3) ◽  
pp. 272
Author(s):  
Ivan Gavrilyuk ◽  
Boris Khoromskij ◽  
Eugene Tyrtyshnikov

Abstract In the recent years, multidimensional numerical simulations with tensor-structured data formats have been recognized as the basic concept for breaking the "curse of dimensionality". Modern applications of tensor methods include the challenging high-dimensional problems of material sciences, bio-science, stochastic modeling, signal processing, machine learning, and data mining, financial mathematics, etc. The guiding principle of the tensor methods is an approximation of multivariate functions and operators with some separation of variables to keep the computational process in a low parametric tensor-structured manifold. Tensors structures had been wildly used as models of data and discussed in the contexts of differential geometry, mechanics, algebraic geometry, data analysis etc. before tensor methods recently have penetrated into numerical computations. On the one hand, the existing tensor representation formats remained to be of a limited use in many high-dimensional problems because of lack of sufficiently reliable and fast software. On the other hand, for moderate dimensional problems (e.g. in "ab-initio" quantum chemistry) as well as for selected model problems of very high dimensions, the application of traditional canonical and Tucker formats in combination with the ideas of multilevel methods has led to the new efficient algorithms. The recent progress in tensor numerical methods is achieved with new representation formats now known as "tensor-train representations" and "hierarchical Tucker representations". Note that the formats themselves could have been picked up earlier in the literature on the modeling of quantum systems. Until 2009 they lived in a closed world of those quantum theory publications and never trespassed the territory of numerical analysis. The tremendous progress during the very recent years shows the new tensor tools in various applications and in the development of these tools and study of their approximation and algebraic properties. This special issue treats tensors as a base for efficient numerical algorithms in various modern applications and with special emphases on the new representation formats.


Sign in / Sign up

Export Citation Format

Share Document