2000 character limit reached
Network connectivity through small openings
Published 12 Apr 2013 in cond-mat.dis-nn, cs.IT, and math.IT | (1304.3646v1)
Abstract: Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening, rendering the domain essentially non-convex. Our analytic approach can go only so far as we encounter what is referred to in statistical physics as quenched disorder making the problem non-trivial. We confirm our theory through computer simulations, obtain leading order approximations and discuss possible extensions and applications.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.