6,723 research outputs found
Algorithms to measure diversity and clustering in social networks through dot product graphs.
Social networks are often analyzed through a graph model of the network. The dot product model assumes that two individuals are connected in the social network if their attributes or opinions are similar. In the model, a d-dimensional vector a v represents the extent to which individual v has each of a set of d attributes or opinions. Then two individuals u and v are assumed to be friends, that is, they are connected in the graph model, if and only if a u · a v  ≥ t, for some fixed, positive threshold t. The resulting graph is called a d-dot product graph..
We consider two measures for diversity and clustering in social networks by using a d-dot product graph model for the network. Diversity is measured through the size of the largest independent set of the graph, and clustering is measured through the size of the largest clique. We obtain a tight result for the diversity problem, namely that it is polynomial-time solvable for d = 2, but NP-complete for d ≥ 3. We show that the clustering problem is polynomial-time solvable for d = 2. To our knowledge, these results are also the first on the computational complexity of combinatorial optimization problems on dot product graphs.
We also consider the situation when two individuals are connected if their preferences are not opposite. This leads to a variant of the standard dot product graph model by taking the threshold t to be zero. We prove in this case that the diversity problem is polynomial-time solvable for any fixed d
A Diagrammatic Temperley-Lieb Categorification
The monoidal category of Soergel bimodules categorifies the Hecke algebra of
a finite Weyl group. In the case of the symmetric group, morphisms in this
category can be drawn as graphs in the plane. We define a quotient category,
also given in terms of planar graphs, which categorifies the Temperley-Lieb
algebra. Certain ideals appearing in this quotient are related both to the
1-skeleton of the Coxeter complex and to the topology of 2D cobordisms. We
demonstrate how further subquotients of this category will categorify the cell
modules of the Temperley-Lieb algebra.Comment: long awaited update to published versio
Normal Factor Graphs and Holographic Transformations
This paper stands at the intersection of two distinct lines of research. One
line is "holographic algorithms," a powerful approach introduced by Valiant for
solving various counting problems in computer science; the other is "normal
factor graphs," an elegant framework proposed by Forney for representing codes
defined on graphs. We introduce the notion of holographic transformations for
normal factor graphs, and establish a very general theorem, called the
generalized Holant theorem, which relates a normal factor graph to its
holographic transformation. We show that the generalized Holant theorem on the
one hand underlies the principle of holographic algorithms, and on the other
hand reduces to a general duality theorem for normal factor graphs, a special
case of which was first proved by Forney. In the course of our development, we
formalize a new semantics for normal factor graphs, which highlights various
linear algebraic properties that potentially enable the use of normal factor
graphs as a linear algebraic tool.Comment: To appear IEEE Trans. Inform. Theor
Supersymmetric Regularization, Two-Loop QCD Amplitudes and Coupling Shifts
We present a definition of the four-dimensional helicity (FDH) regularization
scheme valid for two or more loops. This scheme was previously defined and
utilized at one loop. It amounts to a variation on the standard 't
Hooft-Veltman scheme and is designed to be compatible with the use of helicity
states for "observed" particles. It is similar to dimensional reduction in that
it maintains an equal number of bosonic and fermionic states, as required for
preserving supersymmetry. Supersymmetry Ward identities relate different
helicity amplitudes in supersymmetric theories. As a check that the FDH scheme
preserves supersymmetry, at least through two loops, we explicitly verify a
number of these identities for gluon-gluon scattering (gg to gg) in
supersymmetric QCD. These results also cross-check recent non-trivial two-loop
calculations in ordinary QCD. Finally, we compute the two-loop shift between
the FDH coupling and the standard MS-bar coupling, alpha_s. The FDH shift is
identical to the one for dimensional reduction. The two-loop coupling shifts
are then used to obtain the three-loop QCD beta function in the FDH and
dimensional reduction schemes.Comment: 44 pages, minor corrections and clarifications include
sl(3) link homology
We define a bigraded homology theory whose Euler characteristic is the
quantum sl(3) link invariant.Comment: Published by Algebraic and Geometric Topology at
http://www.maths.warwick.ac.uk/agt/AGTVol4/agt-4-45.abs.htm
Realizations of self branched coverings of the 2-sphere
For a degree d self branched covering of the 2-sphere, a notable
combinatorial invariant is an integer partition of 2d -- 2, consisting of the
multiplicities of the critical points. A finer invariant is the so called
Hurwitz passport. The realization problem of Hurwitz passports remain largely
open till today. In this article, we introduce two different types of finer
invariants: a bipartite map and an incident matrix. We then settle completely
their realization problem by showing that a map, or a matrix, is realized by a
branched covering if and only if it satisfies a certain balanced condition. A
variant of the bipartite map approach was initiated by W. Thurston. Our results
shed some new lights to the Hurwitz passport problem
Box representations of embedded graphs
A -box is the cartesian product of intervals of and a
-box representation of a graph is a representation of as the
intersection graph of a set of -boxes in . It was proved by
Thomassen in 1986 that every planar graph has a 3-box representation. In this
paper we prove that every graph embedded in a fixed orientable surface, without
short non-contractible cycles, has a 5-box representation. This directly
implies that there is a function , such that in every graph of genus , a
set of at most vertices can be removed so that the resulting graph has a
5-box representation. We show that such a function can be made linear in
. Finally, we prove that for any proper minor-closed class ,
there is a constant such that every graph of
without cycles of length less than has a 3-box representation,
which is best possible.Comment: 16 pages, 6 figures - revised versio
- …