Related papers: An approach to non-equilibrium Markov chains throu…
For networks of coupled dynamical systems we characterize admissible functions, that is, functions whose gradient is an admissible vector field. The schematic representation of a gradient network dynamical system is of an undirected cell…
The first aim of this paper is to introduce a class of Markov chains on $\mathbb{Z}_+$ which are discrete self-similar in the sense that their semigroups satisfy an invariance property expressed in terms of a discrete random dilation…
In probability theory, equalities are much less than inequalities. In this paper, we find a series of equalities which characterize the symmetry of the forming times of a family of similar cycles for discrete-time and continuous-time Markov…
Imprecise continuous-time Markov chains are a robust type of continuous-time Markov chains that allow for partially specified time-dependent parameters. Computing inferences for them requires the solution of a non-linear differential…
We study the magnetic phases of a non-equilibrium spin chain, where coherent interactions between neighboring lattice sites compete with alternating gain and loss processes. This competition between coherent and incoherent dynamics induces…
We develop the theory linking 'E-separation' in directed mixed graphs (DMGs) with conditional independence relations among coordinate processes in stochastic differential equations (SDEs), where causal relationships are determined by "which…
Generalizing response theory of open systems far from equilibrium is a central quest of nonequilibrium statistical physics. Using stochastic thermodynamics, we develop an algebraic method to study the response of nonequilibrium steady state…
Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to…
Questions are posed regarding the influence that the column sums of the transition probabilities of a stochastic matrix (with row sums all one) have on the stationary distribution, the mean first passage times and the Kemeny constant of the…
The number of non-negative integer matrices with given row and column sums appears in a variety of problems in mathematics and statistics but no closed-form expression for it is known, so we rely on approximations of various kinds. Here we…
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…
We study 1-Wasserstein propagation of chaos for "McKean-type" nonlinear Markov chains and their associated interacting particle systems. This paper is organized into two parts: the first part combines arguments from various areas of…
In this review we discuss the relationship between random matrix theories and symmetric spaces. We show that the integration manifolds of random matrix theories, the eigenvalue distribution, and the Dyson and boundary indices characterizing…
Nonequilibrium phase transitions are discussed with emphasis on general features such as the role of detailed balance violation in generating effective (long-range) interactions, the importance of dynamical anisotropies, the connection…
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…
We extend Andersson-Madigan-Perlman chain graphs by (i) relaxing the semidirected acyclity constraint so that only directed cycles are forbidden, and (ii) allowing up to two edges between any pair of nodes. We introduce global, and ordered…
A synchrony subspace of R^n is defined by setting certain components of the vectors equal according to an equivalence relation. Synchrony subspaces invariant under a given set of square matrices form a lattice. Applications of these…
In these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the $L^p$ space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of…
Markov chain Monte Carlo algorithms are invaluable tools for exploring stationary properties of physical systems, especially in situations where direct sampling is unfeasible. Common implementations of Monte Carlo algorithms employ…
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit…