Related papers: Uniqueness of Markov random fields with higher-ord…
We study a class of Markovian systems of $N$ elements taking values in $[0,1]$ that evolve in discrete time $t$ via randomized replacement rules based on the ranks of the elements. These rank-driven processes are inspired by variants of the…
We present new scalar and matrix Chernoff-style concentration bounds for a broad class of probability distributions over the binary hypercube $\{0,1\}^n$. Motivated by recent tools developed for the study of mixing times of Markov chains on…
We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…
This work focuses on a class of functional stochastic Hamiltonian systems with singular coefficients and state-dependent switching, in which the switching process has a countably infinite state space. First, by Girsanov's transformation, we…
A K\"onig-Egerv\'ary graph is a graph $G$ satisfying $\alpha(G)+\mu(G)=|V(G)|$, where $\alpha(G)$ is the cardinality of a maximum independent set and $\mu(G)$ is the matching number of $G$. Such graphs are those that admit a matching…
We consider a non-uniquely ergodic dynamical system given by a $\mathbb{Z}^{l}$-action (or $(\N\cup\{0\})^l$-action) $\tau$ on a non-empty compact metrisable space $\Omega$, for some $l\in\N$. Let (D) denote the following property: The…
We consider two types of matroids defined on the edge set of a graph $G$: count matroids ${\cal M}_{k,\ell}(G)$, in which independence is defined by a sparsity count involving the parameters $k$ and $\ell$, and the (three-dimensional…
We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…
We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…
Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…
Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models. In this paper we unify these Markov properties by introducing a class…
A graph $G=(V,E)$ is $\gamma$-excellent if $V$ is a union of all $\gamma$-sets of $G$, where $\gamma$ stands for the domination number. Let $\mathcal{I}$ be a set of all mutually nonisomorphic graphs and $\emptyset \not= \mathcal{H}…
The dynamics of a Markov process are often specified by its infinitesimal generator or, equivalently, its symbol. This paper contains examples of analytic symbols which do not determine the law of the corresponding Markov process uniquely.…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…
A uniqueness theorem is established for autonomous systems of ODEs, $\dot{x}=f(x)$, where $f$ is a Sobolev vector field with additional geometric structure, such as delta-monoticity or reduced quasiconformality. Specifically, through every…
We consider a stochastic electroconvection model describing the nonlinear evolution of a surface charge density in a two-dimensional fluid with additive stochastic forcing. We prove the existence and uniqueness of solutions, we define the…
Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space $\mathscr{H}_{E}$ of a prescribed infinite (or finite)…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
The classical Aronszajn-Donoghue theorem states that for a rank one perturbation of a self-adjoint operator (by a cyclic vector) the singular parts of the spectral measures of the original and perturbed operators are mutually singular. As…