The one-law for k-connectivity in inhomogeneous random key graphs with unreliable links
Statement
Let denote the intersection of an inhomogeneous random key graph and an Erdős–Rényi graph, with class probability distribution satisfying for , key-ring and key-pool scalings , and channel-probability scaling . Let be defined by the paper's scaling condition, and suppose , possibly with additional conditions. The one-law for k-connectivity. One should have
The zero-law follows from the minimum-degree result, whereas simulations suggest that the one-law for -connectivity occurs under the same critical scaling as the one-law for minimum degree. Establishing the asserted one-law requires the additional conditions left unspecified in the conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.