Related papers: Stable Independence in Perfect Maps
Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic autonomous biologic entities. The…
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is…
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…
Z-mapping graph is a balanced bipartite graph $G$ of a digraph $D$ by split each vertex of $D$ into a pair of vertices of $G$. Based on the property of the $G$, it is proved that if $D$ is strong connected and $G$ is Hamiltonian, then $D$…
In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…
We consider testing marginal independence versus conditional independence in a trivariate Gaussian setting. The two models are non-nested and their intersection is a union of two marginal independences. We consider two sequences of such…
We consider the problem of testing independence in mixed-type data that combine count variables with positive, absolutely continuous variables. We first introduce two distinct classes of test statistics in the bivariate setting, designed to…
Testing two potentially multivariate variables for statistical dependence on the basis finite samples is a fundamental statistical challenge. Here we explore a family of tests that adapt to the complexity of the relationship between the…
We study a general mass transport model on an arbitrary graph consisting of $L$ nodes each carrying a continuous mass. The graph also has a set of directed links between pairs of nodes through which a stochastic portion of mass, chosen from…
We consider a discrete-time dynamical system in a car-following context. The system was recently introduced to parsimoniously model human driving behavior based on utility maximization. The parameters of the model were calibrated using…
The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total…
A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high…
We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…
Finite-state models of control systems were proposed by several researchers as a convenient mechanism to synthesize controllers enforcing complex specifications. Most techniques for the construction of such symbolic models have two main…
We study the (in)dependence of additivity and homogeneity conditions in the definition of linear mappings between vector spaces over the same scalar field. Unlike other works on the subject, dealing with particular fields like real or…
Motivated by recent physics papers describing rules for natural network formation, we study an elliptic-parabolic system of partial differential equations proposed by Hu and Cai. The model describes the pressure field thanks to Darcy's type…
We initiate the study of property testing problems concerning relations between permutations. In such problems, the input is a tuple $(\sigma_1,\dotsc,\sigma_d)$ of permutations on $\{1,\dotsc,n\}$, and one wishes to determine whether this…
Rank correlations have found many innovative applications in the last decade. In particular, suitable rank correlations have been used for consistent tests of independence between pairs of random variables. Using ranks is especially…
In graph theory, an independent set is a subset of nodes where there are no two adjacent nodes. The independent set is maximal if no node outside the independent set can join it. In network applications, maximal independent sets can be used…
In this paper we revisit a class of optimal transport problems associated to non-autonomous linear control systems. Building on properties of the cost functions on $\mathbb{R}^{d}\times\mathbb{R}^{d}$ derived from suitable variational…