相关论文: Asymptotics of the Spectral Gap for the Interchang…

A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\setminus \{r\}$, the paths between $r$ and…

We consider self-adjoint unbounded Jacobi matrices with diagonal q_n=n and weights \lambda_n=c_n n, where c_n is a 2-periodical sequence of real numbers. The parameter space is decomposed into several separate regions, where the spectrum is…

Given a random walk on a free group, we study the random walks it induces on the group's quotients. We show that the spectrum of asymptotic entropies of the induced random walks has no isolated points, except perhaps its maximum.

We prove that the imaginary parts of scattering resonances for negatively curved asymptotically hyperbolic surfaces are uniformly bounded away from zero and provide a resolvent bound in the resulting resonance-free strip. This provides an…

Continuous-time quantum walks on graphs is a generalization of continuous-time Markov chains on discrete structures. Moore and Russell proved that the continuous-time quantum walk on the $n$-cube is instantaneous exactly uniform mixing but…

We describe the spectrum of a non-self-adjoint elliptic system on a finite interval. Under certain conditions we find that the eigenvalues form a discrete set and converge asymptotically at infinity to one of several straight lines. 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…

Let $G$ be a locally compact group and $\mu$ a probability measure on $G,$ which is not assumed to be absolutely continuous with respect to Haar measure. Given a unitary representation $(\pi, \cal H)$ of $G,$ we study spectral properties of…

Consider two quantum graphs with the standard Laplace operator and non-Robin type boundary conditions at all vertices. We show that if their eigenvalue-spectra agree everywhere aside from a sufficiently sparse set, then the…

We extend the Aldous-Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman's random interlacement…

Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…

While true phase transitions are forbidden in one-dimensional systems with short-range interactions, several models have recently been shown to exhibit sharp yet analytic thermodynamic anomalies that mimic thermal phase transitions. We show…

In this paper, we introduce the notion of infinity branches as well as approaching curves. We present some properties which allow us to obtain an algorithm that compares the behavior of two implicitly defined algebraic plane curves at the…

We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…

We study a simple random walk on an n-dimensional hypercube. For any starting position we find the probability of hitting vertex a before hitting vertex b, whenever a and b share the same edge. This generalizes the model in Doyle, P., and…

We consider a recurrent random walk (RW) in random environment (RE) on a strip. We prove that if the RE is i. i. d. and its distribution is not supported by an algebraic subsurface in the space of parameters defining the RE then the RW…

We investigated the spectra of resonances of four-vertex microwave networks simulating both quantum graphs with preserved and with partially violated time-reversal invariance before and after an edge switch operation. We show experimentally…

The difference between the two largest eigenvalues of the adjacency matrix of a graph $G$ is called the spectral gap of $G.$ If $G$ is a regular graph, then its spectral gap is equal to algebraic connectivity. Abdi, Ghorbani and Imrich, in…

Adiabatic quantum computing is a framework for quantum computing that is superficially very different to the standard circuit model. However, it can be shown that the two models are computationally equivalent. The key to the proof is a…

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…