Edge flows in the complete random-lengths network
نویسندگان
چکیده
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some random total flow. In the n→∞ limit we find explicitly the empirical distribution of these edge-flows, suitably normalized.
منابع مشابه
Uniform multicommodity flow in the hypercube with random edge capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge-capacities distributed like a random variable C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support sim...
متن کاملUniform multicommodity flows in the hypercube with random edge-capacities
We give two results for multicommodity flows in the d-dimensional hypercube Qd with independent random edge capacities distributed like C where P[C > 0] > 1/2. Firstly, with high probability as d → ∞, the network can support simultaneous multicommodity flows of volume close to E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicom...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملNew High Secure Network Steganography Method Based on Packet Length
In network steganography methods based on packet length, the length of the packets is used as a carrier for exchanging secret messages. Existing methods in this area are vulnerable against detections due to abnormal network traffic behaviors. The main goal of this paper is to propose a method which has great resistance to network traffic detections. In the first proposed method, the sender embe...
متن کاملNew Bounds for Edge-Cover by Random Walk
We show that the expected time for a random walk on a (multi-)graph G to traverse all m edges of G, and return to its starting point, is at most 2m; if each edge must be traversed in both directions, the bound is 3m. Both bounds are tight and may be applied to graphs with arbitrary edge lengths, with implications for Brownian motion on a finite or infinite network of total edge-length m.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 37 شماره
صفحات -
تاریخ انتشار 2010