Related papers: Resistance Calculation for an infinite Simple Cubi…
This is the second of two papers on the end-to-end distance of a weakly self-repelling walk on a four dimensional hierarchical lattice. It completes the proof that the expected value grows as a constant times \sqrt{T} log^{1/8}T (1+O((log…
We consider the problem of two-point resistance in a resistor network previously studied by one of us [F. Y. Wu, J. Phys. A {\bf 37}, 6653 (2004)]. By formulating the problem differently, we obtain a new expression for the two-point…
Quark number susceptibility on the lattice, obtained by merely adding a $\mu N$ term with $\mu$ as the chemical potential and $N$ as the conserved quark number, has a quadratic divergence in the cut-off $a$. We show that such a divergence…
The linear response theory is used to describe magnetoresistance oscillations of short-period unilateral superlattices with strong modulation (or alternatively arrays of coupled quantum wires). The semiclassical description of this system…
We measure the conductivity of neutral fermions in a cubic optical lattice. Using in-situ fluorescence microscopy, we observe the alternating current resultant from a single-frequency uniform force applied by displacement of a weak harmonic…
The operation of replacing every vertex of an $r$-regular lattice $H$ by a complete graph of order $r$ is called clique-inserting, and the resulting lattice is called the clique-inserted-lattice of $H$. For any given $r$-regular lattice,…
Simplifications of a result from a prior paper concerning the electric resistance between points in a distance-regular graph are given. In particular, we prove that the maximal resistance between points is bounded by twice the resistance…
We completely characterize when the free effective resistance of an infinite graph can be expressed in terms of simple hitting probabilities of the graphs random walk.
We examine the formation of localized states on a generalized nonlinear impurity located at, or near the surface of a semi-infinite 2D square lattice. Using the formalism of lattice Green functions, we obtain in closed form the number of…
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…
Given any full rank lattice and a natural number N , we regard the point set given by the scaled lattice intersected with the unit square under the Lambert map to the unit sphere, and show that its spherical cap discrepancy is at most of…
We present a method for accurate evaluation of the Green function $G(\omega,r_1,...,r_d)$ at any real frequency $\omega$ and any lattice vector $(r_1,...,r_d)$ for a $d$-dimensional hypercubic lattice that may have anisotropic couplings…
The \emph{resistance matrix} of a simple connected graph $G$ is denoted by $R$, and is defined by $R =(r_{ij})$, where $r_{ij}$ is the resistance distance between the vertices $i$ and $j$ of $G$. In this paper, we consider the resistance…
The concept of impedance, which characterises the current response to a periodical driving, is introduced in the context of stochastic transport. In particular, we calculate the impedance for an exactly solvable model, namely the stochastic…
Although the intrinsic conductance of an interacting one-dimensional system is renormalized by the electron-electron correlations, it has been known for some time that this renormalization is washed out by the presence of the…
This paper provides estimates on the difference between the number of integer lattice points an a circle centered at the origin and the area. The estimates have the form "Big O" of the product of logarithm of the radius and the radius…
We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective…
Simple cubic lattice (SC lattice) can be viewed as plane triangular lattice (PT lattice) by viewing it along its principle diagonal lines. By viewing thus we establish the exact one-to-one correspondence between the closed graphs on SC…
We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…
A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as resistors of possibly varying strengths. The relationship between the natural Dirichlet form $\mathcal E$…