相关论文: Exactly solvable model with two conductor-insulato…
Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the…
Linear electromagnetic wave scattering systems can be characterized by an impedance matrix that relates the voltages and currents at the ports of the system. When the system size becomes greater than the wavelength of the fields involved,…
In this work we exploit the integrability of the two-lead Anderson model to compute transport properties of a quantum dot, in and out of equilibrium. Our method combines the properties of integrable scattering together with a…
Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…
Since the experimental realization of graphene1, extensive theoretical work has focused on short-range disorder2-5, ''ripples''6, 7, or charged impurities2, 3, 8-13 to explain the conductivity as a function of carrier density…
The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…
The jamming transition between flow and amorphous-solid states exhibits paradoxical properties characterized by hyperuniformity (suppressed spatial fluctuations) and criticality (hyperfluctuations), whose origin remains unclear. Here we…
The two-star random graph is the simplest exponential random graph model with nontrivial interactions between the graph edges. We propose a set of auxiliary variables that control the thermodynamic limit where the number of vertices N tends…
We study the conductivity of a 3D disordered metal close to the antiferromagnetic instability within the framework of the spin-fermion model using the diagrammatic technique. We calculate the interaction correction $\delta\sigma(\omega,T)$…
We investigate one aspect of the proximity effect, viz., the local density of states of a superconductor-normal metal sandwich. In contrast to earlier work, we allow for the presence of an arbitrary concentration of impurities in the…
We identify the asymptotic probability of a configuration model $\mathrm{CM}_n(\boldsymbol{d})$ to produce a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well…
The principal ratio of a connected graph $G$, $\gamma(G)$, is the ratio between the largest and smallest coordinates of the principal eigenvector of the adjacency matrix of $G$. Over all connected graphs on $n$ vertices, $\gamma(G)$ ranges…
A road map to understand the relation between the onset of the superconducting state with the particular optimum heterogeneity in granular superconductors is to study a Random Tranverse Ising Model on complex networks with a scale-free…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely…
We compute the two-loop interaction correction to the minimal conductivity of disorder-free intrinsic graphene with the help of dimensional regularization. The calculation is done in two different ways: via density-density and via…
We consider singularly perturbed convection-diffusion equations on one-dimensional networks (metric graphs) as well as the transport problems arising in the vanishing diffusion limit. Suitable coupling condition at inner vertices are…
We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that…
We consider a quantum mechanical particle living on a graph and discuss the behaviour of its wavefunction at graph vertices. In addition to the standard (or delta type) boundary conditions with continuous wavefunctions, we investigate two…
We investigate static and dynamical ground-state properties of the two-impurity Anderson model at half filling in the limit of vanishing impurity separation using the dynamical density-matrix renormalization group method. In the…