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 20 of 62 for “"Cliques"”.
-
Cliques in graphs
… $k_r(n,\delta)$, the minimal number of $r$-cliques in graphs with $n$ vertices and minimum degree~$\delta$. A fundamental result in Graph Theory states that a triangle-free graph of order $n$ has at most $n^2/4$ edges. Hence, a triangle-free graph has minimum degree at most $n/2$, so if …
-
Average-case complexity of detecting cliques
The computational problem of testing whether a graph contains a complete subgraph of size k is among the most fundamental problems studied in theoretical computer science. This thesis is concerned with proving lower bounds for k-CLIQUE, as this problem is known. Our results show that, in certain …
-
Chromatic Thresholds of Regular Graphs with Small Cliques
… this method to graphs that are free of larger cliques in order to limit the possible values of the chromatic threshold for regular <em>Kr</em>-free graphs.</p>
-
Lossless Coding of Markov Random Fields with Complex Cliques
… cases of the BP algorithm: MRFs with only simple cliques, and MRFs with complex cliques. In the latter case, we study a minimum radius condition requirement for ensuring that all cliques are accounted for during coding. This condition also simplifies the process of conditioning on observed sites. …
-
Cliques in block graphs of designs and orthogonal arrays
The Erdos-Ko-Rado [EKR] Theorem for intersecting families is a fundamental result in combinatorics, particularly in extremal set theory. This theorem not only establishes an upper bound on the size of the largest intersecting family but also characterizes the families that attain this bound—–these …
-
Institutional Investor Cliques Information Dissemination, and the Value of Information: Evidence from Insider Trading
… formation of the institutional investor groups (cliques) that exogenously connect firm-level insiders within the social network. Using difference-in-differences designs examining changes in clique size, I provide empirical evidence on the information dissemination channels within a network in …
-
The association between peer relations, eating behaviors, and body esteem in adolescent girls
… the friendship pair, and the individual. For cliques, results indicated that nuclear cliques were characterized by higher mean levels of peer pressure than secondary and peripheral cliques. Girls in cliques with higher social reinforcement, higher peer modeling, and an earlier average age of …
-
Cohesive Subgraph Computation in Graphs
… k-clique enumeration. We give the skyline k-cliques model over multi-valued attributed graphs and develop efficient algorithms to conduct the computation. To verify the group based dominance between two k-cliques, we make use of maximum bipartite matching and develop a set of optimization …
-
Leaders, followers, and community detection
… as a community. The problem of finding maximal cliques is known to be computationally hard. The goal of this work is to identify structural conditions in social network graphs that lead to efficient identification of maximal cliques, i.e. overlapping communities. We propose an evolutionary model …
-
Cameron-Liebler Sets for 2-Transitive Groups
… EKR property holds; (2) the number of maximum cocliques that are subgroups, cosets, or neither; (3) isomorphism classes and conjugacy classes of the maximum cocliques that are subgroups; (4) the dimension of C′, the maximum cliques that are subgroups (along with their right cosets), and C, all …
-
Nested (2,r)-regular graphs and their network properties.
… graph is constructed by replacing selected cliques with a (2,<i>r</i>)-regular graph and joining the vertices of the peripheral cliques. For example, in a nested '<i>s</i>' graph when <i>n = s + mp</i>, we obtain <i>n = s<sub>1</sub>+m<sub>1</sub>p<sub>1</sub>+mp</i>. The nested '<i>s</i>' …
-
Distributed graph decomposition algorithms on Apache Spark
… and finding highly connected subgraphs such as cliques and quasi cliques. Unfortunately, the algorithms for solving most of the above tasks are quite costly, which makes them not-scalable to large real-life networks. Two such very popular decompositions, k-core and k-truss of a graph give very …
-
Non-Gaussian Factor Graph Inference for Robotic Navigation
… sampling framework works by traversing all cliques of the Bayes tree from leaves to the root, to learn the local conditional distributions, then sampling the conditional distributions from the root to leaves. By leveraging the Bayes tree, the conditional sampling framework is able to exploit …
-
Information Diffusion on Social Networks
… the existence of Nash Equilibria on star graphs, cliques and trees. We give some results on potential games on the iterated local transitivity model. Chapter 2 provides an introduction to graph properties, and describes various early graph models. Chapter 3 describes some models for online social …
-
The Structure and Properties of Clique Graphs of Regular Graphs
… </em>(<em>G</em>), all cliques of order <em>t </em>of the original graph <em>G </em>become the clique graph’s vertices, and the vertices of the clique graph are adjacent if and only if the corresponding cliques in the original graph have at least 1 vertex in common. This …
-
Coloring Problems on Graphs and Hypergraphs
… be r-colored to avoid totally monochromatic m-cliques (introduced by Erdo&huml;s and Gyarfas. We interpret such colorings using a two-round game against an adversary; this relates splittable colorings to classical Ramsey numbers. Let fr(m) be the least n such that some r-edge-coloring of K n is …
-
Upper and lower bounds for the fixed spectrum frequency assignment problem
… for problems represented by complete graphs (cliques). The lower bounds for clique-like subproblems are produced by two different methods, the first of which is based on the solution of a linear program, while the second is based on a closed formula. The most effective method to generate …
-
Strategic delay and information exchange in endogenous social networks
… types of cost structures and associated social cliques (consisting of groups of individuals linked to each other at zero cost, such as friendship networks) ensure the emergence of communication networks that lead to asymptotic learning. Our result shows that societies with too many and …
-
Coloring clique hypergraphs
… has V as its set of vertices, and the maximal cliques as its hyperedges. Let Sk be a set of k colors. A map c : V Sk is a proper k-coloring for CH(G) if any maximal clique of G with at least two vertices receives at least two distinct colors. Let W ⊂ V, and let s ≥ 1. We say that G is …
-
Think global, act local when estimating a sparse precision matrix
… estimation to generate potentials for small cliques and fuses the local structures to form a sparse yet globally robust model of the entire distribution. Identification of appropriate local structures is done through stochastic discrete optimization. The algorithm is implemented in Matlab and …
Page 1 of 4