Let (G e ) e>0 be a family of ‘e-thin’ Riemannian manifolds modeled on a finite metric graph G, for example, the e-neighborhood of an embedding of G in some Euclidean space with straight edges. We study the asymptotic behavior of the spectrum of the Laplace-Beltrami operator on G e , as e→0, for various boundary conditions. We obtain complete asymptotic expansions for the kth eigenvalue and the eigenfunctions, uniformly for k≤Ce −1 , in terms of scattering data on a non-compact limit space. We then use this to determine the quantum graph which is to be regarded as the limit object, in a spectral sense, of the family (G e ). Our method is a direct construction of approximate eigenfunctions from the scattering and graph data, and the use of a priori estimates to show that all eigenfunctions are obtained in this way.
As already mentioned, the Neumann problem was treated in @cite_19 , @cite_8 , @cite_0 , KucZen:ASNLTD @cite_3 , @cite_17 . For Dirichlet boundary conditions, Post @cite_14 derived the first two terms of in the case of 'small' vertex neighborhoods, see Theorem . In the recent preprint @cite_5 Molchanov and Vainberg study the Dirichlet problem and show that, in the context of Theorem , the @math converge to eigenvalues of the quantum graph described in Theorem ; this was conjectured in @cite_4 , where also some results on the scattering theory on non-compact graphs are obtained. However, their statements are unclear as to whether the multiplicities coincide; also, they do not consider the effect of @math eigenvalues on @math or uniform asymptotics for large @math . In @cite_13 a related model is considered. The method in the previously cited papers is to compare quadratic forms or to show resolvent convergence of some sort, and in all cases only the leading asymptotic behavior is obtained.
@cite_14 @cite_4 @cite_8 @cite_3 @cite_0 @cite_19 @cite_5 @cite_13 @cite_17
2124939526 2088433356 1884565747 1976418263
Many multiscale methods are based on the idea of extracting macroscopic behavior of solutions by solving an array of microscale models over small domains. A key ingredient in such multiscale methods is the boundary condition and the size of the computational domain over which the microscale problems are solved. This problem is systematically investigated in the present paper in the context of modeling strongly heterogeneous media. Three different boundary conditions are considered: the periodic boundary condition, Dirichlet boundary condition, and the Neumann boundary condition. Each is applied to several benchmark problems: the random checker-board problem, periodic problem with isotropic macroscale behavior, periodic problem with anisotropic macroscale behavior and periodic laminated media. In each case, convergence studies are conducted as the domain size for the microscale problem is changed. Convergence rates as well as the size of fluctuations in the computed effective coefficients are compared for the different formulations. In addition, we will discuss a mixed Dirichlet-Neumann boundary condition that is often used in porous medium modeling. We explain why that leads to unsatisfactory results and how it can be corrected. Also discussed are the different averaging methods used in extracting the effective coefficients. We consider a family of open sets M? which shrinks with respect to an appropriate parameter ? to a graph. Under the additional assumption that the vertex neighbourhoods are small we show that the appropriately shifted Dirichlet spectrum of M? converges to the spectrum of the (differential) Laplacian on the graph with Dirichlet boundary conditions at the vertices, i.e., a graph operator without coupling between different edges. The smallness is expressed by a lower bound on the first eigenvalue of a mixed eigenvalue problem on the vertex neighbourhood. The lower bound is given by the first transversal mode of the edge neighbourhood. We also allow curved edges and show that all bounded eigenvalues converge to the spectrum of a Laplacian acting on the edge with an additional potential coming from the curvature. We consider models given by Hamiltonians of the form View the MathML sourceH(I,f,p,q,t;e)=h(I)+?j=1n±(12pj2+Vj(qj))+eQ(I,f,p,q,t;e) Turn MathJax on where I?I?Rd,f?TdI?I?Rd,f?Td, p,q?Rnp,q?Rn, t?T1t?T1. These are higher dimensional analogues, both in the center and hyperbolic directions, of the models studied in , and and are usually called “a-priori unstable Hamiltonian systems”. All these models present the large gap problem. We show that, for 0<e«10<e«1, under regularity and explicit non-degeneracy conditions on the model, there are orbits whose action variables I perform rather arbitrary excursions in a domain of size O(1)O(1). This domain includes resonance lines and, hence, large gaps among d-dimensional KAM tori. This phenomenon is known as Arnold diffusion. The method of proof follows closely the strategy of and . The main new phenomenon that appears when the dimension d of the center directions is larger than one is the existence of multiple resonances in the space of actions I?I?RdI?I?Rd. We show that, since these multiple resonances happen in sets of codimension greater than one in the space of actions I, they can be contoured. This corresponds to the mechanism called diffusion across resonances in the Physics literature. The present paper, however, differs substantially from and . On the technical details of the proofs, we have taken advantage of the theory of the scattering map developed in [31]—notably the symplectic properties—which were not available when the above papers were written. We have analyzed the conditions imposed on the resonances in more detail. More precisely, we have found that there is a simple condition on the Melnikov potential which allows us to conclude that the resonances are crossed. In particular, this condition does not depend on the resonances. So that the results are new even when applied to the models in and By symmetry, P has eigenvalues 1 = I03 > I381 > ?> I 31xI- 1 2 -1. This paper develops methods for getting upper and lower bounds on 8i3 by comparison with a second reversible chain on the same state space. This extends the ideas introduced in Diaconis and Saloff-Coste (1993), where random walks on finite groups were considered. The bounds involve geometric properties such as the diameter and covering number of an associated graph along the lines of Diaconis and Stroock (1991). The main application gives a sharp upper bound on the second eigenvalue of the symmetric exclusion process. Thus, let S0 be a connected undirected graph with n vertices. For simplicity, we assume in this introduction that SW is regular. To start, r unlabelled particles are placed in an initial configuration, 1 < r < n. At each step, a particle is chosen at random; then one of the neighboring sites of this particle is chosen at random. If the neighboring site is unoccupied, the chosen particle is moved there; if the neighboring site is occupied, the system stays as it was. This is a reversible Markov chain on the r-sets of 1, 2, . . ., n with uniform stationary distribution. Liggett (1985) gives background and motivation (he focuses on infinite systems). Fill (1991) gives bounds on the second eigenvalue of the labeled exclusion process on the finite circle ZZn 1 We study this chain by comparison with a second Markov chain on r-sets that proceeds by picking a particle at random, picking an unoccupied site at random (not necessarily a neighboring site) and moving the particle to the unoccupied site. This is a well studied chain (the Bernoulli-Laplace model for diffusion). Its eigenvalues are known. We show that the comparison techniques apply to give upper bounds on the eigenvalues of the exclusion