English
Related papers

Related papers: Randomly switched vector fields sharing a zero on …

200 papers

Markov random fields are known to be fully characterized by properties of their information diagrams, or I-diagrams. In particular, for Markov random fields, regions in the I-diagram corresponding to disconnected vertex sets in the graph…

Information Theory · Computer Science 2026-03-25 Leon Lang , Clélia de Mulatier , Rick Quax , Patrick Forré

Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…

Combinatorics · Mathematics 2021-07-28 Colin Cooper , Martin Dyer , Catherine Greenhill

The transition law of every exchangeable Feller process on the space of countable graphs is determined by a $\sigma$-finite measure on the space of $\{0,1\}\times\{0,1\}$-valued arrays. In discrete-time, this characterization amounts to a…

Probability · Mathematics 2015-09-23 Harry Crane

We study Markov processes in which $\pm 1$-valued random variables $\sigma_x(t), x\in \mathbb{Z}^d$, update by taking the value of a majority of their nearest neighbors or else tossing a fair coin in case of a tie. In the presence of a…

Probability · Mathematics 2015-06-23 Michael Damron , Sinziana M. Eckner , Hana Kogan , Charles M. Newman , Vladas Sidoravicius

We study the asymptotic behaviour of Markov processes on large weighted Erdos-Renyi graphs where the transition rates of the vertices are only influenced by the state of their neighbours and the corresponding weight on the edges. We find…

Probability · Mathematics 2020-04-07 Daniel Keliger , Illes Horvath

In this paper, we study consistent and partially exchangeable sequences of Markov chains on a finite state space. We provide a characterisation of the admissible transition rates via a decomposition into individual and coordinated motion of…

We study random dynamical systems generated by volume-preserving piecewise $C^{1}$ maps. For this class of systems, we establish an invariance principle stating that if all Lyapunov exponents vanish, then there exists a measurable family of…

Dynamical Systems · Mathematics 2026-01-21 Gianluigi Del Magno , João Lopes Dias , José Pedro Gaivão

We study a class of Piecewise Deterministic Markov Processes with state space Rd x E where E is a finite set. The continuous component evolves according to a smooth vector field that is switched at the jump times of the discrete coordinate.…

Probability · Mathematics 2014-04-08 Michel Benaïm , Stéphane Le Borgne , Florent Malrieu , Pierre-André Zitt

We show that stochastic processes with linear conditional expectations and quadratic conditional variances are Markov, and their transition probabilities are related to a three-parameter family of orthogonal polynomials which generalize the…

Probability · Mathematics 2007-05-23 Wlodzimierz Bryc , Jacek Wesolowski

Consider a non-autonomous continuous-time linear system in which the time-dependent matrix determining the dynamics is piecewise constant and takes finitely many values $A_1, \dotsc, A_N$. This paper studies the equality cases between the…

Optimization and Control · Mathematics 2023-03-21 Yacine Chitour , Guilherme Mazanti , Pierre Monmarché , Mario Sigalotti

On the framework of the Linear Farmer's Model, we approach the indeterminacy of agents' behaviour by associating with each agent an unconditional probability for her to be active at each time step. We show that Pareto tailed returns can…

Statistical Mechanics · Physics 2008-12-02 Rui Carvalho

We find the class, ${\cal{C}}_k, k \ge 0$, of all zero mean stationary Gaussian processes, $Y(t), ~t \in \reals$ with $k$ derivatives, for which \begin{equation} Z(t) \equiv (Y^{(0)}(t), Y^{(1)}(t), \ldots, Y^{(k)}(t) ), ~ t \ge 0…

Probability · Mathematics 2014-01-03 Larry Brown , Philip Ernst , Larry Shepp , Bob Wolpert

We present an investigation of stochastic evolution in which a family of evolution equations in $L^1$ are driven by continuous-time Markov processes. These are examples of so-called piecewise deterministic Markov processes (PDMP's) on the…

Probability · Mathematics 2020-12-01 Paweł Klimasara , Michael C. Mackey , Andrzej Tomski , Marta Tyran-Kamińska

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 are concerned with the absolute continuity of stationary distributions corresponding to some piecewise deterministic Markov process, being typically encountered in biological models. The process under investigation involves a…

Probability · Mathematics 2024-03-26 Dawid Czapla , Katarzyna Horbacz , Hanna Wojewódka-Ściążko

We analyze the convergence rates for a family of auto-regressive Markov chains $(X^{(n)}_k)_{k\geq 0}$ on $\mathbb R^d$, where at each step a randomly chosen coordinate is replaced by a noisy damped weighted average of the others. The…

Probability · Mathematics 2023-01-10 Balázs Gerencsér , Andrea Ottolini

We prove a complete class theorem that characterizes \emph{all} stationary time reversible Markov processes whose finite dimensional marginal distributions (of all orders) are infinitely divisible. Aside from two degenerate cases (iid and…

Probability · Mathematics 2021-06-01 Robert L Wolpert , Lawrence D. Brown

Determinantal point processes (DPPs) are probabilistic models for repulsion. When used to represent the occurrence of random subsets of a finite base set, DPPs allow to model global negative associations in a mathematically elegant and…

Statistics Theory · Mathematics 2019-01-29 Kayvan Sadeghi , Alessandro Rinaldo

We propose a new Bayesian Markov switching regression model for multidimensional arrays (tensors) of binary time series. We assume a zero-inflated logit regression with time-varying parameters and apply it to multilayer temporal networks.…

Methodology · Statistics 2019-07-05 Monica Billio , Roberto Casarin , Matteo Iacopini

Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move:…

Probability · Mathematics 2024-10-09 Joel Brewster Lewis , Mehr Rai