Related papers: Mobility Edge for the Anderson Model on Random Reg…
The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
We study generic $d$-dimensional rigidity in sparse random graphs. Our main result is that for every $d\ge 2$, the Erd\H{o}s--R\'enyi random graph $G\sim G(n,c/n)$ undergoes a $d$-rigidity phase transition at the known, explicit,…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
Tight-binding model on a finite chain is studied with four-fold alternated hopping parameters $t_{1,2,3,4}$. Imposing the open boundary conditions, the corresponding recursion is solved analytically with special attention paid to the…
We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…
We study overlap of two different eigenfunctions as compared with self-overlap in the framework of an infinite-dimensional version of the disordered tight-binding model. Despite a very sparse structure of the eigenstates in the vicinity of…
We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…
We study localization properties of the eigenstates and wave transport in one-dimensional system consisting of a set of barriers/wells of fixed thickness and random heights. The inherent peculiarity of the system resulting in the enhanced…
We seek the possibility of a disorder driven transition in a tight-binding lattice with a flat band using complexity parameter approach. Our results indicate the existence of a localized to extended states transition with increasing…
In this paper, we study some important statistics of the random graph in the directed preferential attachment model introduced by B. Bollob\'as, C. Borgs, J. Chayes and O. Riordan. First, we find a new asymptotic formula for the expectation…
We consider the multi-particle Anderson model on the lattice with infinite range but sub-exponentially decaying interaction and show the Anderson localization consisting of the spectral exponential and the strong dynamical localization. In…
We present a new large-deviation approach to investigate the critical properties of the Anderson model on the Bethe lattice close to the localization transition in the thermodynamic limit. Our method allows us to study accurately the…
Recent experiments on non-interacting ultra-cold atoms in correlated disorder have yielded conflicting results regarding the so-called mobility edge, i.e. the energy threshold separating Anderson localized from diffusive states. At the same…
Floquet states have been used to describe the impact of periodic driving on lattice systems, either using a tight-binding model, or by using a continuum model where a Kronig-Penney-like description has been used to model spatially periodic…
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…
A lattice model of radiative decay (so-called spin-boson model) of a two level atom and at most two photons is considered. The location of the essential spectrum is described. For any coupling constant the finiteness of the number of…