26,482 research outputs found
The mincut graph of a graph
In this paper we introduce an intersection graph of a graph , with vertex
set the minimum edge-cuts of . We find the minimum cut-set graphs of some
well-known families of graphs and show that every graph is a minimum cut-set
graph, henceforth called a \emph{mincut graph}. Furthermore, we show that
non-isomorphic graphs can have isomorphic mincut graphs and ask the question
whether there are sufficient conditions for two graphs to have isomorphic
mincut graphs. We introduce the -intersection number of a graph , the
smallest number of elements we need in in order to have a family of subsets, such that for each subset. Finally we
investigate the effect of certain graph operations on the mincut graphs of some
families of graphs
The 1/N expansion of colored tensor models
In this paper we perform the 1/N expansion of the colored three dimensional
Boulatov tensor model. As in matrix models, we obtain a systematic topological
expansion, with more and more complicated topologies suppressed by higher and
higher powers of N. We compute the first orders of the expansion and prove that
only graphs corresponding to three spheres S^3 contribute to the leading order
in the large N limit.Comment: typos corrected, references update
Decomposition and Oxidation of the N-Extended Supersymmetric Quantum Mechanics Multiplets
We furnish an algebraic understanding of the inequivalent connectivities
(computed up to ) of the graphs associated to the irreducible
supermultiplets of the N-extended Supersymmetric Quantum Mechanics. We prove
that the inequivalent connectivities of the N=5 and N=9 irreducible
supermultiplets are due to inequivalent decompositions into two sets of N=4
(respectively, N=8) supermultiplets. "Oxido-reduction" diagrams linking the
irreducible supermultiplets of the N=5,6,7,8 supersymmetries are presented. We
briefly discuss these results and their possible applications.Comment: 15 pages, 5 figure
The complete 1/N expansion of colored tensor models in arbitrary dimension
In this paper we generalize the results of [1,2] and derive the full 1/N
expansion of colored tensor models in arbitrary dimensions. We detail the
expansion for the independent identically distributed model and the topological
Boulatov Ooguri model
Continuum Line-of-Sight Percolation on Poisson-Voronoi Tessellations
In this work, we study a new model for continuum line-of-sight percolation in
a random environment driven by the Poisson-Voronoi tessellation in the
-dimensional Euclidean space. The edges (one-dimensional facets, or simply
1-facets) of this tessellation are the support of a Cox point process, while
the vertices (zero-dimensional facets or simply 0-facets) are the support of a
Bernoulli point process. Taking the superposition of these two processes,
two points of are linked by an edge if and only if they are sufficiently
close and located on the same edge (1-facet) of the supporting tessellation. We
study the percolation of the random graph arising from this construction and
prove that a 0-1 law, a subcritical phase as well as a supercritical phase
exist under general assumptions. Our proofs are based on a coarse-graining
argument with some notion of stabilization and asymptotic essential
connectedness to investigate continuum percolation for Cox point processes. We
also give numerical estimates of the critical parameters of the model in the
planar case, where our model is intended to represent telecommunications
networks in a random environment with obstructive conditions for signal
propagation.Comment: 30 pages, 4 figures. Accepted for publication in Advances in Applied
Probabilit
- …