Related papers: Mixing times for a constrained Ising process on th…
We study bidisperse colloidal suspensions confined within glass microcapillary tubes to model the glass transition in confined cylindrical geometries. We use high speed three-dimensional confocal microscopy to observe particle motions for a…
We consider the time dependent probability distribution of a coarse grained observable Y whose evolution is governed by a discrete time map. If the map is mixing, the time dependent one-step transition probabilities converge in the long…
This paper considers small gain theorems for the global asymptotic and exponential input-to-state stability for discrete time time-delay systems using Razumikhin-type Lyapunov function. Among other things, unlike the existing literature, it…
We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain $M$ on a state space $\Omega$ with stationary distribution $\pi$ and a monotone set $A \subset \Omega$. We consider the chain…
We study the problem of collaboratively estimating the state of a discrete-time LTI process by a network of sensor nodes interacting over a time-varying directed communication graph. Existing approaches to this problem either (i) make…
The static and dynamic properties of ring polymers in concentrated solutions remains one of the last deep unsolved questions in Polymer Physics. At the same time, the nature of the glass transition in polymeric systems is also not well…
We analyze the classical problem of the stochastic dynamics of a particle confined in a periodic potential, through the so called Il'in and Khasminskii model, with a novel semi-analytical approach. Our approach gives access to the transient…
Glauber dynamics of the Ising model on a random regular graph is known to mix fast below the tree uniqueness threshold and exponentially slowly above it. We show that Kawasaki dynamics of the canonical ferromagnetic Ising model on a random…
Systems of interacting continuous-time Markov chains are a powerful model class, but inference is typically intractable in high dimensional settings. Auxiliary information, such as noisy observations, is typically only available at discrete…
Conditional graph entropy is known to be the minimal rate for a natural functional compression problem with side information at the receiver. In this paper we show that it can be formulated as an alternating minimization problem, which…
We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some…
We study the slow quenching dynamics (characterized by an inverse rate, $\tau^{-1}$) of a one-dimensional transverse Ising chain with nearest neighbor ferromagentic interactions across the quantum critical point (QCP) and analyze the…
There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very…
We study hysteresis for a two-dimensional, spin-1/2, nearest-neighbor, kinetic Ising ferromagnet in an oscillating field, using Monte Carlo simulations and analytical theory. Attention is focused on small systems and weak field amplitudes…
We prove that Ising models on the hypercube with general quadratic interactions satisfy a Poincar\'{e} inequality with respect to the natural Dirichlet form corresponding to Glauber dynamics, as soon as the operator norm of the interaction…
Exponential random graph models have become increasingly important in the study of modern networks ranging from social networks, economic networks, to biological networks. They seek to capture a wide variety of common network tendencies…
Starting from any pseudo-Anosov map $\varphi$ on a surface of genus $g \geqslant 2$, we construct explicitly a family of Derived from pseudo-Anosov maps $f$ by adapting the construction of Smale's Derived from Anosov maps on the two-torus.…
The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One approach is using Markov chains. The best available current…
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…
The white noise approach to the investigation of the dynamics of a quantum particle interacting with a dilute and in general non-equilibrium gaseous environment in the low density limit is outlined. The low density limit is the kinetic…