Spectra of Large Random Stochastic Matrices & Relaxation in Complex Systems
|
|
- Tracy Lewis
- 5 years ago
- Views:
Transcription
1 Spectra of Large Random Stochastic Matrices & Relaxation in Complex Systems Reimer Kühn Disordered Systems Group Department of Mathematics, King s College London Random Graphs and Random Processes, KCL 25 Apr, / 33
2 [Jeong et al (2001)] 2 / 33
3 [ Internet 2007] 3 / 33
4 Outline 1 Introduction Discrete Markov Chains Spectral Properties Relaxation Time Spectra 2 Relaxation in Complex Systems Markov Matrices Defined in Terms of Random Graphs Applications: Random Walks, Relaxation in Complex Energy Landscapes 3 Spectral Density Approach Analytically Tractable Limiting Cases 4 Numerical Tests 5 Summary 4 / 33
5 Outline 1 Introduction Discrete Markov Chains Spectral Properties Relaxation Time Spectra 2 Relaxation in Complex Systems Markov Matrices Defined in Terms of Random Graphs Applications: Random Walks, Relaxation in Complex Energy Landscapes 3 Spectral Density Approach Analytically Tractable Limiting Cases 4 Numerical Tests 5 Summary 5 / 33
6 Discrete Markov Chains Discrete homogeneous Markov chain in an N-dimensional state space, p(t+ 1)=Wp(t) p i (t+ 1)= W ij p j (t). j Normalization of probabilities requires that W is a stochastic matrix, W ij 0 for all i,j and W ij = 1 for all j. i Implies that generally σ(w) {z; z 1}. If W satisfies a detailed balance condition, then σ(w) [ 1,1]. 6 / 33
7 Spectral Properties Relaxation Time Spectra Perron-Frobenius Theorems: exactly one eigenvalue λ µ 1 =+1 for every irreducible component µ of state space. Assuming absence of cycles, all other eigenvalues satisfy λ µ α <1, α 1. If system is overall irreducible: equilibrium is unique and convergence to equilibrium is exponential in time, as long as N remains finite: Identify relaxation times ( p(t)=w t p(0)=p eq + λ t α v α wα,p(0) ) α( 1) τ α = 1 ln λ α spectrum of W relates to spectrum of relaxation times. 7 / 33
8 Existing Results Concerning Limiting Spectra Reversible Markov matrices on complete graphs Wigner Semicircular Law: Bordenave, Chaputo, Chafaï: arxiv: (2008) General Markov matrices on complete graphs Circular Law: Bordenave, Chaputo, Chafaï: arxiv: (2008) Continuous time random walk on oriented (sparse) ER graphs with diverging connectivity (c(n) log(n) 6 ) additive deformation of Circular Law: Bordenave, Chaputo, Chafaï: arxiv: (2012) Bouchaud trap model on complete graph: details depend on distribution of traps (random site model): Bovier and Faggionato, Ann. Appl. Prob. (2005) Spectra of graph Laplacians: various recent (approximate) results Grabow, Grosskinsky and Timme: MFT approximation of small worls spectra PRL (2012), Peixoto: large c modular networks PRL (2013) Zhang Guo and Lin: spectra of self-similar graphs PRE (2014). 8 / 33
9 Outline 1 Introduction Discrete Markov Chains Spectral Properties Relaxation Time Spectra 2 Relaxation in Complex Systems Markov Matrices Defined in Terms of Random Graphs Applications: Random Walks, Relaxation in Complex Energy Landscapes 3 Spectral Density Approach Analytically Tractable Limiting Cases 4 Numerical Tests 5 Summary 9 / 33
10 Markov matrices defined in terms of random graphs Interested in behaviour of Markov chains for large N, and transition matrices describing complex systems. Define in terms of weighted random graphs. Start from a rate matrix Γ=(Γ ij )=(c ij K ij ) on a random graph specified by a connectivity matrix C =(c ij ), and edge weights K ij > 0. Set Markov transition matrix elements to Γ ij Γ j, i j, W ij = 1, i = j, and Γ j = 0, 0, otherwise, whereγ j = i Γ ij. 10 / 33
11 Symmetrization Markov transition matrix can be symmetrized by a similarity transformation, if it satisfies a detailed balance condition w.r.t. an equilibrium distribution p i = p eq i W ij p j = W ji p i Symmetrized by W = P 1/2 WP 1/2 with P = diag(p i ) W ij = 1 pi W ij pj = W ji Symmetric structure is inherited by transformed master-equation operator M = P 1/2 MP 1/2, with M ij = W ij δ ij. Results so far restricted to this case. 11 / 33
12 Applications I Unbiased Random Walk Unbiased random walks on complex networks: K ij = 1; transitions to neighbouring vertices with equal probability: W ij = c ij k j, i j, and W ii = 1 on isolated sites (k i = 0). Symmetrized version is W ij = c ij ki k j, i j, and W ii = 1 on isolated sites. Symmetrized master-equation operator known as normalized graph Laplacian c ij, i j ki k j L ij = 1, i = j,and k i 0 0, otherwise. 12 / 33
13 Applicatons II Non-uniform Edge Weights Internet traffic (hopping of data packages between routers) Relaxation in complex energy landscapes; Kramers transition rates for transitions between long-lived states; e.g.: Γ ij = c ij exp { β(v ij E j ) } with energies E i and barriers V ij from some random distribution. generalized trap models. Markov transition matrices of generalized trap models satisfy a detailed balance condition with p i = Γ i Z e βe i can be symmetrized. 13 / 33
14 Outline 1 Introduction Discrete Markov Chains Spectral Properties Relaxation Time Spectra 2 Relaxation in Complex Systems Markov Matrices Defined in Terms of Random Graphs Applications: Random Walks, Relaxation in Complex Energy Landscapes 3 Spectral Density Approach Analytically Tractable Limiting Cases 4 Numerical Tests 5 Summary 14 / 33
15 Spectral Density and Resolvent Spectral density from resolvent ρ A (λ)= 1 πn Im Tr [ λ ε 1I A ] 1, λ ε = λ iε Express inverse matrix elements as Gaussian averages [S F Edwards & R C Jones (1976)] [ λε 1I A ] 1 ij = i u i u j, where... is an average over the multi-variate complex Gaussian P(u)= 1 { exp i ( u, [ λ ] )} ε 1I A u Z N 2 Spectral density expressed in terms of single site-variances ρ A (λ)= 1 πn Re u 2 i, i 15 / 33
16 Single-site marginals { P(u i ) exp i } 2 λ ε u 2 i Large Single Instances { du i exp i j i Here P (i) (u i ) is the joint marginal on a cavity graph. A ij u i u j }P (i) (u i ), l l j i k j k On a (locally) tree-like graph P (i) (u i ) j i P (i) j (u j ) so integral factors { P(u i ) exp i } 2 λ ε u 2 i j i du j exp {ia ij u i u j } P (i) j (u j ), 16 / 33
17 Large Single Instances - Contd. Same reasoning for the P (i) j (u j ) generates a recursion, { P (i) j (u j ) exp i } 2 λ ε u 2 j l j\i } du l exp {ia jl u j u l P (j) l (u l ). Cavity recursions self-consistently solved by (complex) Gaussians. { P (i) j (u j )= ω (i) j /2π exp 1 } 2 ω(i) j u 2 j, generate recursion for inverse cavity variances ω (i) j A = iλ ε + 2 jl l j\i ω (j). l Solve iteratively on single instances for N = O(10 5 ) 17 / 33
18 Thermodynamic Limit Recursions for inverse cavity variances can be interpreted as stochastic recursions, generating a self-consistency equation for their pdf π(ω). Structure for (up to symmetry) i.i.d matrix elements A ij = c ij K ij [RK (2008)] with π(ω)= k 1p(k) k c k 1 ν=1 Ω k 1 =Ω k 1 ({ω ν,k ν })=iλ ε + dπ(ω ν ) δ(ω Ω k 1 ) {Kν } k 1 Kν 2 ν=1 ω ν. Solve using population dynamics algorithm. [Mézard, Parisi (2001)] & get spectral density: ρ(λ)= 1 π Re k k p(k) dπ(ω l ) ν=1 1 Ω k ({ω ν,k ν }) Can identify continuous and pure point contributions to DOS. {K ν } 18 / 33
19 Unbiased Random Walk Self-consistency equations for pdf of inverse cavity variances; first: transformation u i u i / k i on non-isolated sites with π(ω)= k 1p(k) k c k 1 l=1 dπ(ω l ) δ(ω Ω k 1 ) k 1 Ω k 1 =Ω k 1 ({ω l })=iλ ε k+ l=1 1 ω l. Solve using stochastic (population dynamics) algorithm. In terms of these ρ(λ)=p(0)δ(λ 1)+ 1 π Re k 1 k p(k) dπ(ω l ) l=1 k Ω k ({ω l }) 19 / 33
20 General Markov Matrices Same structure superficially; first: transformation u i u i / Γ i on non-isolated sites second: differences due to column constraints ( dependencies between matrix elements beyond degree) with π(ω)= k 1p(k) k c Ω k 1 = k 1 ν=1 k 1 ν=1 [ dπ(ω ν ) iλ ε K ν + ω ν + iλ ε K ν δ ( ω Ω k 1 ) {K ν } In terms of these ρ(λ)=p(0)δ(λ 1)+ 1 k k π Re p(k) dπ(ω l ) ν=1 K ν k 1 ν=1 Ω k ({ω ν,k ν }) {K ν } K 2 ν ]. 20 / 33
21 Analytically Tractable Limiting Cases Unbiased Random Walk on Random Regular & Large-c Erdös-Renyi Graph Recall FPE with π(ω)= k 1p(k) k c k 1 ν=1 Ω k 1 = iλ ε k+ dπ(ω ν ) δ(ω Ω k 1 ) k 1 ν=1 1. ω ν Regular Random Graphs p(k)=δ k,c. All sites equivalent. Expect Gives π(ω)=δ(ω ω), ω=iλ ε c+ c 1 ω ρ(λ)= c 4 c 1 λ 2 c 2 2π 1 λ 2 Kesten-McKay distribution adapted to Markov matrices Same result for large c Erdös-Renyi graphs Wigner semi-circle 21 / 33
22 Recall FPE with Analytically Tractable Limiting Cases General Markov Matricies for large-c Erdös-Renyi Graph π(ω)= k 1p(k) k c Ω k 1 = k 1 ν=1 k 1 [ l=1 dπ(ω l ) δ(ω Ω k 1 ) {Kν } iλ ε K ν + K 2 ν ω ν + iλ ε K ν Large c: contributions only for large k. Approximate Ω k 1 by sum of averages (LLN). Expect [ ] K 2 π(ω) δ(ω ω), ω c iλ ε K +. ω+iλ ε K [ ] Gives ρ(λ)= 1 π Re c K ω Is remarkably precise already for c 20. For large c, get semicircular law ρ(λ)= c K 2 4 K 2 2π K 2 c K 2 λ2 ]. 22 / 33
23 Outline 1 Introduction Discrete Markov Chains Spectral Properties Relaxation Time Spectra 2 Relaxation in Complex Systems Markov Matrices Defined in Terms of Random Graphs Applications: Random Walks, Relaxation in Complex Energy Landscapes 3 Spectral Density Approach Analytically Tractable Limiting Cases 4 Numerical Tests 5 Summary 23 / 33
24 Unbiased Random Walk Spectral density: k i Poisson(2), W unbiased RW ρ λ λ Simulation results, averaged over matrices (green) 24 / 33
25 Unbiased Random Walk Spectral density: k i Poisson(2), W unbiased RW ρ λ λ Simulation results, averaged over matrices (green) ; population-dynamics results (red) added. 25 / 33
26 Unbiased Random Walk Spectral density: k i Poisson(2), W unbiased RW ρ λ λ zoom into the edge of the spectrum: extended states (red), total DOS (green). 26 / 33
27 Unbiased Random Walk Relaxation time spectrum: k i Poisson(2), W unbiased RW ρ τ e-05 1e-06 1e τ Relaxation time spectrum. Extended states (red), total DOS (green) 27 / 33
28 Unbiased Random Walk Regular Random Graph comparison population dynamics analytic result ρ λ λ Population dynamics results (red) compared to analytic result (green) for RW on regular random graph at c = / 33
29 Stochastic Matrices Spectral density: k i Poisson(2), p(k ij ) K 1 ij ;K ij [e β,1] K ij = exp{ βv ij } with V ij U[0,1] Kramers rates ρ λ 0.8 ρ λ λ λ Spectral density for stochastic matrices defined on Poisson random graphs with c = 2, and β=2. Left: Simulation results (green) compared with population dynamics results (red). Right: Population dynamics results, extended states (red), total DOS (green). 29 / 33
30 Stochastic Matrices Spectral density: k i Poisson(2), p(k ij ) K 1 ij ;K ij [e β,1] K ij = exp{ βv ij } with V ij U[0,1] Kramers rates ρ λ 2.5 ρ λ λ λ Spectral density for stochastic matrices defined on Poisson random graphs with c = 2, and β=5. Left: Simulation results (green) compared with population dynamics results (red); Right: Population dynamics results, extended states (red), total DOS (green). 30 / 33
31 Stochastic Matrices Relaxation time spectra Kramers rates: relaxation time spectra ρ τ e-05 ρ τ e-06 1e-05 1e-07 1e-06 1e τ 1e τ Relaxation time spectra; scale-free graph p k k 3 for k 2. Kramers rates at β=2 (left) and β=5 (right). DOS of extended modes (red full line) and total DOS (green dashed line). 31 / 33
32 Outline 1 Introduction Discrete Markov Chains Spectral Properties Relaxation Time Spectra 2 Relaxation in Complex Systems Markov Matrices Defined in Terms of Random Graphs Applications: Random Walks, Relaxation in Complex Energy Landscapes 3 Spectral Density Approach Analytically Tractable Limiting Cases 4 Numerical Tests 5 Summary 32 / 33
33 Summary Computed DOS of Stochastic matrices defined on random graphs. Analysis equivalent to alternative replica approach. Restrictions: detailed balance & finite mean connectivity Closed form solution for unbiased random walk on regular random graphs Algebraic approximations for general Markov matrices on large c random regular and Erdös Renyi graphs. Get semicircular laws asymptotically at large c. Localized states at edges of specrum implies finite maximal relaxation time for extended states (transport processes) even in thermodynamic limit. For p(k ij ) K 1 ij ;K ij [e β,1] see localization effects at large β and concetration of DOS at edges of the spectrum ( relaxation time spectrum dominated by slow modes Glassy Dynamics? 33 / 33
Introduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 Markov Chain Monte Carlo Methods Barnabás Póczos & Aarti Singh Contents Markov Chain Monte Carlo Methods Goal & Motivation Sampling Rejection Importance Markov
More informationConvex Optimization CMU-10725
Convex Optimization CMU-10725 Simulated Annealing Barnabás Póczos & Ryan Tibshirani Andrey Markov Markov Chains 2 Markov Chains Markov chain: Homogen Markov chain: 3 Markov Chains Assume that the state
More informationThe non-backtracking operator
The non-backtracking operator Florent Krzakala LPS, Ecole Normale Supérieure in collaboration with Paris: L. Zdeborova, A. Saade Rome: A. Decelle Würzburg: J. Reichardt Santa Fe: C. Moore, P. Zhang Berkeley:
More informationThe cutoff phenomenon for random walk on random directed graphs
The cutoff phenomenon for random walk on random directed graphs Justin Salez Joint work with C. Bordenave and P. Caputo Outline of the talk Outline of the talk 1. The cutoff phenomenon for Markov chains
More informationPerron Frobenius Theory
Perron Frobenius Theory Oskar Perron Georg Frobenius (1880 1975) (1849 1917) Stefan Güttel Perron Frobenius Theory 1 / 10 Positive and Nonnegative Matrices Let A, B R m n. A B if a ij b ij i, j, A > B
More informationConvex Optimization of Graph Laplacian Eigenvalues
Convex Optimization of Graph Laplacian Eigenvalues Stephen Boyd Stanford University (Joint work with Persi Diaconis, Arpita Ghosh, Seung-Jean Kim, Sanjay Lall, Pablo Parrilo, Amin Saberi, Jun Sun, Lin
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationPhase transitions in discrete structures
Phase transitions in discrete structures Amin Coja-Oghlan Goethe University Frankfurt Overview 1 The physics approach. [following Mézard, Montanari 09] Basics. Replica symmetry ( Belief Propagation ).
More informationAlgebraic Representation of Networks
Algebraic Representation of Networks 0 1 2 1 1 0 0 1 2 0 0 1 1 1 1 1 Hiroki Sayama sayama@binghamton.edu Describing networks with matrices (1) Adjacency matrix A matrix with rows and columns labeled by
More informationNETADIS Kick off meeting. Torino,3-6 february Payal Tyagi
NETADIS Kick off meeting Torino,3-6 february 2013 Payal Tyagi Outline My background Project: 1) Theoretical part a) Haus master equation and Hamiltonian b) First steps: - Modelling systems with disordered
More informationMonte Carlo Methods. Leon Gu CSD, CMU
Monte Carlo Methods Leon Gu CSD, CMU Approximate Inference EM: y-observed variables; x-hidden variables; θ-parameters; E-step: q(x) = p(x y, θ t 1 ) M-step: θ t = arg max E q(x) [log p(y, x θ)] θ Monte
More informationStochastic Processes
Stochastic Processes 8.445 MIT, fall 20 Mid Term Exam Solutions October 27, 20 Your Name: Alberto De Sole Exercise Max Grade Grade 5 5 2 5 5 3 5 5 4 5 5 5 5 5 6 5 5 Total 30 30 Problem :. True / False
More informationLocal Kesten McKay law for random regular graphs
Local Kesten McKay law for random regular graphs Roland Bauerschmidt (with Jiaoyang Huang and Horng-Tzer Yau) University of Cambridge Weizmann Institute, January 2017 Random regular graph G N,d is the
More informationSpectral Analysis of Directed Complex Networks. Tetsuro Murai
MASTER THESIS Spectral Analysis of Directed Complex Networks Tetsuro Murai Department of Physics, Graduate School of Science and Engineering, Aoyama Gakuin University Supervisors: Naomichi Hatano and Kenn
More informationMarkov Chains, Random Walks on Graphs, and the Laplacian
Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer
More informationConfidence intervals for the mixing time of a reversible Markov chain from a single sample path
Confidence intervals for the mixing time of a reversible Markov chain from a single sample path Daniel Hsu Aryeh Kontorovich Csaba Szepesvári Columbia University, Ben-Gurion University, University of Alberta
More informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
More informationNetworks: space-time stochastic models for networks
Mobile and Delay Tolerant Networks: space-time stochastic models for networks Philippe Jacquet Alcatel-Lucent Bell Labs France Plan of the talk Short history of wireless networking Information in space-time
More informationRandom Matrices: Beyond Wigner and Marchenko-Pastur Laws
Random Matrices: Beyond Wigner and Marchenko-Pastur Laws Nathan Noiry Modal X, Université Paris Nanterre May 3, 2018 Wigner s Matrices Wishart s Matrices Generalizations Wigner s Matrices ij, (n, i, j
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationAsymptotic properties of the maximum likelihood estimator for a ballistic random walk in a random environment
Asymptotic properties of the maximum likelihood estimator for a ballistic random walk in a random environment Catherine Matias Joint works with F. Comets, M. Falconnet, D.& O. Loukianov Currently: Laboratoire
More informationSpectra of modular and small-world matrices
IOP PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND THEORETICAL J. Phys. A: Math. Theor. 44 (211) 16525 (18pp) doi:1.188/1751-8113/44/16/16525 Spectra of modular and small-world matrices Reimer Kühn
More informationRandom Matrix: From Wigner to Quantum Chaos
Random Matrix: From Wigner to Quantum Chaos Horng-Tzer Yau Harvard University Joint work with P. Bourgade, L. Erdős, B. Schlein and J. Yin 1 Perhaps I am now too courageous when I try to guess the distribution
More informationLect4: Exact Sampling Techniques and MCMC Convergence Analysis
Lect4: Exact Sampling Techniques and MCMC Convergence Analysis. Exact sampling. Convergence analysis of MCMC. First-hit time analysis for MCMC--ways to analyze the proposals. Outline of the Module Definitions
More informationTheory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk
Instructor: Victor F. Araman December 4, 2003 Theory and Applications of Stochastic Systems Lecture 0 B60.432.0 Exponential Martingale for Random Walk Let (S n : n 0) be a random walk with i.i.d. increments
More informationResistance Growth of Branching Random Networks
Peking University Oct.25, 2018, Chengdu Joint work with Yueyun Hu (U. Paris 13) and Shen Lin (U. Paris 6), supported by NSFC Grant No. 11528101 (2016-2017) for Research Cooperation with Oversea Investigators
More informationFinding normalized and modularity cuts by spectral clustering. Ljubjana 2010, October
Finding normalized and modularity cuts by spectral clustering Marianna Bolla Institute of Mathematics Budapest University of Technology and Economics marib@math.bme.hu Ljubjana 2010, October Outline Find
More informationIntroduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 Markov Chain Monte Carlo Methods Barnabás Póczos Contents Markov Chain Monte Carlo Methods Sampling Rejection Importance Hastings-Metropolis Gibbs Markov Chains
More information12 Markov chains The Markov property
12 Markov chains Summary. The chapter begins with an introduction to discrete-time Markov chains, and to the use of matrix products and linear algebra in their study. The concepts of recurrence and transience
More informationELEC633: Graphical Models
ELEC633: Graphical Models Tahira isa Saleem Scribe from 7 October 2008 References: Casella and George Exploring the Gibbs sampler (1992) Chib and Greenberg Understanding the Metropolis-Hastings algorithm
More informationIII. Quantum ergodicity on graphs, perspectives
III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +
More informationApproximating a single component of the solution to a linear system
Approximating a single component of the solution to a linear system Christina E. Lee, Asuman Ozdaglar, Devavrat Shah celee@mit.edu asuman@mit.edu devavrat@mit.edu MIT LIDS 1 How do I compare to my competitors?
More informationSwitching Regime Estimation
Switching Regime Estimation Series de Tiempo BIrkbeck March 2013 Martin Sola (FE) Markov Switching models 01/13 1 / 52 The economy (the time series) often behaves very different in periods such as booms
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationDiscrete solid-on-solid models
Discrete solid-on-solid models University of Alberta 2018 COSy, University of Manitoba - June 7 Discrete processes, stochastic PDEs, deterministic PDEs Table: Deterministic PDEs Heat-diffusion equation
More informationDistribution of Eigenvalues of Weighted, Structured Matrix Ensembles
Distribution of Eigenvalues of Weighted, Structured Matrix Ensembles Olivia Beckwith 1, Steven J. Miller 2, and Karen Shen 3 1 Harvey Mudd College 2 Williams College 3 Stanford University Joint Meetings
More informationOn the number of circuits in random graphs. Guilhem Semerjian. [ joint work with Enzo Marinari and Rémi Monasson ]
On the number of circuits in random graphs Guilhem Semerjian [ joint work with Enzo Marinari and Rémi Monasson ] [ Europhys. Lett. 73, 8 (2006) ] and [ cond-mat/0603657 ] Orsay 13-04-2006 Outline of the
More informationEXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY
EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 011 MODULE 3 : Stochastic processes and time series Time allowed: Three Hours Candidates should answer FIVE questions. All questions carry
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA 2 Department of Computer
More informationarxiv: v3 [math-ph] 21 Jun 2012
LOCAL MARCHKO-PASTUR LAW AT TH HARD DG OF SAMPL COVARIAC MATRICS CLAUDIO CACCIAPUOTI, AA MALTSV, AD BJAMI SCHLI arxiv:206.730v3 [math-ph] 2 Jun 202 Abstract. Let X be a matrix whose entries are i.i.d.
More informationInhomogeneous circular laws for random matrices with non-identically distributed entries
Inhomogeneous circular laws for random matrices with non-identically distributed entries Nick Cook with Walid Hachem (Telecom ParisTech), Jamal Najim (Paris-Est) and David Renfrew (SUNY Binghamton/IST
More informationShortest Paths & Link Weight Structure in Networks
Shortest Paths & Link Weight Structure in etworks Piet Van Mieghem CAIDA WIT (May 2006) P. Van Mieghem 1 Outline Introduction The Art of Modeling Conclusions P. Van Mieghem 2 Telecommunication: e2e A ETWORK
More information8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains
8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains 8.1 Review 8.2 Statistical Equilibrium 8.3 Two-State Markov Chain 8.4 Existence of P ( ) 8.5 Classification of States
More informationGraph Sparsification I : Effective Resistance Sampling
Graph Sparsification I : Effective Resistance Sampling Nikhil Srivastava Microsoft Research India Simons Institute, August 26 2014 Graphs G G=(V,E,w) undirected V = n w: E R + Sparsification Approximate
More informationFractal Geometry of Minimal Spanning Trees
Fractal Geometry of Minimal Spanning Trees T. S. Jackson and N. Read Part I: arxiv:0902.3651 Part II: arxiv:0909.5343 Accepted by Phys. Rev. E Problem Definition Given a graph with costs on the edges,
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More informationA fixed-point approximation accounting for link interactions in a loss network
A fixed-point approximation accounting for link interactions in a loss network MR Thompson PK Pollett Department of Mathematics The University of Queensland Abstract This paper is concerned with evaluating
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationNPTEL
NPTEL Syllabus Nonequilibrium Statistical Mechanics - Video course COURSE OUTLINE Thermal fluctuations, Langevin dynamics, Brownian motion and diffusion, Fokker-Planck equations, linear response theory,
More informationComputer Vision Group Prof. Daniel Cremers. 11. Sampling Methods: Markov Chain Monte Carlo
Group Prof. Daniel Cremers 11. Sampling Methods: Markov Chain Monte Carlo Markov Chain Monte Carlo In high-dimensional spaces, rejection sampling and importance sampling are very inefficient An alternative
More informationA regeneration proof of the central limit theorem for uniformly ergodic Markov chains
A regeneration proof of the central limit theorem for uniformly ergodic Markov chains By AJAY JASRA Department of Mathematics, Imperial College London, SW7 2AZ, London, UK and CHAO YANG Department of Mathematics,
More informationComputer Intensive Methods in Mathematical Statistics
Computer Intensive Methods in Mathematical Statistics Department of mathematics johawes@kth.se Lecture 16 Advanced topics in computational statistics 18 May 2017 Computer Intensive Methods (1) Plan of
More informationIntroduction. Genetic Algorithm Theory. Overview of tutorial. The Simple Genetic Algorithm. Jonathan E. Rowe
Introduction Genetic Algorithm Theory Jonathan E. Rowe University of Birmingham, UK GECCO 2012 The theory of genetic algorithms is beginning to come together into a coherent framework. However, there are
More informationA NOTE ON THE ASYMPTOTIC BEHAVIOUR OF A PERIODIC MULTITYPE GALTON-WATSON BRANCHING PROCESS. M. González, R. Martínez, M. Mota
Serdica Math. J. 30 (2004), 483 494 A NOTE ON THE ASYMPTOTIC BEHAVIOUR OF A PERIODIC MULTITYPE GALTON-WATSON BRANCHING PROCESS M. González, R. Martínez, M. Mota Communicated by N. M. Yanev Abstract. In
More informationStochastic process for macro
Stochastic process for macro Tianxiao Zheng SAIF 1. Stochastic process The state of a system {X t } evolves probabilistically in time. The joint probability distribution is given by Pr(X t1, t 1 ; X t2,
More informationSpin Glas Dynamics and Stochastic Optimization Schemes. Karl Heinz Hoffmann TU Chemnitz
Spin Glas Dynamics and Stochastic Optimization Schemes Karl Heinz Hoffmann TU Chemnitz 1 Spin Glasses spin glass e.g. AuFe AuMn CuMn nobel metal (no spin) transition metal (spin) 0.1-10 at% ferromagnetic
More informationNetworks: Lectures 9 & 10 Random graphs
Networks: Lectures 9 & 10 Random graphs Heather A Harrington Mathematical Institute University of Oxford HT 2017 What you re in for Week 1: Introduction and basic concepts Week 2: Small worlds Week 3:
More informationBeyond the Gaussian universality class
Beyond the Gaussian universality class MSRI/Evans Talk Ivan Corwin (Courant Institute, NYU) September 13, 2010 Outline Part 1: Random growth models Random deposition, ballistic deposition, corner growth
More informationStatistics & Data Sciences: First Year Prelim Exam May 2018
Statistics & Data Sciences: First Year Prelim Exam May 2018 Instructions: 1. Do not turn this page until instructed to do so. 2. Start each new question on a new sheet of paper. 3. This is a closed book
More informationLecture 15 Perron-Frobenius Theory
EE363 Winter 2005-06 Lecture 15 Perron-Frobenius Theory Positive and nonnegative matrices and vectors Perron-Frobenius theorems Markov chains Economic growth Population dynamics Max-min and min-max characterization
More informationSpectra of adjacency matrices of random geometric graphs
Spectra of adjacency matrices of random geometric graphs Paul Blackwell, Mark Edmondson-Jones and Jonathan Jordan University of Sheffield 22nd December 2006 Abstract We investigate the spectral properties
More informationSynchronization Transitions in Complex Networks
Synchronization Transitions in Complex Networks Y. Moreno 1,2,3 1 Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza, Zaragoza 50018, Spain 2 Department of Theoretical
More informationPattern Recognition and Machine Learning. Bishop Chapter 11: Sampling Methods
Pattern Recognition and Machine Learning Chapter 11: Sampling Methods Elise Arnaud Jakob Verbeek May 22, 2008 Outline of the chapter 11.1 Basic Sampling Algorithms 11.2 Markov Chain Monte Carlo 11.3 Gibbs
More informationMarkov Chains. Sarah Filippi Department of Statistics TA: Luke Kelly
Markov Chains Sarah Filippi Department of Statistics http://www.stats.ox.ac.uk/~filippi TA: Luke Kelly With grateful acknowledgements to Prof. Yee Whye Teh's slides from 2013 14. Schedule 09:30-10:30 Lecture:
More informationThe Tightness of the Kesten-Stigum Reconstruction Bound for a Symmetric Model With Multiple Mutations
The Tightness of the Kesten-Stigum Reconstruction Bound for a Symmetric Model With Multiple Mutations City University of New York Frontier Probability Days 2018 Joint work with Dr. Sreenivasa Rao Jammalamadaka
More informationQuantum Probability and Asymptotic Spectral Analysis of Growing Roma, GraphsNovember 14, / 47
Quantum Probability and Asymptotic Spectral Analysis of Growing Graphs Nobuaki Obata GSIS, Tohoku University Roma, November 14, 2013 Quantum Probability and Asymptotic Spectral Analysis of Growing Roma,
More informationString method for the Cahn-Hilliard dynamics
String method for the Cahn-Hilliard dynamics Tiejun Li School of Mathematical Sciences Peking University tieli@pku.edu.cn Joint work with Wei Zhang and Pingwen Zhang Outline Background Problem Set-up Algorithms
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationStochastic modelling of epidemic spread
Stochastic modelling of epidemic spread Julien Arino Centre for Research on Inner City Health St Michael s Hospital Toronto On leave from Department of Mathematics University of Manitoba Julien Arino@umanitoba.ca
More informationP(X 0 = j 0,... X nk = j k )
Introduction to Probability Example Sheet 3 - Michaelmas 2006 Michael Tehranchi Problem. Let (X n ) n 0 be a homogeneous Markov chain on S with transition matrix P. Given a k N, let Z n = X kn. Prove that
More informationThe Matrix Dyson Equation in random matrix theory
The Matrix Dyson Equation in random matrix theory László Erdős IST, Austria Mathematical Physics seminar University of Bristol, Feb 3, 207 Joint work with O. Ajanki, T. Krüger Partially supported by ERC
More informationMultifractality in simple systems. Eugene Bogomolny
Multifractality in simple systems Eugene Bogomolny Univ. Paris-Sud, Laboratoire de Physique Théorique et Modèles Statistiques, Orsay, France In collaboration with Yasar Atas Outlook 1 Multifractality Critical
More informationChapter 3 - Temporal processes
STK4150 - Intro 1 Chapter 3 - Temporal processes Odd Kolbjørnsen and Geir Storvik January 23 2017 STK4150 - Intro 2 Temporal processes Data collected over time Past, present, future, change Temporal aspect
More informationHopping transport in disordered solids
Hopping transport in disordered solids Dominique Spehner Institut Fourier, Grenoble, France Workshop on Quantum Transport, Lexington, March 17, 2006 p. 1 Outline of the talk Hopping transport Models for
More informationRandom regular digraphs: singularity and spectrum
Random regular digraphs: singularity and spectrum Nick Cook, UCLA Probability Seminar, Stanford University November 2, 2015 Universality Circular law Singularity probability Talk outline 1 Universality
More informationQuantum Chaos and Nonunitary Dynamics
Quantum Chaos and Nonunitary Dynamics Karol Życzkowski in collaboration with W. Bruzda, V. Cappellini, H.-J. Sommers, M. Smaczyński Phys. Lett. A 373, 320 (2009) Institute of Physics, Jagiellonian University,
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Computer Science! Department of Statistical Sciences! rsalakhu@cs.toronto.edu! h0p://www.cs.utoronto.ca/~rsalakhu/ Lecture 7 Approximate
More informationModel reversibility of a two dimensional reflecting random walk and its application to queueing network
arxiv:1312.2746v2 [math.pr] 11 Dec 2013 Model reversibility of a two dimensional reflecting random walk and its application to queueing network Masahiro Kobayashi, Masakiyo Miyazawa and Hiroshi Shimizu
More informationSimons Workshop on Approximate Counting, Markov Chains and Phase Transitions: Open Problem Session
Simons Workshop on Approximate Counting, Markov Chains and Phase Transitions: Open Problem Session Scribes: Antonio Blanca, Sarah Cannon, Yumeng Zhang February 4th, 06 Yuval Peres: Simple Random Walk on
More informationCritical Phenomena and Percolation Theory: II
Critical Phenomena and Percolation Theory: II Kim Christensen Complexity & Networks Group Imperial College London Joint CRM-Imperial College School and Workshop Complex Systems Barcelona 8-13 April 2013
More informationDistributed Estimation and Detection for Smart Grid
Distributed Estimation and Detection for Smart Grid Texas A&M University Joint Wor with: S. Kar (CMU), R. Tandon (Princeton), H. V. Poor (Princeton), and J. M. F. Moura (CMU) 1 Distributed Estimation/Detection
More informationHigh-dimensional covariance estimation based on Gaussian graphical models
High-dimensional covariance estimation based on Gaussian graphical models Shuheng Zhou Department of Statistics, The University of Michigan, Ann Arbor IMA workshop on High Dimensional Phenomena Sept. 26,
More information1 Complex Networks - A Brief Overview
Power-law Degree Distributions 1 Complex Networks - A Brief Overview Complex networks occur in many social, technological and scientific settings. Examples of complex networks include World Wide Web, Internet,
More informationStochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS
Stochastic Processes Theory for Applications Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS Contents Preface page xv Swgg&sfzoMj ybr zmjfr%cforj owf fmdy xix Acknowledgements xxi 1 Introduction and review
More informationLinear-fractional branching processes with countably many types
Branching processes and and their applications Badajoz, April 11-13, 2012 Serik Sagitov Chalmers University and University of Gothenburg Linear-fractional branching processes with countably many types
More information215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that
15 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that µ ν tv = (1/) x S µ(x) ν(x) = x S(µ(x) ν(x)) + where a + = max(a, 0). Show that
More informationLanguage Acquisition and Parameters: Part II
Language Acquisition and Parameters: Part II Matilde Marcolli CS0: Mathematical and Computational Linguistics Winter 205 Transition Matrices in the Markov Chain Model absorbing states correspond to local
More informationMean-field dual of cooperative reproduction
The mean-field dual of systems with cooperative reproduction joint with Tibor Mach (Prague) A. Sturm (Göttingen) Friday, July 6th, 2018 Poisson construction of Markov processes Let (X t ) t 0 be a continuous-time
More informationFacebook Friends! and Matrix Functions
Facebook Friends! and Matrix Functions! Graduate Research Day Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Network Analysis Use linear algebra
More informationA. Bovier () Branching Brownian motion: extremal process and ergodic theorems
Branching Brownian motion: extremal process and ergodic theorems Anton Bovier with Louis-Pierre Arguin and Nicola Kistler RCS&SM, Venezia, 06.05.2013 Plan 1 BBM 2 Maximum of BBM 3 The Lalley-Sellke conjecture
More informationLarge sample covariance matrices and the T 2 statistic
Large sample covariance matrices and the T 2 statistic EURANDOM, the Netherlands Joint work with W. Zhou Outline 1 2 Basic setting Let {X ij }, i, j =, be i.i.d. r.v. Write n s j = (X 1j,, X pj ) T and
More informationStochastic optimization Markov Chain Monte Carlo
Stochastic optimization Markov Chain Monte Carlo Ethan Fetaya Weizmann Institute of Science 1 Motivation Markov chains Stationary distribution Mixing time 2 Algorithms Metropolis-Hastings Simulated Annealing
More informationLimit Laws for Random Matrices from Traffic Probability
Limit Laws for Random Matrices from Traffic Probability arxiv:1601.02188 Slides available at math.berkeley.edu/ bensonau Benson Au UC Berkeley May 9th, 2016 Benson Au (UC Berkeley) Random Matrices from
More informationRandom Matrix Theory Lecture 1 Introduction, Ensembles and Basic Laws. Symeon Chatzinotas February 11, 2013 Luxembourg
Random Matrix Theory Lecture 1 Introduction, Ensembles and Basic Laws Symeon Chatzinotas February 11, 2013 Luxembourg Outline 1. Random Matrix Theory 1. Definition 2. Applications 3. Asymptotics 2. Ensembles
More informationPhase Transitions in Random Discrete Structures
Institut für Optimierung und Diskrete Mathematik Phase Transition in Thermodynamics The phase transition deals with a sudden change in the properties of an asymptotically large structure by altering critical
More informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationSpectral Graph Theory and its Applications. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity
Spectral Graph Theory and its Applications Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity Outline Adjacency matrix and Laplacian Intuition, spectral graph drawing
More informationWeak quenched limiting distributions of a one-dimensional random walk in a random environment
Weak quenched limiting distributions of a one-dimensional random walk in a random environment Jonathon Peterson Cornell University Department of Mathematics Joint work with Gennady Samorodnitsky September
More informationMCMC and Gibbs Sampling. Sargur Srihari
MCMC and Gibbs Sampling Sargur srihari@cedar.buffalo.edu 1 Topics 1. Markov Chain Monte Carlo 2. Markov Chains 3. Gibbs Sampling 4. Basic Metropolis Algorithm 5. Metropolis-Hastings Algorithm 6. Slice
More information