We describe how to obtain electronic transport properties of disordered graphene, including the tight binding model and nearest neighbor hopping. We present a new method for computing, electronic transport wave function and Greens function of the disordered Graphene. In this method, based on the small rectangular approximation, break up the potential barriers in to small parts. Then using the f...

Ramasubramanian, V. and K.K. Paliwal, An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation, Pattern Recognition Letters 13 (1992) 471-480. An efficient approximation-elimination search algorithm for fast nearest-neighbour search is proposed based on a spherical distance coordinate formuTation, where a vector in K...

The objective of this article is to bridge the gap between two important research directions: (1) nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2) complex network analysis, which deals with large real graphs but is generally studied via graph theoretic analysis or spectral analysis. In this article, we have studied the nearest neighbor search p...

We present a very simple family of traveling salesman instances with n cities where the nearest neighbor rule may produce a tour that is Θ(log n) times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time ...

We apply the Coherent Potential Approximation (CPA) to a simple extended Hubbard model with a nearest and next nearest neighbour hopping for disordered superconductors with s–, d– and p–wave pairing. We show how the Van Hove singularities in the electron density of states enhance the transition temperature Tc for exotic superconductors in a clean and weakly disordered system. The Anderson theor...

Ferromagnetism in the two dimensional t-t ′ Hubbard model at the Van Hove density Abstract Using an improved version of the projection quantum Monte Carlo technique, we study the square-lattice Hubbard model with nearest-neighbor hopping t and next-nearest-neighbor hopping t ′ , by simulation of lattices with up to 20×20 sites. For a given R = 2t ′ /t, we consider that filling which leads to a ...

The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with Sylvester matrix. This paper presents a method based on Structured Total Least Norm(STLN) for constructing the nearest Sylvester matrix of given lower rank. We present algorithms for computing the nearest GCD and a certified 2-GCD for...

The problem of approximating the greatest common divisor(GCD) for multivariate polynomials with inexact coefficients can be formulated as a low rank approximation problem with Sylvester matrix. This paper presents a method based on Structured Total Least Norm(STLN) for constructing the nearest Sylvester matrix of given lower rank. We present algorithms for computing the nearest GCD and a certif...

I show that the cluster variation method, long used as a powerful hierarchy of approximations for discrete (Ising-like) two-dimensional lattice models, yields exact results on the disorder varieties which appear when competitive interactions are put into these models. I consider, as an example, the plaquette approximation of the cluster variation method for the square lattice Ising model with n...

This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensional metric space is not efficient, while search in a high-dimensional Euclidean space suffers from the “curse of dimensionality”. Thus, techniques designed for searching metric spaces must be used. We evaluate several su...