Related papers: Exactly solvable model with two conductor-insulato…
A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine…
The eccentric-connectivity index of a graph G is the sum of the products of the eccentricity and the degree of each vertex in G. In this paper, we define four new invariants related to the eccentric-connectivity index and obtain upper…
Carrier transport in gated 2D graphene monolayers is theoretically considered in the presence of scattering by random charged impurity centers with density $n_i$. Excellent quantitative agreement is obtained (for carrier density $n >…
We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random…
The conductivity of graphene samples with various levels of disorder is investigated for a set of specimens with mobility in the range of $1-20\times10^3$ cm$^2$/V sec. Comparing the experimental data with the theoretical transport…
We investigate the concept of effective resistance in connection graphs, expanding its traditional application from undirected graphs. We propose a robust definition of effective resistance in connection graphs by focusing on the duality of…
Nonperturbative, in inverse Thouless conductance 1/g, corrections to distributions of level velocities and level curvatures in quasi-one-dimensional disordered conductors with a topology of a ring subject to a constant vector potential are…
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting…
The discovery of the metal-insulator transition (MIT) in two-dimensional (2D) electron systems challenged the veracity of one of the most influential conjectures in the physics of disordered electrons, which states that `in two dimensions,…
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a…
Based on the recently developed picture of an electronic ideal relativistic fluid at the Dirac point, we present an analytical model for the conductivity in graphene that is able to describe the linear dependence on the carrier density and…
We investigate the conductance of normal-conductor/graphene/normal-conductor (NGN) junctions for arbitrary on-site potentials in the normal and graphitic parts of the system. We find that a ballistic NGN junction can display insulating…
Disordered mechanical systems with high connectivity represent a limit opposite to the more familiar case of disordered crystals. Individual ions in a crystal are subjected essentially to nearest-neighbor interactions. In contrast, the…
Conductivity of a disorder-free intrinsic graphene is studied to the first order in the long-range Coulomb interaction and is found to be \sigma=\sigma_0(1+0.01 g), where 'g' is the dimensionless ("fine structure") coupling constant. The…
Charge transport in the diffusive normal metal (DN) / insulator / $s$- and $% d $-wave superconductor junctions is studied in the presence of magnetic impurities in DN in the framework of the quasiclassical Usadel equations with the…
We argue that the unscreened Coulomb interaction in graphene provides a positive, universal, and logarithmic correction to scaling of zero-temperature conductivity with frequency. The combined effect of the disorder due to wrinkling of the…
In this paper we derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the uniform multicommodity flow problem under random walk routing. We show the mean load is linearly dependent on the nodal…
The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…
We study the connectivity of random subgraphs of the $d$-dimensional Hamming graph $H(d, n)$, which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the random subgraph with an i.i.d.\ Bernoulli bond percolation on…
Using the theory of diffusion in graphs, we propose a model to study mesoscopic transport through a diffusive quantum dot. The graph consists of three quasi-1D regions: a central region describing the dot, and two identical left- and right-…