Related papers: Uniqueness of Markov random fields with higher-ord…
We introduce the scaling function associated to a graph directed Markov system, and show that it is a H\"{o}lder continuous function of the dual symbolic Cantor set. With some natural separation and regularity conditions, each such system…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
Let $k$ be a perfect field of characteristic $p$. Associated to any (1-dimensional, commutative) formal group law of finite height $n$ over $k$ there is a complex oriented cohomology theory represented by a spectrum denoted $E(n)$ and…
Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…
In this work, we investigate the spectrum of singularities of random stable trees with parameter $\gamma\in(1,2)$. We consider for that purpose the scaling exponents derived from two natural measures on stable trees: the local time $\ell^a$…
We consider the stochastic differential equations of the form \begin{equation*} \begin{cases} dX^ x(t) = \sigma(X(t-)) dL(t) \\ X^ x(0)=x,\quad x\in\mathbb{R}^ d, \end{cases} \end{equation*} where $\sigma:\mathbb{R}^ d\to \mathbb{R}^ d$ is…
This paper studies the local structure of continuous random fields on $\mathbb R^d$ taking values in a complete separable linear metric space ${\mathbb V}$. Extending seminal work of Falconer, we show that the generalized $(1+k)$-th order…
Given a family of hypergraphs $\mathcal{H}$, we say that a hypergraph $\Gamma$ is $\mathcal{H}$-universal if it contains every $H \in \mathcal{H}$ as a subgraph. For $D, r \in \mathbb{N}$, we construct an $r$-uniform hypergraph with…
We initiate the study of counting Markov Equivalence Classes (MEC) under logical constraints. MECs are equivalence classes of Directed Acyclic Graphs (DAGs) that encode the same conditional independence structure among the random variables…
The main goal of this paper is to build a measurable analogue to the theory of weighted networks on infinite graphs. Our basic setting is an infinite $\sigma$-finite measure space $(V, \mathcal B, \mu)$ and a symmetric measure $\rho$ on…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
We say a representation V of a group G has stability if its multiplicities m^{G}_{V}(\lambda) is dependent only on some equivalence class of \lambda for a sufficiently large parameter \lambda. In this paper, we prove that the restriction of…
Let $K$ be a finite extension of $\mathbb{Q}_p$ that is totally ramified over $\mathbb{Q}_p$. The set $\mathcal{M}\mathcal{F}(K)$ consists of power series in $1+zK[[z]]$ that are solutions of differential operators in $K(z)[d/dz]$ equipped…
We study algebraic properties of partition functions, particularly the location of zeros, through the lens of rapidly mixing Markov chains. The classical Lee-Yang program initiated the study of phase transitions via locating complex zeros…
The present contribution derives an explicit expression for (a version of) every uni- and multi-variate conditional distribution (i.e., Markov kernel) of Archimedean copulas and uses this representation to generalize a recently established…
We show that any stochastically monotone Feller semigroup on R can be extended by a consistent family of order-preserving Feller semigroups on the successive powers of R. We exhibit a specific such family, which is uniquely characterized by…
Classical graphical modeling of multivariate random vectors uses graphs to encode conditional independence. In graphical modeling of multivariate stochastic processes, graphs may encode so-called local independence analogously. If some…
Liverani-Saussol-Vaienti (L-S-V) maps form a family of piecewise differentiable dynamical systems on $[0,1]$ depending on one parameter $\omega\in\mathbb R^+$. These maps are everywhere expanding apart from a neutral fixed point. It is well…
$ $Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators $d(\Gamma)$ of a lattice $\Gamma$ in a high rank simple Lie group $H$ grows sub-linearly with $v = \mu(H / \Gamma)$, the co-volume of $\Gamma$ in $H$. We prove…