{"paper":{"title":"Giant components in directed multiplex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"J. F. F. Mendes, N. Azimi-Tafreshi, S. N. Dorogovtsev","submitted_at":"2014-07-17T10:27:48Z","abstract_excerpt":"We describe the complex global structure of giant components in directed multiplex networks which generalizes the well-known bow-tie structure, generic for ordinary directed networks. By definition, a directed multiplex network contains vertices of one type and directed edges of $m$ different types. In directed multiplex networks, we distinguish a set of different giant components based on the existence of directed paths of different types between their vertices, such that for each type of edges, the paths run entirely through only edges of that type. If, in particular, $m=2$, we define a stro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4623","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}