Related papers: Weak Dominance Drawings and Linear Extension Diame…

We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.

In this dissertation we study basic local differential geometry, projective differential geometry, and prolongations of overdetermined geometric partial differential equations. It is simple to prolong an n-th order linear ordinary…

We present a graphical approach to deriving inequality constraints for directed acyclic graph (DAG) models, where some variables are unobserved. In particular we show that the observed distribution of a discrete model is always restricted…

Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform…

We provide a complete proof of the diagrammatic bounds on the lace-expansion coefficients for oriented percolation, which are used in [arXiv:math/0703455] to investigate critical behavior for long-range oriented percolation above…

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

We study a variant of intersection representations with unit balls, that is, unit disks in the plane and unit intervals on the line. Given a planar graph and a bipartition of the edges of the graph into near and far sets, the goal is to…

This paper is devoted to the study of weak and strong convergence of derivations, and of the flows associated to them, when dealing with a sequence of metric measure structures (X,d,m_n), m_n weakly convergent to m. In particular, under…

We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…

We present a nonlinear model of weakly curved rod, namely the type of curved rod where the curvature is of the order of the diameter of the cross-section. We use the approach analogous to the one for rods and curved rods and start from the…

We develop a general framework on Dirichlet spaces to prove a weak form of the Bakry-\'Emery estimate and study its consequences. This estimate may be satisfied in situations, like metric graphs, where generalized notions of Ricci curvature…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or edges. They constitute models for real applications, such…

We study a new kind of proximity graphs called proportional-edge proximity catch digraphs (PCDs)in a randomized setting. PCDs are a special kind of random catch digraphs that have been developed recently and have applications in statistical…

The average-case complexity of a branch-and-bound algorithms for Minimum Dominating Set problem in random graphs in the G(n,p) model is studied. We identify phase transitions between subexponential and exponential average-case complexities,…

We propose a theoretical approach to derive amplitude equations governing the weakly nonlinear evolution of nonnormal dynamical systems when they experience transient growth or respond to harmonic forcing. This approach reconciles the…

We consider control-constrained linear-quadratic optimal control problems on evolving surfaces. In order to formulate well-posed problems, we prove existence and uniqueness of weak solutions for the state equation, in the sense of…

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find degree distribution polynomials for weak equivalence of some graphs including 1) circulant graphs…

We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…