English
Related papers

Related papers: Faithfulness in Chain Graphs: The Gaussian Case

200 papers

Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf{GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from…

Logic · Mathematics 2023-02-24 Mohammad Golshani , Reihane Zoghifard

Let $G$ be a graph, and $g,f:V(G)\rightarrow Z^{+}$ with $g(x)\leq f(x)$ for each $x\in V(G)$. We say that $G$ admits all fractional $(g,f)$-factors if $G$ contains a fractional $r$-factor for every $r:V(G)\rightarrow Z^{+}$ with $g(x)\leq…

Combinatorics · Mathematics 2019-07-23 Sizhong Zhou

Let $\gamma'_s(G)$ be the signed edge domination number of G. In 2006, Xu conjectured that: for any $2$-connected graph G of order $ n (n \geq 2),$ $\gamma'_s(G)\geq 1$. In this article we show that this conjecture is not true. More…

Discrete Mathematics · Computer Science 2010-08-20 Saeed Akbari , Sadegh Bolouki , Pooya Hatami , Milad Siami

Linearized gravity is considered as an ordinary gauge field theory. This implies the need for gauge fixing in order to have well defined propagators. Only after having achieved this, the most general mass term is added. The aim of this…

High Energy Physics - Theory · Physics 2017-10-25 Alberto Blasi , Nicola Maggiore

Given a simple graph $G$, the artinian monomial algebra associated to $G$, denoted by $A(G)$, is defined by the edge ideal of $G$ and the squares of the variables. In this article, we classify some tadpole graphs $G$ for which $A(G)$ has or…

Commutative Algebra · Mathematics 2024-12-12 Phan Minh Hung , Nguyen Duy Phuoc , Tran Nguyen Thanh Son

A growing family of random graphs is called robust if it retains a giant component after percolation with arbitrary positive retention probability. We study robustness for graphs, in which new vertices are given a spatial position on the…

Probability · Mathematics 2015-04-08 Emmanuel Jacob , Peter Morters

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted by $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ attributing distinct weighted degrees:…

Combinatorics · Mathematics 2021-09-30 Jakub Przybyło , Fan Wei

This paper studies large sample properties of a Bayesian approach to inference about slope parameters $\gamma$ in linear regression models with a structural break. In contrast to the conventional approach to inference about $\gamma$ that…

Econometrics · Economics 2023-08-15 Kenichi Shimizu

Let $\xi : \Omega \times \mathbb{R}^n \to \mathbb{R}$ be zero mean, mean-square continuous, stationary, Gaussian random field with covariance function $r(x) = \mathbb{E}[\xi(0)\xi(x)]$ and let $G : \mathbb{R} \to \mathbb{R}$ such that $G$…

Probability · Mathematics 2019-02-14 David Nualart , Abhishek Tilva

An independent random cascade measure is specified by a random generator, a vector of dimension c with non-negative components. The dimension c is called the branching cascade parameter. It is shown under certain restrictions that, if this…

Probability · Mathematics 2016-09-07 G. Molchan

A non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. The toughness $\tau(G)$ of the graph $G$ is the maximum value of $t$ such that $G$…

Combinatorics · Mathematics 2024-12-18 Kun Cheng , Chengli Li , Feng Liu

We show that any distribution function on $\mathbb{R}^d$ with nonnegative, nonzero and integrable marginal distributions can be characterized by a norm on $\mathbb{R}^{d+1}$, called $F$-norm. We characterize the set of $F$-norms and prove…

Probability · Mathematics 2018-08-27 Michael Falk , Gilles Stupfler

We prove that every flat chain with finite mass in $\mathbb{R}^d$ with coefficients in a normed abelian group $G$ is the restriction of a normal $G$-current to a Borel set. We deduce a characterization of real flat chains with finite mass…

Classical Analysis and ODEs · Mathematics 2023-11-13 Giovanni Alberti , Andrea Marchese

We show the existence of Lebesgue-equivalent conservative and ergodic $\sigma$-finite invariant measures for a wide class of one-dimensional random maps consisting of piecewise convex maps. We also estimate the size of invariant measures…

Dynamical Systems · Mathematics 2023-03-21 Tomoki Inoue , Hisayoshi Toyokawa

A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…

Combinatorics · Mathematics 2014-10-22 Wei Wang

A causal model is an abstract representation of a physical system as a directed acyclic graph (DAG), where the statistical dependencies are encoded using a graphical criterion called `d-separation'. Recent work by Wood & Spekkens shows that…

Quantum Physics · Physics 2015-08-10 Jacques Pienaar , Caslav Brukner

We examine Fourier frames and, more generally, frame measures for different probability measures. We prove that if a measure has an associated frame measure, then it must have a certain uniformity in the sense that the weight is distributed…

Functional Analysis · Mathematics 2021-07-20 Dorin Ervin Dutkay , Chun-Kit Lai

A classical theorem of Lusin states that all analytic sets are Lebesgue-measurable. In this article we established the reverse mathematical strength of Lusin's theorem, which depends on how precisely it is formalized. By doing so, we answer…

Logic · Mathematics 2026-03-25 Juan P. Aguilera , Thibaut Kouptchinsky , Keita Yokoyama

We introduce a deductive statistical mechanics approach for granular materials which is formally built from few realistic physical assumptions. The main finding is an universal behavior for the distribution of the density fluctuations. Such…

Soft Condensed Matter · Physics 2008-06-25 T. Aste , T. Di Matteo

A crucial assumption in most statistical learning theory is that samples are independently and identically distributed (i.i.d.). However, for many real applications, the i.i.d. assumption does not hold. We consider learning problems in…

Machine Learning · Computer Science 2019-09-10 Rui Ray Zhang , Xingwu Liu , Yuyi Wang , Liwei Wang