Related papers: Spectral gap for the signed interchange process wi…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…
Many semiconductors present weak or forbidden transitions at their fundamental band gaps, inducing a widened region of transparency. This occurs in high-performing n-type transparent conductors (TCs) such as Sn-doped In2O3 (ITO), however…
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as…
In this brief paper we present some results on creating and manipulating spectral gaps for a (regular) quantum graph by inserting appropriate internal structures into its vertices. Complete proofs and extensions of the results are planned…
Leap generators have been introduced in [Duchon et al.'04] for exact-size random generation of structures in a class of the form $\mathcal{C}=\mathrm{Seq}(\mathcal{B})$ (sequence construction), in the supercritical case. We extend these…
Stable commutator length scl_G(g) of an element g in a group G is an invariant for group elements sensitive to the geometry and dynamics of G. For any group G acting on a tree, we prove a sharp bound scl_G(g)>=1/2 for any g acting without…
We compute the spectrum for a class of quantum Markov semigroups describing systems of $N$ particle interacting through a binary collision mechanism. These quantum Markov semgroups are associated to a novel kind of quantum random walk on…
The evolution of a complex multi-state system is often interpreted as a continuous-time Markovian process. To model the relaxation dynamics of such systems, we introduce an ensemble of random sparse matrices which can be used as generators…
We consider a random walk on a $d$-regular graph $G$ where $d\to\infty$ and $G$ satisfies certain conditions. Our prime example is the $d$-dimensional hypercube, which has $n=2^d$ vertices. We explore the likely component structure of the…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
Let the group $G$ act transitively on the finite set $\Omega$, and let $S \subseteq G$ be closed under taking inverses. The Schreier graph $Sch(G \circlearrowleft \Omega,S)$ is the graph with vertex set $\Omega$ and edge set $\{…
We consider a simple model of partially expanding map on the torus. We study the spectrum of the Ruelle transfer operator and show that in the limit of high frequencies in the neutral direction (this is a semiclassical limit), the spectrum…
Quantum trajectories are Markov processes modeling the evolution of a quantum system subjected to repeated independent measurements. Inspired by the theory of random products of matrices, it has been shown that these Markov processes admit…
This article investigates spectral redundancy, a concept initially introduced by Alberto Seeger. Spectral redundancy arises when different connected induced subgraphs of a graph share the same spectral radius in their adjacency spectrum.…
We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
This paper explores the mixing time of the random transposition walk on permutations with one-sided interval restrictions. In particular, we're interested in the notion of cutoff, a phenomenon which occurs when mixing occurs in a window of…
In the field of signal processing, phase transition phenomena have recently attracted great attention. Donoho's work established the signal recovery threshold using indicators such as restricted isotropy (RIP) and incoherence and proved…