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 “"Undirected networks"”.

  1. Adjacency spectral embedding beyond unweighted, undirected networks

    There exists a rich variety of real-world networks beyond those with unweighted and undirected edges. This thesis considers the statistical analysis of adjacency spectral embedding beyond these standard networks. By embedding the nodes of these networks into low dimensional space in a consistent …

    bristol Repository record for Adjacency spectral embedding beyond unweighted, undirected networks (opens in a new tab) Download PDF for Adjacency spectral embedding beyond unweighted, undirected networks (opens in a new tab)

  2. Identifying Parameters for Robust Network Growth using Attachment Kernels: A case study on directed and undirected networks

    … growing mechanisms are used to construct random networks that have structural behaviors similar to existing networks such as genetic networks, in efforts of understanding the evolution of complex topologies. Popular mechanisms, such as preferential attachment, are capable of preserving network …

    vcu Repository record for Identifying Parameters for Robust Network Growth using Attachment Kernels: A case study on directed and undirected networks (opens in a new tab)

  3. Multi-Agent Consensus Based Distributed Optimization over Undirected Networks with Time Varying Cost Function Using Dynamic Inversion

    … problem of distributed optimization over an undirected network of agents, concerning minimization of a global objective function formed by the sum of local convex time-varying cost functions possessed by each agent. Due to the decentralized nature of the optimization process, a number of …

    queens Repository record for Multi-Agent Consensus Based Distributed Optimization over Undirected Networks with Time Varying Cost Function Using Dynamic Inversion (opens in a new tab)

  4. Comparison of Routing and Network Coding in Group Communications

    In traditional communication networks, information is delivered as a sequence of packets from source to destination by routing through intermediate nodes which only store and forward those packets. Recent research shows that routing alone is not sufficient to achieve the maximum information …

    usf Repository record for Comparison of Routing and Network Coding in Group Communications (opens in a new tab)

  5. A Study of the Multiple-Unicast Network Coding Conjecture Using Riemannian Manifolds

    … multiple independent unicast transmissions in an undirected network, network coding has no advantage over traditional routing. In this thesis, we study the conjecture by embedding graphs into Riemannian manifolds using a geometric framework developed by Xiahou el al. [32]. We prove that isometric …

    calgary Repository record for A Study of the Multiple-Unicast Network Coding Conjecture Using Riemannian Manifolds (opens in a new tab)

  6. Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι

    … algorithms foroptimization problems on dynamic undirected networks with connectivity constraints and develop thefirst dynamic algorithm for the directed minimum spanning tree problem on directed graphs. Finally,we study two representative network optimization problems: we develop a …

    greece Repository record for Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι (opens in a new tab)

  7. The statistical detection of clusters in networks

    … function for network clustering for both undirected networks, in which edges have no direction, and directed networks, in which edges have direction. Clustering networks by optimizing an objective function is computationally expensive and quickly becomes prohibitive as the number of …

    alabama Repository record for The statistical detection of clusters in networks (opens in a new tab)

  8. Optimization of Network Perturbations for Steady-State Control

    … problem, but equally as valuable, is using these networks to predict the system-wide effects of perturbations in biological networks. These models play a central role in silico predictions that provide insights and generate hypotheses for new experiments, ultimately accelerating discovery. In this …

    buffalo Repository record for Optimization of Network Perturbations for Steady-State Control (opens in a new tab)

  9. Advances in Bayesian Approaches for Directed and Undirected Graphical Models

    … Graphical models can capture both directed and undirected relationships, which may arise from a variety of underlying distributions. This flexibility has made them applicable across many fields of study. In this thesis we advance the research on Bayesian methods for graphical model inference by …

    rice Repository record for Advances in Bayesian Approaches for Directed and Undirected Graphical Models (opens in a new tab)

  10. Multiscale community detection using markov dynamics

    Complex networks is an interdisciplinary research area getting attention from a variety of disciplines including sociology, biology, and computer science. It studies the properties of complex systems that may have many functional or structural subunits. Community detection algorithms are one of the …

    hawaii Repository record for Multiscale community detection using markov dynamics (opens in a new tab)

  11. Prefactorization and vertex algebras associated to holomorphic fibrations, the toroidal algebra, and averages of unlabeled networks

    … a notion of averaging on the space of unlabeled networks. Factorization algebras provide a geometric encoding of the algebra of observables and their symmetries in perturbative quantum field theory. Vertex algebras provide a concrete algebraic realization of the symmetry algebra of two …

    bu Repository record for Prefactorization and vertex algebras associated to holomorphic fibrations, the toroidal algebra, and averages of unlabeled networks (opens in a new tab)

  12. Lanczos-based matrix function computation with applications to network analysis

    … concrete problem that arises in the analysis of undirected networks: evaluating the importance of edges.<br><br>We first focus on the relationship between the Lanczos procedure in numerical linear algebra and scalar polynomial approximation. We show how connections to classical Gauss quadrature …

    oxford Repository record for Lanczos-based matrix function computation with applications to network analysis (opens in a new tab)

  13. Phase Transitions in Complex Network Dynamics

    Two phase transitions in complex networks are analyzed. The first of these is a percolation transition, in which the network develops a macroscopic connected component as edges are added to it. Recent work has shown that if edges are added "competitively" to an undirected network, the onset of …

    maryland Repository record for Phase Transitions in Complex Network Dynamics (opens in a new tab)

  14. Moment Closure by Entropy Maximization for Stochastic Oscillators and Sparse Control of Modular Networks

    Chemical reactions in regulatory gene networks and other biological processes often present complex nonlinear dynamics involving a small number of molecules. Population balances based on stochastic theory, such as the Chemical Master Equation (CME), along with kinetic Monte Carlo simulations …

    umn Repository record for Moment Closure by Entropy Maximization for Stochastic Oscillators and Sparse Control of Modular Networks (opens in a new tab)

  15. Fixation Probability of Evolutionary Dynamics on Different Types of Networks

    … frameworks for evolutionary dynamics on complex networks, focusing on three interrelated aspects: switching temporal networks, weighted networks, and multilayer networks. The central theme is to understand how different types of network heterogeneities and dynamics affect the fixation …

    buffalo Repository record for Fixation Probability of Evolutionary Dynamics on Different Types of Networks (opens in a new tab)

  16. Static and sequential location-allocation problems on networks and areas with probabilistic demands

    … In this context, minisum location problems on undirected networks are considered in which demands can occur on links with uniform probability distributions. Three types of networks are considered. The first type is a chain graph. It is shown that except for the 1-median case, the problem is …

    vt Repository record for Static and sequential location-allocation problems on networks and areas with probabilistic demands (opens in a new tab)

  17. Variational approximation for importance sampling and statistical inference on social influence

    … sampling, detecting the degrees of influence in networks, and exploring properties of generalized Erd\H{o}s-R\'enyi model. In the first part of the thesis, we propose an importance sampling algorithm with proposal distribution obtained from variational approximation. This method combines the …

    uiuc Repository record for Variational approximation for importance sampling and statistical inference on social influence (opens in a new tab)

  18. A Convex Framework for Epidemic Control in Networks

    With networks becoming pervasive, research attention on dynamics of epidemic models in networked populations has increased. While a number of well understood epidemic spreading models have been developed, little to no attention has been paid to epidemic control strategies; beyond heuristics usually …

    penn Repository record for A Convex Framework for Epidemic Control in Networks (opens in a new tab)

  19. Random Walk Approaches to Clustering Directed Networks

    Some networks obtained from real world problems such as social networks, biological cells or earthquake recurrence networks, may consist of many thousands of vertices and exhibit a pronounced modular structure. To facilitate further analysis or derive a simple model of the whole system, it is often …

    fu-berlin Repository record for Random Walk Approaches to Clustering Directed Networks (opens in a new tab)

  20. Distributed optimal and predictive control methods for networks of dynamic systems

    … approaches to distributed control design over networks of interconnected dynamic systems rely on certain assumptions, such as identical subsystem dynamics, absence of dynamical couplings, linear dynamics and undirected interaction schemes. In this thesis, we investigate systematic methods for …

    city-london Download PDF for Distributed optimal and predictive control methods for networks of dynamic systems (opens in a new tab)

Page 1 of 2