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 12 of 12 for “"graph distance"”.

  1. Graph mutation, graph distance, and graph gradient

    … failures is crucial for maintaining a network. Distance-based graph invariants are important criteria for network maintenance. A graph mutation is a change in the edge set of a graph, and a graph gradient is the change in a graph invariant after a mutation. We present the general concepts of …

    msu Repository record for Graph mutation, graph distance, and graph gradient (opens in a new tab)

  2. Polynomials of the Adjacency Matrix of a Graph (distance-Transitive, Distance-Regular, Orbit)

    Given graphs (GAMMA) and (DELTA), and a real polynomial r(x), we will say that (DELTA) is generated from (GAMMA) by r(x) if r(A((GAMMA))) = A((DELTA)) where A((GAMMA)) and A((DELTA)) are adjacency matrices. For several interesting classes of graphs it is possible to determine all of the graphs …

    uiuc Repository record for Polynomials of the Adjacency Matrix of a Graph (distance-Transitive, Distance-Regular, Orbit) (opens in a new tab)

  3. The D-neighborhood complex of a graph

    The Neighborhood complex of a graph, G, is an abstract simplicial complex formed by the subsets of the neighborhoods of all vertices in G. The construction of this simplicial complex can be generalized to use any subset of graph distances as a means to form the simplices in the associated …

    colostate Repository record for The D-neighborhood complex of a graph (opens in a new tab)

  4. Optimal Transport Clustering of Geometric and Spatial Data

    … ought to be connected when the cost is a graph distance. However, upon deeper investigation-including: graph-based OT models, where we analyzed voter assignments as flows on a network; validation via the Beckmann formulation, which recasts OT as a flow minimization problem; and experiments …

    texas-state Repository record for Optimal Transport Clustering of Geometric and Spatial Data (opens in a new tab)

  5. Short paths in scale-free percolation

    Graph distances in real-world networks, in particular social networks, have been always in the focus of network research since Milgram’s sociological experiment in 1960s. In this dissertation we specialize in a geometric random graph known as scale-free percolation, which shows a rich phase diagram …

    lmu-germany Repository record for Short paths in scale-free percolation (opens in a new tab)

  6. Distance Between Crossing Edges: A New Measure for Beyond-Planarity

    Planar graphs—which are graphs that can be drawn without edge-crossings—are an important class of graphs, both from a theoretical and from an algorithmic perspective. They often admit elegant structures and efficient algorithms that are otherwise infeasible for general graphs. While planar graphs …

    carleton Repository record for Distance Between Crossing Edges: A New Measure for Beyond-Planarity (opens in a new tab)

  7. Robust Anomaly Detection with Applications to Acoustics and Graphs

    … between distributions of vertex invariants as a graph distance metric and achieve state-of-the-art performance when detecting graph anomalies with neighborhoods of excessive or negligible connectivity. [1] D. Rumsfeld. (2002) Transcript: DoD news briefing - Secretary Rumsfeld and Gen. Myers. [2] …

    jhu Repository record for Robust Anomaly Detection with Applications to Acoustics and Graphs (opens in a new tab)

  8. Efficient quantum communication protocols and asynchronism in the toric code

    … problem is the one of approximating the Hamming distance in the simultaneous message passing model in communication complexity --- a natural generalisation of the Equality problem. An efficient quantum communication protocol is established and later used as the basis for approximating other …

    bristol Repository record for Efficient quantum communication protocols and asynchronism in the toric code (opens in a new tab) Download PDF for Efficient quantum communication protocols and asynchronism in the toric code (opens in a new tab)

  9. Efficient and transferable graph learning via anchor-based structural encodings

    Graph-structured data arise in many domains, including biological networks, social systems, recommendation platforms, and knowledge graphs. While graph neural networks (GNNs) have become a dominant framework for learning from such data, their effectiveness often depends on iterative message …

    colostate Repository record for Efficient and transferable graph learning via anchor-based structural encodings (opens in a new tab)

  10. Feature network methods for machine learning

    We develop a graph structure for feature vectors in machine learning, which we denote as a feature network (FN); this is different from sample-based networks, in which nodes simply represent samples. FNs reveal the underlying relationship among feature vector components and re-represent features as …

    bu Repository record for Feature network methods for machine learning (opens in a new tab)

  11. Graph-Theoretic Techniques for Web Content Mining

    … data mining on web documents which utilize graph representations of document content. Graphs are more robust than typical vector representations as they can model structural information that is usually lost when converting the original web document content to a vector representation. For …

    usf Repository record for Graph-Theoretic Techniques for Web Content Mining (opens in a new tab)

  12. Harnessing routine data and healthcare contacts to predict risk and treatment requirements in older people

    Recent demographic shifts towards an ageing population have placed unprecedented demands on health and social care services. These pressures often contribute to inactivity and deconditioning among older people with complex conditions in hospital. Frail older adults are increasingly likely to …

    edinburgh Repository record for Harnessing routine data and healthcare contacts to predict risk and treatment requirements in older people (opens in a new tab)