相关论文: Exactly solvable model with two conductor-insulato…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
For a graph $G$ and for two distinct vertices $u$ and $v$, let $\kappa(u,v)$ be the maximum number of vertex-disjoint paths joining $u$ and $v$ in $G$. The average connectivity matrix of an $n$-vertex connected graph $G$, written…
The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover…
Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…
We study numerically scattering and transport statistical properties of tight-binding random networks characterized by the number of nodes $N$ and the average connectivity $\alpha$. We use a scattering approach to electronic transport and…
Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…
Disordered Fermi-Dirac distributions are used to model, within a straightforward and essentially phenomenological Boltzmann equation approach, the electron/hole transport across graphene puddles. We establish, with striking experimental…
We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
Using Monte Carlo and analytic techniques, we study a minimal dynamic network involving two populations of nodes, characterized by different preferred degrees. Reminiscent of introverts and extroverts in a population, one set of nodes,…
We present a kinetic equation approach to investigate dc transport properties of graphene in the diffusive regime considering long-range electron-impurity scattering. In our study, the effects of interband correlation (or polarization) on…
We study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its…
Tunneling conductance through two quantum dots, which are connected in series to left and right leads, is calculated by using the numerical renormalization group method. As the hopping between the dots increases from very small value, the…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
We consider equilibrium statistical mechanics of a simplified model for the ideal conductor electrode in an interface contact with a classical semi-infinite electrolyte, modeled by the two-dimensional Coulomb gas of pointlike $\pm$ unit…
We consider the field concentration for the transmission problems of the homogeneous and inhomogeneous conductivity equations in the presence of closely located circular inclusions. We revisit these well-studied problems by exploiting the…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…