Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 17 of 17 for “"Bounded degree"”.
-
Analysis and control of contagion processes on networks
… process modeled as an SIS epidemic on a bounded degree undirected graph with n nodes. We show that if the budget r of curing resources available at each time is Q(W), where W is the CutWidth of the graph, and also of order [omega](log n), then the expected time until the extinction of the …
-
Constant time algorithms in sparse graph model
… constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum Weighted Matching, Maximum Independent Set and Set Cover. Some of our techniques can …
-
Hyperbolic 3-manifolds of bounded volume and trace field degree
… many Dehn fillings of it whose trace fields have bounded degree. In this paper, we conjecture the same for manifolds with more cusps, and give the first positive results in this direction. For example, in the 2-cusped case, if a manifold has linearly independent cusp shapes, we show that the …
-
Quantitative embeddings with applications
… and Barzdin. The theorem says that any bounded degree graph with V vertices can be mapped into a 3-dimensional ball of radius sqrt(V), so that at most a constant number of edges intersect any unit ball. In one generalization we describe how much freedom we have in placing the vertices of …
-
Decay of correlations and inference in graphical models
… in random multipartite graphs with a given degree sequence. The list coloring problem on a graph g is a generalization of the classical graph coloring problem where each vertex is provided with a list of colors. We prove the Strong Spatial Mixing (SSM) property for this model, for arbitrary …
-
A study of efficient secret sharing
… are in P, but are not known to be in NC, namely Bounded-Degree Graph Isomorphism and constant-dimensional lattice problems. In particular, this gives us the first combinatorial access structure that is conjectured to be outside NC but has an efficient secret-sharing scheme. Previous such …
-
Correlation decay and decentralized optimization in graphical models
… distributed cost coefficients in networks with bounded connectivity. In the second part, we pursue similar questions in a combinatorial optimization setting: we consider the problem of finding a maximum weight independent set in a bounded degree graph, when the node weights are i.i.d. random …
-
New sublinear methods in the struggle against classical problems
… that is a function of only the maximum vertex degree, and in particular, does not depend on the number of vertices in the graph. We show a general local computation framework that allows for transforming many classical greedy approximation algorithms into constant-time approximation algorithms …
-
Effective integrality results in arithmetic dynamics
… is uniform as β varies over number fields of bounded degree. This generalises results of Baker, Ih and Rumely, which were made uniform by Yap.
-
A probabilistic perspective on graph coloring
… uniform distribution of proper colorings of a bounded-degree tree. As a consequence, we are able to make significant progress towards a longstanding conjecture in the statistical physics community and one of the oldest and most basic still-open questions in the field of approximate counting and …
-
Chromatic scheduling of dynamic data-graph computations
… to color a graph G = (V, E) with max vertex degree [Delta], generalizing previous results for bounded degree graphs. A new log-degree ordering heuristic is described which can reduce the number of colors used in practice, while only increasing the number of rounds by a logrithmic factor. An …
-
Polynomial Identities on Algebras with Actions
… component A1 satisfies an identity of degree d, then Bergen and Cohen showed that A is itself a PI-algebra. Bahturin, Giambruno and Riley later used combinatorial methods to show that the degree of the identity satisfied by A is bounded above by a function of d and |G|. Utilizing a …
-
Stochastic dynamics with singular lower order terms in finite and infinite dimensions
… $frac{partial}{partial x_{i}}a_{ij}(t,x)$ are bounded and H"older continuous in $x$. The lower order terms are assumed to be in some proper time-dependent Kato classes. Then we prove that the parabolic equation (1) has a unique weak fundamental solution admitting two-sided Gaussian estimates. …
-
Survivable network design problems with element and vertex connectivity requirements
In this thesis, we consider degree-bounded element-connectivity Survivable Network Design Problem (Elem-SNDP) and degree-bounded Rooted k-outconnectivity Problem. We suggest bicriteria approximation algorithms that are motivated by Ene and Vakilian's work in [1] and Lau and Zhou's work in [2]. The …
-
Delegating computation reliably : paradigms and constructions
… such as connectivity, perfect matching and bounded-degree graph isomorphism. * A methodology for designing error-correcting codes with efficient decoding procedures, in which work is delegated from the decoder to the encoder. We use this methodology to obtain constant-depth (AC⁰) locally …
-
Variations on the Theme of Higher Dimensional Weisfeiler-Leman Algorithms
… proof systems with algebraic rules; namely, bounded degree polynomial calculus, monomial calculus and Nullstellensatz calculus. These are well studied and have been used in the context of graph isomorphism in [14] and [39]. Our results generalise some of the work in the latter two papers and …
-
Sufficient conditions for the existence of specified subgraphs in graphs
… that if a graph G contains many more vertices of degree at least 2k than vertices of degree at most 2k-2, then G contains k vertex-disjoint cycles. We strengthen their result, proving that if G contains 3k more vertices of high degree than vertices of low degree, then G contains k disjoint cycles …