English
Related papers

Related papers: Products of random matrices and queueing system pe…

200 papers

In this paper we develop a method to compute the solution to a countable (finite or infinite) set of equations that occurs in many different fields including Markov processes that model queueing systems, birth-and-death processes and…

Optimization and Control · Mathematics 2015-10-21 Michael N. Katehakis , Laurens C. Smit , Floske M. Spieksma

The theory of products of random matrices and Lyapunov exponents have been widely studied and applied in the fields of biology, dynamical systems, economics, engineering and statistical physics. We consider the product of an i.i.d. sequence…

Probability · Mathematics 2024-06-18 Audrey Benson , Hunter Gould , Phanuel Mariano , Grace Newcombe , Joshua Vaidman

The theory of ``Markov-up'' processes is being developed. This is a new class of stochastic processes with ``partial'' markovian features; it could also be called ``one-sided Markov''. Such a behavior may be found in the real world and in…

Probability · Mathematics 2024-07-01 D. O. Kalikaeva

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela

A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…

Mathematical Physics · Physics 2010-06-04 Rudolf A Roemer , Hermann Schulz-Baldes

For fixed $m > 1$, we study the product of $m$ independent $N \times N$ elliptic random matrices as $N$ tends to infinity. Our main result shows that the empirical spectral distribution of the product converges, with probability $1$, to the…

Probability · Mathematics 2015-06-26 Sean O'Rourke , David Renfrew , Alexander Soshnikov , Van Vu

In this article, we study the convergence behaviour of the classical generalized Max Product exponential sampling series in the weighted space of log-uniformly continuous and bounded functions. We derive basic convergence results for both…

Functional Analysis · Mathematics 2024-09-25 Satyaranjan Pradhan , Madan Mohan Soren

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Probability · Mathematics 2007-05-23 Glenn Merlet

We survey and discuss upper bounds on the length of the transient phase of max-plus linear systems and sequences of max-plus matrix powers. In particular, we explain how to extend a result by Nachtigall to yield a new approach for proving…

Combinatorics · Mathematics 2014-05-15 Thomas Nowak , Bernadette Charron-Bost

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…

Mesoscale and Nanoscale Physics · Physics 2024-11-01 Alexander Altland , Joaquim Telles de Miranda , Tobias Micklitz

Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…

Probability · Mathematics 2023-02-02 Mario Kieburg

We review the framework of Refined Algebraic Quantization and the method of Group Averaging for quantizing systems with first-class constraints. Aspects and results concerning the generality, limitations, and uniqueness of these methods are…

General Relativity and Quantum Cosmology · Physics 2009-10-31 Domenico Giulini

Supermarket models with different servers become a key in modeling resource management of stochastic networks, such as, computer networks, manufacturing systems and transportation networks. While these different servers always make analysis…

Performance · Computer Science 2016-04-06 Quan-Lin Li , Feifei Yang , Na Li

This paper considers the cycle maximum in birth-death processes as a stepping stone to characterisation of the cycle maximum in single queues and open Kelly-Whittle networks of queues. For positive recurrent birth-death processes we show…

Probability · Mathematics 2022-06-01 Richard J. Boucherie

Parametric Markov chains occur quite naturally in various applications: they can be used for a conservative analysis of probabilistic systems (no matter how the parameter is chosen, the system works to specification); they can be used to…

Logic in Computer Science · Computer Science 2018-11-05 Paul Gainer , Ernst Moritz Hahn , Sven Schewe

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

Classical Analysis and ODEs · Mathematics 2009-12-30 Chun-Yen Shen

This report considers a fairly general model of constrained queuing networks that allows us to represent both MMBP (Markov Modulated Bernoulli Processes) arrivals and time-varying service constraints. We derive a set of sufficient…

Performance · Computer Science 2014-03-18 Emilio Leonardi

We study two empirical process of special structure: firstly, the centred multiplier process indexed by a class $F$, $f \to \left|\sum_{i=1}^N (\xi_i f(X_i) - \E \xi f)\right|$, where the i.i.d. multipliers $(\xi_i)_{i=1}^N$ need not be…

Probability · Mathematics 2015-10-05 Shahar Mendelson

This article concerns the non-asymptotic analysis of the singular values (and Lyapunov exponents) of Gaussian matrix products in the regime where $N,$ the number of term in the product, is large and $n,$ the size of the matrices, may be…

Probability · Mathematics 2021-03-24 Boris Hanin , Grigoris Paouris

Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past. Complementing previous worst-case analyses, we study an average-case scenario where the load inputs are drawn from a fixed probability…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-03-28 Leran Cai , Thomas Sauerwald
‹ Prev 1 4 5 6 7 8 10 Next ›