Results 51 to 60 of about 165,985,528 (155)
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Couceiro M, Duffus D.
europepmc +1 more source
Majority Dynamics on Finite Trees
ABSTRACT For an arbitrary finite tree T$$ T $$, we find the exact value of the worst‐case stabilization time of majority dynamics on T$$ T $$. We also prove that for a perfect rooted cubic tree T$$ T $$ with diameter D$$ D $$ and uniformly random initial opinions, the dynamics stabilizes in time τ∈(D/4,D/3)$$ \tau \in \left(D/4,D/3\right) $$ with high ...
Itai Benjamini +2 more
wiley +1 more source
On the Threshold for Triangulations Inside Convex Polygons
ABSTRACT Start with a large convex polygon and add all other edges inside independently with probability p$$ p $$. At what critical threshold pc$$ {p}_c $$ do triangulations of the polygon begin to appear? The first author and Gravner asked this question and observed that pc=Θ(1)$$ {p}_c=\Theta (1) $$, using the relationship with the Catalan numbers ...
Brett Kolesnik +2 more
wiley +1 more source
Approximate Itai–Zehavi Conjecture for Random Graphs
ABSTRACT A famous conjecture by Itai and Zehavi states that, for every d$$ d $$‐vertex‐connected graph G$$ G $$ and every vertex r$$ r $$ in G$$ G $$, there are d$$ d $$ spanning trees of G$$ G $$ such that, for every vertex v$$ v $$ in G∖{r}$$ G\setminus \left\{r\right\} $$, the paths between r$$ r $$ and v$$ v $$ in different trees are internally ...
Lawrence Hollom +4 more
wiley +1 more source
Connectivity of Inhomogeneous Random Graphs II
ABSTRACT Each graphon W:Ω2→[0,1]$$ W:{\Omega}^2\to \left[0,1\right] $$ yields an inhomogeneous random graph model 𝔾(n,W). We show that 𝔾(n,W) is asymptotically almost surely connected if and only if (i) W$$ W $$ is a connected graphon and (ii) the measure of elements of Ω$$ \Omega $$ of W$$ W $$‐degree less than α$$ \alpha $$ is o(α)$$ o\left(\alpha ...
Jan Hladký, Gopal Viswanathan
wiley +1 more source
The Symmetric Sugeno Integral [PDF]
We propose an extension of the Sugeno integral for negative numbers, in the spirit of the symmetric extension of Choquet integral, also called \Sipos\ integral.
Michel Grabisch
core
Correlation in partially ordered sets [PDF]
Correlation in partially ordered sets is a very active research area. In this paper we review basic results for correlation within ordered sets that focus on distributive lattices, systems of subsets ordered by proper inclusion, and the family of linear ...
Fishburn, Peter C.
core +1 more source
ABSTRACT This paper explores the limits of mission‐directed entrepreneurial states by drawing on the theory of recombinant innovation and F.A. Hayek's insights on the spontaneous growth of knowledge in society. First, the use of discretionary policymaking curtails the range of knowledge generated in the process of social interaction, limiting the scope
Bryan Cheang, Praharsh Mehrotra
wiley +1 more source
Fast and robust estimation of the multivariate errors in variables model. [PDF]
In the multivariate errors in variable models one wishes to retrieve a linear relationship of the form y = ß x + a, where both x and y can be multivariate. The variables y and x are not directly measurable, but observed with measurement error.
Croux, Christophe +2 more
core

