{"paper":{"title":"Transport Processes on Homogeneous Planar Graphs with Scale-Free Loops","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Bosiljka Tadic, Milovan Suvakov","submitted_at":"2006-05-18T09:35:09Z","abstract_excerpt":"We consider the role of network geometry in two types of diffusion processes: transport of constant-density information packets with queuing on nodes, and constant voltage-driven tunneling of electrons. The underlying network is a homogeneous graph with scale-free distribution of loops, which is constrained to a planar geometry and fixed node connectivity $k=3$. We determine properties of noise, flow and return-times statistics for both processes on this graph and relate the observed differences to the microscopic process details. Our main findings are: (i) Through the local interaction betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0605452","kind":"arxiv","version":1},"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"}