3D gravity with propagating torsion: Hamiltonian structure of the scalar sector

We study the Hamiltonian structure of the general parity-invariant model of three-dimensional gravity with propagating torsion, with eight parameters in the Lagrangian. In the scalar sector, containing scalar or pseudoscalar modes with respect to maximally symmetric background, the phenomenon of constraint bifurcation is observed and analyzed. The stability of the Hamiltonian structure under linearization is used to identify dynamically acceptable values of parameters.Comment: LaTeX, 26 page

Scattering theory on graphs

We consider the scattering theory for the Schr\"odinger operator -\Dc_x^2+V(x) on graphs made of one-dimensional wires connected to external leads. We derive two expressions for the scattering matrix on arbitrary graphs. One involves matrices that couple arcs (oriented bonds), the other involves matrices that couple vertices. We discuss a simple way to tune the coupling between the graph and the leads. The efficiency of the formalism is demonstrated on a few known examples.Comment: 21 pages, LaTeX, 10 eps figure

Superconducting gap structure of the 115's revisited

Density functional theory calculations of the electronic structure of Ce- and Pu-based heavy fermion superconductors in the so-called 115 family are performed. The gap equation is used to consider which superconducting order parameters are most favorable assuming a pairing interaction that is peaked at (\pi,\pi,q_z) - the wavevector for the antiferromagnetic ordering found in close proximity. In addition to the commonly accepted $d_{x^2-y^2}$ order parameter, there is evidence that an extended s-wave order parameter with nodes is also plausible. We discuss whether these results are consistent with current observations and possible measurements that could help distinguish between these scenarios.Comment: 8 pages, 4 figures; Accepted for publication in JPC

Quantum Graphs II: Some spectral properties of quantum and combinatorial graphs

The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and other areas. A Schnol type theorem is proven that allows one to detect that a point belongs to the spectrum when a generalized eigenfunction with an subexponential growth integral estimate is available. A theorem on spectral gap opening for ``decorated'' quantum graphs is established (its analog is known for the combinatorial case). It is also shown that if a periodic combinatorial or quantum graph has a point spectrum, it is generated by compactly supported eigenfunctions (``scars'').Comment: 4 eps figures, LATEX file, 21 pages Revised form: a cut-and-paste blooper fixe

Random Walks Along the Streets and Canals in Compact Cities: Spectral analysis, Dynamical Modularity, Information, and Statistical Mechanics

Different models of random walks on the dual graphs of compact urban structures are considered. Analysis of access times between streets helps to detect the city modularity. The statistical mechanics approach to the ensembles of lazy random walkers is developed. The complexity of city modularity can be measured by an information-like parameter which plays the role of an individual fingerprint of {\it Genius loci}. Global structural properties of a city can be characterized by the thermodynamical parameters calculated in the random walks problem.Comment: 44 pages, 22 figures, 2 table

Neighborhood properties of complex networks

A concept of neighborhood in complex networks is addressed based on the criterion of the minimal number os steps to reach other vertices. This amounts to, starting from a given network $R_1$, generating a family of networks $R_\ell, \ell=2,3,...$ such that, the vertices that are $\ell$ steps apart in the original $R_1$, are only 1 step apart in $R_\ell$. The higher order networks are generated using Boolean operations among the adjacency matrices $M_\ell$ that represent $R_\ell$. The families originated by the well known linear and the Erd\"os-Renyi networks are found to be invariant, in the sense that the spectra of $M_\ell$ are the same, up to finite size effects. A further family originated from small world network is identified

Spanning Trees on Graphs and Lattices in d Dimensions

The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A general formulation is presented for the enumeration of spanning trees on lattices in $d\geq 2$ dimensions, and is applied to the hypercubic, body-centered cubic, face-centered cubic, and specific planar lattices including the kagom\'e, diced, 4-8-8 (bathroom-tile), Union Jack, and 3-12-12 lattices. This leads to closed-form expressions for $N_{ST}$ for these lattices of finite sizes. We prove a theorem concerning the classes of graphs and lattices ${\cal L}$ with the property that $N_{ST} \sim \exp(nz_{\cal L})$ as the number of vertices $n \to \infty$, where $z_{\cal L}$ is a finite nonzero constant. This includes the bulk limit of lattices in any spatial dimension, and also sections of lattices whose lengths in some dimensions go to infinity while others are finite. We evaluate $z_{\cal L}$ exactly for the lattices we considered, and discuss the dependence of $z_{\cal L}$ on d and the lattice coordination number. We also establish a relation connecting $z_{\cal L}$ to the free energy of the critical Ising model for planar lattices ${\cal L}$.Comment: 28 pages, latex, 1 postscript figure, J. Phys. A, in pres