Related papers: Factorization of the Partial Covariance in Singly-…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
Partial polarization is the manifestation of the correlation between two mutually orthogonal transverse field components associated with a light beam. We show both theoretically and experimentally that the origin of this correlation can be…
We present an analytically solvable random graph model in which the connections between the nodes can evolve in time, adiabatically slowly compared to the dynamics of the nodes. We apply the formalism to finite connectivity attractor neural…
The partial sum of the states of a Markov chain or more generally a Markov source is asymptotically normally distributed under suitable conditions. One of these conditions is that the variance is unbounded. A simple combinatorial…
Neural network design has utilized flexible nonlinear processes which can mimic biological systems, but has suffered from a lack of traceability in the resulting network. Graphical probabilistic models ground network design in probabilistic…
The Bar\'at-Thomassen conjecture asserts that there is a function $f$ such that for every fixed tree $T$ with $t$ edges, every graph which is $f(t)$-edge-connected with its number of edges divisible by $t$ has a partition of its edges into…
We make use of point transformations to introduce new canonical variables for systems defined on a finite interval and on the half-line so that new position variables should take all real values from $-\infty$ to $\infty$. The completeness…
The occurrence of Simpson's paradox (SP) in $2\times 2$ contingency tables has been well studied. The present work comprehensively revisits this problem using a combination of philosophical reflections, causal considerations, and…
Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is…
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of…
Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…
Directed acyclic graph models with hidden variables have been much studied, particularly in view of their computational efficiency and connection with causal methods. In this paper we provide the circumstances under which it is possible for…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Systems that are not smooth can undergo bifurcations that are forbidden in smooth systems. We review some of the phenomena that can occur for piecewise-smooth, continuous maps and flows when a fixed point or an equilibrium collides with a…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…