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 29 for “"Evolving graphs"”.

  1. Epidemics on Evolving Graphs

    … to 0. In this paper we study evoSI dynamics on graphs generated by the configuration model. We show that there is a quantity $\Delta$ determined by the first three moments of the degree distribution, so that the transition is discontinuous if $\Delta>0$ and continuous if $\Delta<0$.</p>

    duke Repository record for Epidemics on Evolving Graphs (opens in a new tab)

  2. Visual Analytics of Evolving Graphs

    … are even more significant when dealing with evolving network datasets due to their dynamic, complex, and constantly changing nature. Analyzing and visualizing these datasets requires advanced techniques and tools that can handle their complexity and facilitate the identification of patterns, …

    anu Repository record for Visual Analytics of Evolving Graphs (opens in a new tab)

  3. Evolving Graphs by Graph Programming

    Graphs are a ubiquitous data structure in computer science and can be used to represent solutions to difficult problems in many distinct domains. This motivates the use of Evolutionary Algorithms to search over graphs and efficiently find approximate solutions. However, existing techniques often …

    whiterose Download PDF for Evolving Graphs by Graph Programming (opens in a new tab)

  4. Storage, processing and analysis of large evolving graphs

    … and pattern-based ones, is limited to static graphs, leaving query processing on evolving graphs unexplored. This dissertation focus on managing and querying the full history of a graph as it evolves. We introduce a compact representation of an evolving graph, where each graph element i.e., …

    greece Repository record for Storage, processing and analysis of large evolving graphs (opens in a new tab)

  5. Efficient computation of first order Markov measures on large evolving graphs.

    … of the representation of data as link graphs is that these graphs evolve as the corresponding real world phenomena change over time. Understanding such phenomena requires a study of the evolution of their representative graphs and the measures associated with them. However, the large …

    umn Repository record for Efficient computation of first order Markov measures on large evolving graphs. (opens in a new tab)

  6. From evolving graphs to irregular time series : learning across structure and time

    Machine learning on evolving graphs and irregular time series underlies many applications, from fraud detection and personalized recommendation to clinical risk prediction. Such data settings pose unique challenges, including distribution shifts that lead to model performance degradation and novel …

    texas Repository record for From evolving graphs to irregular time series : learning across structure and time (opens in a new tab)

  7. AN EMPIRICAL STUDY ON DETECTING AND EXPLAINING GLOBAL STRUCTURAL CHANGE IN EVOLVING GRAPH USING MARTINGALE

    … grids, all of which can be represented using evolving graphs. Changes in these evolving graphs can signify shifts in the behavior of interacting entities or alterations in the patterns of their interactions. Identifying and detecting these changes is crucial for addressing potential challenges …

    rowan Repository record for AN EMPIRICAL STUDY ON DETECTING AND EXPLAINING GLOBAL STRUCTURAL CHANGE IN EVOLVING GRAPH USING MARTINGALE (opens in a new tab)

  8. Discovery of Temporal Graph Functional Dependencies

    Real-world graphs are dynamic and evolve over time. Data quality in evolving graphs is essential to downstream decision making and fact checking. This work studies the discovery of Temporal Graph Functional Dependencies (TGFDs), a recently defined class of data quality rules for enforcing …

    mcmaster Repository record for Discovery of Temporal Graph Functional Dependencies (opens in a new tab)

  9. Evolution PDEs on graphs and inverse problems in aggregation-diffusion equations

    … partial differential equations (PDEs) on graphs, and on the other, we address the inverse problem of learning interaction potentials in aggregation-diffusion equations.</p> <br> <p>In Part One, we investigate evolution PDEs on co-evolving graphs, i.e. a setting in which the topology of the …

    oxford Repository record for Evolution PDEs on graphs and inverse problems in aggregation-diffusion equations (opens in a new tab)

  10. Systems abstractions for big data processing on a single machine

    … machine while also enabling the processing of evolving, billion-scale graphs. First, this dissertation presents a new out-of-core graph processing engine, called Mosaic, for executing graph algorithms on trillion-scale datasets on a single machine. Mosaic makes use of many-core processors and …

    gatech Repository record for Systems abstractions for big data processing on a single machine (opens in a new tab)

  11. System design principles for heterogeneous resource management and scheduling in accelerator-based systems

    … two important characteristics of real world graphs like those in social networks are that they are big and are constantly evolving over time. This poses challenge due to limitations in GPU-resident memory for storing these large graphs. And because of the high rate at which these large-scale …

    gatech Repository record for System design principles for heterogeneous resource management and scheduling in accelerator-based systems (opens in a new tab)

  12. Similarity Search over Network Structure

    … existing similarity search algorithms on large graphs are impractical due to their expensive costs in terms of computational time and memory space. Moreover, dynamic changes (e.g., noise and abnormality) exists in network data, and it arises from many factors, such as data loss in transfer, data …

    aston Download PDF for Similarity Search over Network Structure (opens in a new tab)

  13. Unsupervised approaches for time-evolving graph embeddings with application to human microbiome

    … dynamics. Constructing and analyzing time-evolving graphs is needed to understand how microbial ecosystems respond to a range of distinct perturbations, such as antibiotic exposure, diseases, or other general dynamic properties. This becomes especially challenging due to dozens of complex …

    fu-berlin Repository record for Unsupervised approaches for time-evolving graph embeddings with application to human microbiome (opens in a new tab)

  14. Compression techniques for extreme-scale graphs and matrices: sequential and parallel algorithms

    … of elements called links (edges), and a time-evolving graph is a change in the states of the edges over time. With the growing popularity of social networks and the massive influx of users, it is becoming a challenging task to store the network/graph and process them as fast as possible before …

    oklahoma-thes Repository record for Compression techniques for extreme-scale graphs and matrices: sequential and parallel algorithms (opens in a new tab)

  15. Modeling, predicting, and guiding users' temporal behaviors

    … generic embedding framework for continuous-time evolving graphs, (3) scalable algorithms for predicting user activity levels, and (4) a stochastic differential equation framework for guiding users’ activities.

    gatech Repository record for Modeling, predicting, and guiding users' temporal behaviors (opens in a new tab)

  16. Tracking uncertainty in knowledge graphs using Kalman filtering

    Knowledge graphs (KGs) represent structured knowledge as networks of entities and relations, forming a foundation for reasoning in artificial intelligence. To make these symbolic structures usable by machine learning systems, knowledge graph embeddings (KGEs) map entities and relations into …

    uvic Repository record for Tracking uncertainty in knowledge graphs using Kalman filtering (opens in a new tab)

  17. Towards Dynamic Network Analysis: Benchmarks, Applications and Algorithms

    Graphs are a fundamental abstraction for modeling complex systems, representing entities as vertices and relationships as edges across domains ranging from social networks and biological systems to High-Performance Computing infrastructures. Most real-world graphs are dynamic in nature, …

    unt Repository record for Towards Dynamic Network Analysis: Benchmarks, Applications and Algorithms (opens in a new tab)

  18. Representation Learning for Texts and Graphs

    … approaches, questioning the necessity of graphs synthesized from the text. [...] Fourth, we investigate the connection between text and graph data in document-based recommender systems for citations and subject labels. Experiments on six datasets show that the title as side information …

    cau-kiel Repository record for Representation Learning for Texts and Graphs (opens in a new tab)

  19. Microstructural Materials Design Using Data and Graph

    … novel computationally efficient method utilizing evolving graphs and microstructural unit events is developed and validated against the results of microstructure-based finite element calculations of ductile fracture. The fully validated method is then used to design material microstructures with …

    tamu Repository record for Microstructural Materials Design Using Data and Graph (opens in a new tab)

  20. The inward flow: an inhomogeneous flow asymptotic to the mean curvature flow

    … for tangent flows. In addition, we show that evolving graphs of revolution are noncollapsing via an analysis of the asymptotic height-to-width ratio. Finally, adapting the methods of Evans and Spruck, we construct weak level-set solutions by formulating the evolution as a degenerate elliptic …

    anu Repository record for The inward flow: an inhomogeneous flow asymptotic to the mean curvature flow (opens in a new tab)

Page 1 of 2