相关论文: Random matrices, non-colliding processes and queue…

This is the story of the encounter between two worlds: the world of random walks and the world of Variable Length Markov Chains (VLMC). The meeting point turns around the semi-Markov property of underlying processes.

The notion of quantum matrix pairs is defined. These are pairs of matrices with non-commuting entries, which have the same pattern of internal relations, q-commute with each other under matrix multiplication, and are such that products of…

In this article we discuss general strategies and computer algorithms to test the connectivity of unstructured networks which consist of a number of segments connected through randomly distributed nodes.

Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…

We investigate structure for pairs of randomizations that do not follow each other in a chain. These are unrandomized-inclusive, independent, coincident or double randomizations. This involves taking several structures that satisfy…

We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…

The evolution of complex correlated quantum systems such as random circuit networks is governed by the dynamical buildup of both entanglement and entropy. We here introduce a real-time field theory approach -- essentially a fusion of the $G…

Stochastic processes that are randomly reset to an initial condition serve as a showcase to investigate non-equilibrium steady states. However, all existing results have been restricted to the special case of memoryless resetting protocols.…

We introduce the notion of hidden quantum correlations. We present the mean values of observables depending on one classical random variable described by the probability distribution in the form of correlation functions of two (three, etc.)…

I discuss two techniques that can be used in the investigation of the properties of ``colliding" and ``non-colliding" anyons.

I present here some results on the statistical behaviour of large random matrices in an ensemble where the probability distribution is not a function of the eigenvalues only. The perturbative expansion can be cast in a closed form and the…

Moments of secular and inverse secular coefficients, averaged over random matrices from classical groups, are related to the enumeration of non-negative matrices with prescribed row and column sums. Similar random matrix averages are…

We discuss a connection between two areas of mathematics which until recently seemed to be rather distant from each other: (1) noncommutative harmonic analysis on groups and (2) some topics in probability theory related to random point…

We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…

We prove concentration inequalities for several models of non-linear random matrices. As corollaries we obtain estimates for linear spectral statistics of the conjugate kernel of neural networks and non-commutative polynomials in (possibly…

We present a new paradigm for speeding up randomized computations of several frequently used functions in machine learning. In particular, our paradigm can be applied for improving computations of kernels based on random embeddings. Above…

We consider level crossing in a matrix family $H=H_0+\lambda V$ where $H_0$ is a fixed $N\times N$ matrix and $V$ belongs to one of the standard Gaussian random matrix ensembles. We study the probability distribution of level crossing…

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

Collision models describe the sequential interactions of a system with independent ancillas. Motivated by recent advances in neutral atom arrays, in this Letter we investigate a model where the ancillas are governed by a classical…

This paper studies the queue length process in series Jackson networks with external input to the first station. We show that its Markov transition probabilities can be written as a finite sum of non-crossing probabilities, so that…