Let G be an infinite graph such that each tree in the wired uniform spanning forest on G has one end almost surely. On such graphs G, we give a family of continuous, measure preserving, almost one-to-one mappings from the...
The ability of small-cell wireless networks to self-organize is crucial for improving capacity and performance in modern communication networks. This paper considers one of the most basic questions: what is the expected...
Let G be an infinite graph such that each tree in the wired uniform spanning forest on G has one end almost surely. On such graphs G, we give a family of continuous, measure preserving, almost one-to-one mappings from the...
The ability of small-cell wireless networks to self-organize is crucial for improving capacity and performance in modern communication networks. This paper considers one of the most basic questions: what is the expected...
We study the following sequential assignment problem on a finite graph G = (V ,E). Each edge e ∈ E starts with an integer value n e ≥ 0, and we write n =∑ e∈En e. At time t, 1 ≤ t ≤ n, a...
We study the following sequential assignment problem on a finite graph G = (V ,E). Each edge e ∈ E starts with an integer value n e ≥ 0, and we write n =∑ e∈En e. At time t, 1 ≤ t ≤ n, a...
The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with...
The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with...
|< |
< |
1 |