10769698
Regular subgraphs of random graphs
In this paper, we prove that there exists a function ρk = (4 + o(1))k such that G(n, ρ/n) contains a k-regular graph with high probability whenever ρ > ρk. In the case of k = 3, it is also shown that G(n, ρ/n) contains a 3-regular graph with high probability whenever ρ > λ ≈ 5.1494. These are the first constant bounds on the average degree in G(n, p) for the existence of a k-regular subgraph. We also discuss the appearance of 3-regular subgraphs in cores of random graphs.
2320085
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [9] and prove that it produces an asymptotically uniform random regular graph in a polynomial time. Precisely, for fixed d and n with d=O(n1/3-ε), it is shown that the algorithm generates an asymptotically uniform random d-regular graph on n vertices in time O(nd2). This confirms a conjecture of Wormald. The key ingredient in the proof is a recently developed concentration inequality by the second author.Besides being perhaps the only algorithm which works for relatively large d in practical time, our result also has a significant theoretical value, as it can be used to derive many properties of uniform random regular graphs.
6225887
Hamiltonian decompositions of random bipartite regular graphs
We prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Hamilton cycles, conditioned on forming no multiple edges. The proof uses the small subgraph conditioning method to establish contiguity, while the differential equation method is used to analyse a critical quantity.
18028546
Divide and conquer martingales and the number of triangles in a random graph
The goal of this paper is to present a novel application of a recent and useful martingale inequality. As an illustration, we prove an essentially sharp bound for the probability that a random graph contains significantly more triangles than expected.
11005224
A phase transition for avoiding a giant component
Let c be a constant and (e1, f1), (e2, f2), . . . , (ecn, fcn) be a sequence of ordered pairs of edges from the complete graph Kn chosen uniformly and independently at random. We prove that there exists a constant c2 such that if c > c2 then whp every graph which contains at least one edge from each ordered pair (ei, fi) has a component of size Ω(n) and if c < c2 then whp there is a graph containing at least one edge from each pair that has no component with more than O ( n1−2 ) vertices, where 2 is a constant that depends on c2− c. The constant c2 is roughly 0.97677.
3103350
Random Matchings in Regular Graphs
d-regular graph G, let M be chosen uniformly at random from the set of all matchings of G, and for let be the probability that M does not cover x.We show that for large d, the 's and the mean μ and variance of are determined to within small tolerances just by d and (in the case of μ and ) :
Theorem. For any d-regular graph G,
(a), so that ,
(b),where the rates of convergence depend only on d.
14647313
Energy-efficient disk replacement and file placement techniques for mobile systems with hard disks
Mobile systems have usually used hard disks as the secondary storage devices because of their high capacity per cost and high I/O throughput. However, their high power consumption is the main limiting factor for extending their adoptions in mobile systems. In this paper, we propose enhanced file placement techniques for mobile platforms with multiple smaller disks (instead of a single large disk). We investigate that how many smaller disks are necessary to obtain energy saving while maintaining the required performance using both a simplified energy model and a realistic trace-based simulator under the proposed multiple disk configurations. We also propose energy-efficient file placement techniques, which aggregate files with common attributes the same set of disks. By skewing I/O operations, the proposed techniques achieve additional energy saving. Experimental results show that the proposed techniques can reduce the energy consumption by up to 43% when eight 1" disks are used instead of a single 2.5" disk with an acceptable increase in the average response time.
16103417
Designs in Additive Codes over GF(4)
The purpose of this paper is to study designs in additive codes over GF(4). There are two types of designs. One is a classical t-design with repeated blocks. In this case we have an analog of the Assmus–Mattson Theorem for additive codes over GF(4). The other is a generalized t-design first introduced by Delsarte [4]. As an example, we consider the dodecacode, which is the unique additive even self-dual (12, 212, 6) code. We show that there exists a 5-(12, 6, 3) design in the dodecacode with either 3 distinct blocks or 3 repeated blocks covering a 5-set. We also find a new simple 3-(11, 5, 4) design in the shortened dodecacode by a computer search. Additionally we show that any extremal additive even self-dual code over GF(4) is homogeneous.
10913816
A Web Services-enabled marketplace architecture for negotiation process management
As the eBusiness environment becomes more pervasive and dynamic, negotiations between companies are required more frequently than ever. Despite its potential value and the progress in research, the adoption of negotiation systems has been slow in practice. We believe one reason for this is insufficient consideration of process management aspects such as process design, description, and deployment. Business negotiations must be approached from the process management perspective since they take place in the context of corporate processes such as procurement or sales.In this paper, we study system support and automation of business-to-business (B2B) negotiations from the process management perspective. We propose a Web Services-enabled marketplace architecture for negotiation process management and refine it by adding pattern-based process composition. We validate the concept by implementing the proposed architecture using BPEL4WS and evaluating it from various perspectives.
18235969
Learning Relations and Information Extraction Rules for Protein Annotation
Protein annotation is a task that describes protein X in terms of topic Y Until now, most of protein annotation work has been done manually by human annotators. However, as the number of biomedical papers grows ever rapidly, manual annotation becomes difficult, and there is increasing need to automate the protein annotation process. Recently, Information Extraction (IE) has been used to solve this problem. Typically, IE requires pre-defined relations and hand-crafted IE rules or annotated corpora, and these requirements are difficult to satisfy in real world domains such as the biomedical domain. In this paper, we describe an IE system which requires only sentences labeled relevant or not to a given topic by domain experts.
31990528
Diagnosing Multiple Bridge Faults in Baseline Multistage Interconnection Networks