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 13 of 13 for “"k-core"”.
-
The Resilience of k-Cores in Graphs
<p>A k-core of a graph is defined as the maximal subgraph such that all the nodes in the subgraph has at least k neighbors within the subgraph. k-core have been used in a number of applications ranging from anomaly detection and finding influential spreaders in social networks, to studying the …
-
Distributed graph decomposition algorithms on Apache Spark
… Two such very popular decompositions, k-core and k-truss of a graph give very useful insight about the graph vertex and edges respectively. These decompositions have been applied to solve protein functions reasoning on protein-protein networks, fraud detection and missing link prediction …
-
Probabilistic and Analytic Methods in Combinatorics
… of Vu regarding the singularity of the k-core of a random graph. In particular, a sparse ErdősśRényi graph G(n,d/n) with high probability has large corank due to the presence of isolated vertices. Answering raised by Vu at the ICM 2014, the third chapter proves that by iteratively deleting …
-
Estabilidade das grelhas de convés de navios
… wich may be run on an IBMsystem 1130 with 32 K core, or alternatively the IBMSystem 360/40. Using this program we are able to quantify the torsional and shear effects on the grillage's girders as well as built in boundaries.
-
Reti complesse e analisi del segnale elettroencefalografico
… the existence of a distinctive functional core (sub-network) using an unbiased reconstruction of network topology. Brain signals from a public and freely available EEG dataset were analyzed using a phase synchronization based measure, minimum spanning tree and k-core decomposition. The …
-
IDLE: A Novel Approach to Improving Overlapping Community Detection in Complex Networks
… in networks. Research suggests that the main core identified by k-core decomposition techniques are the most influential spreaders. In my approach, I use these k-cores as candidate seeds for local community detection. Following a well-defined seed selection process, IDLE builds and prunes …
-
Core-valence-valence auger spectra of the simple metals
A comprehensive study of the core-valence-valence (CVV) Auger line shapes for the simple metals, Li, Be, Na, Mg, and AI, is presented. Calculations of these line shapes are performed with a static many-body model which treats the (static) screening of a core hole by conduction electrons with a …
-
Scalable and Efficient Graph Algorithms and Analysis Techniques for Modern Machines
… graph algorithms. Luckily, commercial multi-core, multi-processor, and multi-machine environments can handle such volumes of data. Unfortunately, despite the availability of such resources, many current graph algorithms do not take full advantage of these parallel and distributed environments …
-
Network Based Approaches for Clustering and Location Decisions
… to be much more effective than a regular k-core peeling approach. Next, a general purpose network clustering algorithm based on the clique relaxation concept of k-community is presented. A salient feature of this approach is that it does not use any prior information about the structure of …
-
High Performance Large Graph Analytics by Enhancing Locality
… algorithms for three graph problems: <em>k-</em>core decomposition, maximal clique enumeration and triangle listing. We have implemented the algorithms. The results show that these algorithms provide significant improvement in performance and also scale well.</p>
-
Bridging Theory and Practice in Parallel Clustering
… proteins and genes in biological systems. At its core, identifying the underlying substructures of a graph can indicate essential functional groups, such as people with similar interests, news articles on similar topics, or proteins with similar utilities, which can then be synthesized for a …
-
Mathematical frameworks for quantitative network analysis
… spectrum integrates the degree distribution and coreness information of the graph as two particular such chains. We prove that these spectra are realized as fixed points of certain monotone and contractive SDSs we call t-systems. Finally, we give a vertex deletion algorithm that efficiently …
-
Rigidity and Fluidity in Living and Nonliving Matter
… several constraint percolation models, such as k-core percolation and counter-balance percolation, on hyperbolic lattices to better understand the role of loops in such models. The constraints in these percolation models incorporate aspects of local mechanical rigidity found in jammed systems. The …