相关论文: Exactly solvable model with two conductor-insulato…

We consider the problem of the superconductor-insulator transition in the presence of disorder, assuming that the fermionic degrees of freedom can be ignored so that the problem reduces to one of Cooper pair localization. Weak disorder…

In this note we define and study graph invariants generalizing to higher dimension the maximum degree of a vertex and the vertex-connectivity (our $0$-dimensional cases). These are known to coincide almost surely in any regime for…

Although the spectral properties of random graphs have been a long-standing focus of network theory, the properties of right eigenvectors of directed graphs have so far eluded an exact analytic treatment. We present a general theory for the…

Random hyperbolic graphs have been suggested as a promising model of social networks. A few of their fundamental parameters have been studied. However, none of them concerns their spectra. We consider the random hyperbolic graph model as…

We analyze behavior of correlated electrons described by Hubbard-like models at intermediate and strong coupling. We show that with increasing interaction a pole in a generic two-particle Green function is approached. The pole signals…

We show that the magnetic susceptibility of a dilute ensemble of magnetic impurities in a conductor with a relativistic electronic spectrum is non-analytic in the inverse tempertature at $1/T\to 0$. We derive a general theory of this effect…

We study the transport properties of a neutral graphene sheet with curved regions induced or stabilized by topological defects. The proposed model gives rise to Dirac fermions in a random magnetic field and in the random space dependent…

A graph is non-trivial if it contains at least one nonloop edge. The essential connectivity of $G$, denoted by $\kappa'(G)$, is the minimum number of vertices of $G$ whose removal produces a disconnected graph with at least two components…

The conditional diagnosability and the 2-extra connectivity are two important parameters to measure ability of diagnosing faulty processors and fault-tolerance in a multiprocessor system. The conditional diagnosability $t_c(G)$ of $G$ is…

The Chalker-Coddington network model (introduced originally as a model for percolation in the quantum Hall effect) is known to map onto the two-dimensional Dirac equation. Here we show how the network model can be used to solve a scattering…

An exact relation between the conductance maximum $G_0$ at zero temperature and a ratio of lead densities is derived within the framework of the single impurity Anderson model: $G_0={\mathfrak R}[n] \frac{2e^2}{h}$, where ${\mathfrak…

We investigate the optical conductivity of a Hubbard ring in presence of an impurity by means of exact diagonalization using the Lanczos algorithm. We concentrate thereby on the first excited, open shell state, i.e. on twisted boundary…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

We investigate the charge transport properties of planar amorphous graphene that is fully topologically disordered, in the form of sp2 three-fold coordinated networks consisting of hexagonal rings, but also including many pentagons and…

This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission…

We study the inverse problem of determining the conductivity matrix of an electrical network from the prescribed knowledge of the magnitude of the induced current along the edges coupled with the imposed voltage or injected current on the…

A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…

The generalized connectivity of a graph $G$ was introduced by Chartrand et al. Let $S$ be a nonempty set of vertices of $G$, and $\kappa(S)$ be defined as the largest number of internally disjoint trees $T_1, T_2, \cdots, T_k$ connecting…

We analyze a random resistor-inductor-capacitor $(RLC)$ lattice model of 2-dimensional metal-insulator composites. The results are compared with Bruggeman's and Landauer's Effective Medium Approximations where a discrepancy was observed for…

Conductance of zigzag interfaces between graphene sheet and normal metal is investigated in the tight-binding approximation. Boundary conditions, valid for a variety of scattering problems, are constructed and applied to the normal metal --…