Modeling spatial interactions that arise in spatially referenced data is commonly done by incorporating the spatial dependence into the covariance structure either explicitly or implicitly via an autoregressive model. In the case of lattice (regional summary) data, two common autoregressive models used are the conditional autoregressive model (CAR) and the simultaneously autoregressive model (S...

Effective tight-binding models have been introduced to describe vertical electronic excitations in branched conjugated molecules. The excited-state electronic structure is characterized by quantum particles (excitons) that reside on an irregular lattice (graph) that reflects the molecular structure. The methodology allows for the exciton spectra and energy-dependent exciton scattering matrices ...

An approach to the analysis of images of regular texture is proposed in which lattice hypotheses are used to define statistical models. These models are then compared in terms of their ability to explain the image. A method based on this approach is described in which lattice hypotheses are generated using analysis of peaks in the image autocorrelation function, statistical models are based on ...

Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner's dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whos...

We formulate the problem of finding the low-energy limit of spin foam models as a coarse-graining problem in the sense of statistical physics. This suggests that renormalization group methods may be used to find that limit. However, since spin foams are models of spacetime at Planck scale, novel issues arise: these microscopic models are sums over irregular, backgroundindependent lattices. We s...

* This work has been supported by NSF grant MIP-9630096 Abstract In this paper we consider the problem of deadlock-free wormhole unicast routing in networks with irregular topologies. To prevent deadlocks, for each router some input/output pairs (turns) have to be prohibited. We analyze the problem of minimizing the number of prohibited turns for providing deadlock-free routing. A new algorithm...