Paul Dupuis : Infinite swapping schemes for accelerated Monte Carlo approximation
- Probability ( 101 Views )The theory of large deviations has been used in the development of Monte Carlo methods for estimating quantities defined in terms of a specific rare event, such as ruin probabilities or buffer overflow probabilities. However, rare events also play an important role when estimating functionals of an invariant distribution, where straightforward simulation will converge very slowly when parts of the state space do not communicate well. Problems of this sort are common in statistical inference, engineering and the physical sciences. After reviewing some of the methods used to accelerate the convergence of Monte Carlo, we consider the use of the large deviation rate for the empirical measure as a performance measure and introduce a new class of algorithms (which we call infinite swapping schemes) that optimize this rate.
Yuan Zhang : Phase transition in a metapopulation version of Schellings model
- Probability ( 93 Views )In 1971, Schelling introduced a model in which individuals move if they have too many neighbors of the opposite type. In this paper we will consider a metapopulation version of the model in which a city is divided into N neighborhoods each of which has L houses. There are ρ NL red indivdiuals and an equal number of blue individuals. Individuals are happy if the fraction of individuals of the opposite type in their neighborhood, is ≤ ρcand move to vacant houses at rates that depend on their state and that of their destination. Our goal is to show that if L is large then as ρ passes through ρc the system goes from a homogeneous state in which all neighborhoods have \approx ρL of each color to a segregated state in which 1/2 of the neighborhoods have ρ1L reds and ρ2L blues and 1/2 with the opposite composition.
Christopher Hoffman : Geodesics in first passage percolation
- Probability ( 95 Views )First passage percolation is the study of a random metric space generated by replacing each edge in a graph by an edge of a random length. The distance between two vertices u and v is the length of the shortest path connecting u and v. An infinite path P is a geodesic if for any two vertices u and v on P the shortest path between them in the random graph is along P. It is easy to show that in the nearest neighbor graph with vertices Z^2 that there exists at least one (one sided) infinite geodesic starting at any given vertex. It is widely expected that there are infinitely many such one sided infinite geodesics that begin at the origin, with (at least) one in every direction. But it turns out to be very difficult to prove that there are even two with positive probability. We will discuss some recent results which get closer to proving this widely held belief.
F. Baudoin : Functional Inequalities: Probability and geometry in interaction
- Probability ( 190 Views )The talk will be an introduction to the world of functional inequalities with a geometric content. I will in particular focus on the family of log-Sobolev and Sobolev inequalities and show how these inequalities are closely connected to the geometry of the ambient space. I will mainly follow the Bakry-Ledoux approach to these inequalities which is is based on the notion of intrinsic curvature of a diffusion operator and at the end of the presentation will explain how these ideas have recently been used in sub-Riemannian geometry.
Paul Tupper : A Framework for Modelling and Simulating Systems Satisfying Detailed Balance
- Probability ( 98 Views )We propose a framework for modelling stochastic systems which satisfy detailed balance (or in other terminology, time-reversibility). Rather than specifying the dynamics through a state-dependent drift and diffusion coefficients, we specify an equilibrium probability density and a state-dependent diffusion coefficient. We argue that our framework is more natural from the modelling point of view and has a distinct advantage in situations where either the equilibrium probability density or the diffusion coefficient is discontinuous. We introduce a numerical method for simulating dynamics in our framework that samples from the equilibrium probability density exactly and elegantly handles discontinuities in the coefficients. This is joint work with Xin Yang.
Christian Gromoll : Arzela-Ascoli in measure-valued Skorokhod space
- Probability ( 101 Views )I'll discuss the Arzela-Ascoli theorem in the Skorokhod space D(E) of E-valued functions that are right-continuous with left limits. There are several topologies one uses on D(E). For the most common J_1-topology, a version of the Arzela-Ascoli theorem is standard for quite general spaces E. In the weaker and less used M_1-topology however, a version of the theorem has only been available when E is a vector space. I'll describe a generalization to the setting where E is the metric space of finite Borel measures on the real line. I'll also show an application from a recent queueing theory result, where M_1 is the most natural choice of topology.
Junchi Li : Axelrods Model
- Probability ( 104 Views )Axelrod's model is a voter model in which individuals have multiple opinions and neighbors interact at a rate proprtional to the fraction of opinions they share. I will describe physuicists predictions about the behavior of this model, recent results of Lanchier in one dimension, and a new result I have proved about the two dimensional case.
Jonathan Mattingly : Noise induced stabilization of dynamical systems
- Probability ( 193 Views )We investigate an example of noise-induced stabilization in the plane that was also considered in (Gawedzki, Herzog, Wehr 2010) and (Birrell,Herzog, Wehr 2011). We show that despite the deterministic system not being globally stable, the addition of additive noise in the vertical direction leads to a unique invariant probability measure to which the system converges at a uniform, exponential rate. These facts are established primarily through the construction of a Lyapunov function which we generate as the solution to a sequence of Poisson equations. Unlike a number of other works, however, our Lyapunov function is constructed in a systematic way, and we present a meta-algorithm we hope will be applicable to other problems. We conclude by proving positivity properties of the transition density by using Malliavin calculus via some unusually explicit calculations. arXiv:1111.175v1 [math.PR]
Jeremy Quastel : The Kardar-Parisi-Zhang equation and its universality class
- Probability ( 110 Views )The KPZ equation was introduced in 1986, and has become the default model in physics for random interface growth. It is a member of a large universality class with non-standard fluctuations, including directed random polymers. Even in one dimension, it turned out to be difficult to interpret and analyze mathematically, but at the same time to have a large degree of exact solvability. We will survey the history and recent progress.
Rick Durrett : Evolving voter model
- Probability ( 97 Views )In the evolving voter model we choose oriented edges (x,y) at random. If the two individuals have the same opinion, nothing happens. If not, x imitates y with probability 1-á, and otherwise severs the connection with y and picks a new neighbor at random (i) from the graph, or (ii) from those with the same opinion as x. One model has a discontinuous transition, the other a continuous one.
Jan Wehr : Noise-induced drift---theory and experiment
- Probability ( 118 Views )Recent experiments show that an overdamped Brownian particle in a diffusion gradient experiences an additional drift. Equivalently, the Langevin equation describing the particle's motion should be interpreted according to the "anti-Ito" definition of stochastic integrals. I will explain this effect mathematically by studying the zero-mass limit of the stochastic Newton's equation modeling the particle's motion and, using a multiscale expansion, extend the analysis to a wide class of equations, including systems with colored noise and delay terms, interpreting recent electrical circuit experiments. The results were obtained in a collaboration with experimental physicists in Stuttgart: Giovanni Volpe, Clemens Bechinger, Laurent Helden and Thomas Brettschneider, as well as with the mathematics graduate students at the University of Arizona: Scott Hottovy and Austin McDaniel.
Philip Matchett Wood : Random doubly stochastic tridiagonal matrices
- Probability ( 105 Views )Let $T_n$ be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally as birth and death chains with a uniform stationary distribution. One can think of a typical matrix $T_n$ as one chosen uniformly at random, and this talk will present a simple algorithm to sample uniformly in $T_n$. Once we have our hands on a 'typical' element of $T_n$, there are many natural questions to ask: What are the eigenvalues? What is the mixing time? What is the distribution of the entries? This talk will explore these and other questions, with a focus on whether a random element of $T_n$ exhibits a cutoff in its approach to stationarity. Joint work with Persi Diaconis.
Benedek Valko : Point processes generated by carousels
- Probability ( 101 Views )For several classical matrix models the joint density of the eigenvalues can be written as an expression involving a Vandermonde determinant raised to the power of 1, 2 or 4. Most of these examples have beta-generalizations where this exponent is replaced by a parameter beta>0. In recent years the point process limits of various beta ensembles have been derived. The limiting processes are usually described as the spectrum of certain stochastic operators or with the help of a coupled system of SDEs. In the bulk beta Hermite case (which is the generalization of GUE) there is a nice geometric construction of the point process involving a Brownian motion in the hyperbolic plane, this is the Brownian carousel. Surprisingly, there are a number of other limit processes that have carousel like representation. We will discuss a couple of examples and some applications of these new representations. Joint with Balint Virag.
Ivan Corwin : Brownian Gibbs line ensembles.
- Probability ( 156 Views )The Airy line ensemble arises in scaling limits of growth models, directed polymers, random matrix theory, tiling problems and non-intersecting line ensembles. This talk will mainly focus on the "non-intersecting Brownian Gibbs property" for this infinite ensemble of lines. Roughly speaking, the measure on lines is invariant under resampling a given curve on an interval according to a Brownian Bridge conditioned to not intersect the above of below labeled curves. This property leads to the proof of a number of previously conjectured results about the top line of this ensemble. We will also briefly touch on the KPZ line ensemble, which arises as the scaling limit of a diffusion defined by the Doob-h transform of the quantum Toda lattice Hamiltonian. The top labeled curve of this KPZ ensemble is the fixed time solution to the famous Kardar-Parisi-Zhang stochastic PDE. This line ensemble has a "softer" Brownian Gibbs property in which resampled Brownian Bridges may cross the lines above and below, but at exponential energetic cost. This is based on joint work with Alan Hammond.
Ruth Williams : Control of Stochastic Processing Networks
- Probability ( 207 Views )Stochastic processing networks (SPNs) are a significant generalization of conventional queueing networks that allow for flexible scheduling through dynamic sequencing and alternate routing. SPNs arise naturally in a variety of applications in operations management and their control and analysis present challenging mathematical problems. One approach to these problems, via approximate diffusion control problems, has been outlined by J. M. Harrison. Various aspects of this approach have been developed mathematically, including a reduction in dimension of the diffusion control problem. However, other aspects have been less explored, especially, solution of the diffusion control problem, derivation of policies by interpretating such solutions, and limit theorems that establish optimality of such policies in a suitable asymptotic sense. In this talk, for a concrete class of networks called parallel server systems which arise in service network and computer science applications, we explore previously undeveloped aspects of Harrison's scheme and illustrate the use of the approach in obtaining simple control policies that are nearly optimal. Identification of a graphical structure for the network, an invariance principle and properties of local times of reflecting Brownian motion, will feature in our analysis. The talk will conclude with a summary of the current status and description of open problems associated with the further development of control of stochastic processing networks. This talk will draw on aspects of joint work with M. Bramson, M. Reiman, W. Kang and V. Pesic.
David Herzog : Supports of Degenerate Diffusion Processes: The Case of Polynomial Drift and Additive Noise
- Probability ( 211 Views )We discuss methods for computing supports of degenerate diffusion processes. We assume throughout that the diffusion satisfies a stochastic differential equation on Rd whose drift vector field X0 is ``polynomial'' and whose noise coefficients are constant. The case when each component of X0 is of odd degree is well understood. Hence we focus our efforts on X0 having at least one or more components of even degree. After developing methods to handle such cases, we shall apply them to specific examples, e.g. the Galerkin truncations of the Stochastic Navier-Stokes equation, to help establish ergodic properties of the resulting diffusion. One benefit to our approach is that, to prove such consequences, all we must do is compute certain Lie brackets.
Amir Dembo : Factor models on locally tree-like graphs
- Probability ( 103 Views )Consider factor (graphical) models on sparse graph sequences that converge locally to a random tree T. Using a novel interpolation scheme we prove existence of limiting free energy density under uniqueness of relevant Gibbs measures for the factor model on T. We demonstrate this for Potts and independent sets models and further characterize this limit via large-deviations type minimization problem and provide an explicit formula for its solution, as the Bethe free energy for a suitable fixed point of the belief propagation recursions on T (thereby rigorously generalize heuristic calculations by statistical physicists using ``replica'' or ``cavity'' methods). This talk is based on a joint work with Andrea Montanari and Nike Sun.
Jim Nolen : Normal approximation for a random resistor network
- Probability ( 92 Views )I will describe a central limit theorem for the rate of energy dissipation in a random network of resistors. In the continuum setting the model is an elliptic PDE with random conductivity coefficient. In the large network limit, homogenization occurs and the random dissipation rate can be approximated well by a normal random variable having the same mean and variance. I'll give error estimates for this approximation in total variation norm which have optimal scaling. The analysis is based on Stein's method and a recent result of Sourav Chatterjee.
Michael Damron : A simplified proof of the relation between scaling exponents in first passage percolation
- Probability ( 116 Views )In first passage percolation, we place i.i.d. non-negative weights on the nearest-neighbor edges of Z^d and study the induced random metric. A long-standing conjecture gives a relation between two "scaling exponents": one describes the variance of the distance between two points and the other describes the transversal fluctuations of optimizing paths between the same points. In a recent breakthrough work, Sourav Chatterjee proved this conjecture using a strong definition of the exponents. I will discuss work I just completed with Tuca Auffinger, in which we introduce a new and intuitive idea that replaces Chatterjee's main argument and gives an alternative proof of the relation. One advantage of our argument is that it does not require a non-trivial technical assumption of Chatterjee on the weight distribution.
Mokshay Madiman : A Shannon-McMillan-Breiman theorem for log-concave measures and applications in convex geometry
- Probability ( 116 Views )Our primary goal is to describe a strong quantitative form of the Shannon-McMillan-Breiman theorem for log-concave probability measures on linear spaces, even in the absence of stationarity. The main technical result is a concentration of measure inequality for the ``information content'' of certain random vectors. We will also briefly discuss implications. In particular, by combining this concentration result with ideas from information theory and convex geometry, we obtain a reverse entropy power inequality for convex measures that generalizes the reverse Brunn-Minkowski inequality of V. Milman. Along the way, we also develop a new information-theoretic formulation of Bourgain's hyperplane conjecture, as well as some Gaussian comparison inequalities for the entropy of log-concave probability measures. This is joint work with Sergey Bobkov (Minnesota).
Richard Bass : Uniqueness in law for parabolic SPDEs and infinite dimensional SDEs
- Probability ( 109 Views )We consider the heat equation on an interval with heat being introduced according to a random mechanism. When the random mechanism is space-time white noise, this equation has been much studied. We look at the case where the white noise is modified by a function A(u)(x) of the current temperatures u and where A is H\"older continuous as a function of u. Unlike other work along these lines, A(u)(x) can depend on the temperatures throughout the interval. Our method involves looking at the Fourier coefficients, which leads to an infinite dimensional system of stochastic differential equations. This is joint work with Ed Perkins.
Jessica Zuniga : On the spectral analysis of second-order Markov chains.
- Probability ( 97 Views )In this talk we consider second-order finite Markov chains that are > trajectorially reversible, a property that is a generalization of the > notion of reversibility for usual Markov chains. Specifically, we > study spectral properties of second-order Markov chains that have a > tendency to not return to their previous state. We confirm that > resorting to second-order chains can be an option to improve the speed > of convergence to equilibrium. This is joint work with Persi Diaconis > and Laurent Miclo.
Ming Fang : Miscellany on branching random walks
- Probability ( 99 Views )Branching random walk can be viewed as particles performing random walks while branching at integer time. We review some of the existing results on the maximal (or minimal) displacement, when each particle moves and branches independently according the same step distribution and the same branching law. Then we will compare them with similar but different models. Roughly speaking, in one variation, we will consider the asymptotic behavior of the particle at time n, whose ancestors location are consistently small. In another variation, we will consider the maximal displacement for the model, where the step distributions vary with respect to time.
Markos Katsoulakis : Accelerated Kinetic Monte Carlo methods: hierarchical parallel > algorithms and coarse-graining
- Probability ( 101 Views )In this talk we present two intimately related approaches in speeding-up molecular simulations via Monte Carlo simulations. First, we discuss coarse-graining algorithms for systems with complex, and often competing particle interactions, both in the equilibrium and non-equilibrium settings, which rely on multilevel sampling and communication. Second, we address mathematical, numerical and algorithmic issues arising in the parallelization of spatially distributed Kinetic Monte Carlo simulations, by developing a new hierarchical operator splitting of the underlying high-dimensional generator, as means of decomposing efficiently and systematically the computational load and communication between multiple processors. The common theme in both methods is the desire to identify and decompose the particle system in components that communicate minimally and thus local information can be either described by suitable coarse-variables (coarse-graining), or computed locally on a individual processors within a parallel architecture.
Brian Rider : Log-gases and Tracy-Widom laws
- Probability ( 190 Views )The now ubiquitous Tracy-Widom laws were first discovered in the context of the Gaussian Orthogonal, Unitary, and Symplectic Ensembles (G{O/U/S}E) of random matrix theory. The latter may be viewed as logarithmic gases with quadratic (Gaussian) potential at three special inverses temperatures (beta=1,2,4). A few years back, Jose Ramirez, Balint Virag, and I showed that that one obtains generalizations of the Tracy-Widom laws at all inverse temperatures (beta>0), though still for quadratic potentials. I'll explain how similar ideas (and considerably more labor) extends the result to general potential, general temperature log-gases. This is joint work with Manjunath Krishnapur and Balint Virag.
Scott Schmidler : Mixing times for non-stationary processes
- Probability ( 190 Views )Markov chain methods for Monte Carlo simulation of complex physical or statistical models often require significant tuning. Recent theoretical progress has renewed interest in "adaptive" Markov chain algorithms which learn from their sample history. However, these algorithms produce non-Markovian, time-inhomogeneous, irreversible stochastic processes, making rigorous analysis challenging. We show that lower bounds on the mixing times of these processes can be obtained using familiar ideas of hitting times and conductance from the theory of reversible Markov chains. The bounds obtained are sufficient to demonstrate slow mixing of several recently proposed algorithms including adaptive Metropolis kernels and the equi-energy sampler on some multimodal target distributions. These results provide the first non-trivial bounds on the mixing times of adaptive MCMC samplers, and suggest a way of classifying adaptive schemes that leads to new hybrid algorithms. Many open problems remain.
Jasmine Foo : Modeling diversity in tumor populations and implications for drug resistance
- Probability ( 102 Views )In this talk I will discuss a branching process model developed to study intra-tumor diversity (i.e. the variation amongst the cells within a single tumor). This variation arises due to heritable (epi)genetic alterations which can confer changes in cellular fitness and drug response. In the asymptotic (t-> infinity) regime, we study the growth rates of the population as well as some ecological measures of diversity in the tumor. In the second half of the talk I will discuss applications of this model to studying the emergence of drug resistant populations in Chronic Myeloid Leukemia (CML). (Joint work w/K. Leder, J. Mayberry, R. Durrett, F. Michor)