Random graphs Research Project Examples

Random graphs Research Project Examples.

1. Predictor‐based H∞ leader‐following consensus of stochastic multi‐agent systems with random input delay
2. Adaptive Rewiring in Weighted Networks Shows Specificity, Robustness, and Flexibility
3. Impact of the mesoscale structure of a bipartite ecological interaction network on its robustness through a probabilistic modeling
4. Vulnerability studies in the fields of transportation and complex networks: a citation network analysis
5. On the average order of a dominating set of a forest
6. Minimum Spanning Trees of Random Geometric Graphs with Location Dependent Weights
7. A complement to the Chebyshev integral inequality
8. Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost
9. Math to Code to Petaflops
10. Network geometry
11. Investigating the effects of updating rules on cooperation by incorporating interactive diversity
12. Observing symmetry-broken optimal paths of stationary Kardar-Parisi-Zhang interface via a large-deviation sampling of directed polymers in random media
13. On the Asymmetric Generalizations of Two Extremal Questions on Friends-and-Strangers Graphs
14. Parallelization of network motif discovery using star contraction
15. On the contractibility of random Vietoris-Rips complexes
16. Sparse Sachdev-Ye-Kitaev model, quantum chaos, and gravity duals
17. Network reconstruction from betweenness centrality by artificial bee colony
18. ShortWalk: an approach to network embedding on directed graphs
19. A combinatorial approach to counting primitive periodic and primitive pseudo orbits on circulant graphs
20. Sensitivity of mixing times, an example
21. Investigating the effects of updating rules on cooperation by incorporating interactive diversity
22. Observing symmetry-broken optimal paths of stationary Kardar-Parisi-Zhang interface via a large-deviation sampling of directed polymers in random media
23. On the Asymmetric Generalizations of Two Extremal Questions on Friends-and-Strangers Graphs
24. Parallelization of network motif discovery using star contraction
25. On the contractibility of random Vietoris-Rips complexes
26. Sparse Sachdev-Ye-Kitaev model, quantum chaos, and gravity duals
27. Network reconstruction from betweenness centrality by artificial bee colony
28. ShortWalk: an approach to network embedding on directed graphs
29. A combinatorial approach to counting primitive periodic and primitive pseudo orbits on circulant graphs
30. Sensitivity of mixing times, an example
31. Minimax rates in network analysis: Graphon estimation, community detection and hypothesis testing
32. An overview of epidemic models with phase transitions to absorbing states running on top of complex networks
33. The Gutman Index and Schultz Index in the Random Phenylene Chains
34. Hypergraphs for predicting essential genes using multiprotein complex data
35. Almost optimal super-constant-pass streaming lower bounds for reachability
36. Domination in Digraphs
37. An exact method for the minimum feedback arc set problem
38. Scaling limit for random walk on the range of random walk in four dimensions
39. Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs
40. Decentralized Constrained Optimization: Double Averaging and Gradient Projection
41. Network Recovery from Unlabeled Noisy Samples
42. A Network-Based Explanation of Perceived Inequality
43. Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem
44. Galton–Watson games
45. Depths in hooking networks
46. On odd rainbow cycles in edge-colored graphs
47. Computing temporal sequences associated with dynamic patterns on the C. elegans connectome
48. Online Learning of Time-Varying Signals and Graphs
49. A performance study of meta‐heuristic approaches for quadratic assignment problem
50. CANE: community-aware network embedding via adversarial training
51. Dynamic Labeling for Unlabeled Graph Neural Networks
52. Regions of Reduced Dynamics in Dynamic Networks
53. Cutoff for Almost All Random Walks on Abelian Groups
54. The localization capture time of a graph
55. Two problems in extremal combinatorics
56. A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
57. Balanced product quantum codes
58. Spectral distributions of periodic random matrix ensembles
59. Observability transitions in clustered networks
60. Epidemic dynamics on metapopulation networks with node2vec mobility
61. Beating treewidth for average-case subgraph isomorphism
62. Banach space actions and L2-spectral gap
63. Convex relaxation methods for community detection
64. Model free estimation of graphical model using gene expression data
65. Percolation-intercropping strategies to prevent dissemination of phytopathogens on plantations
66. Generalized quantum-classical correspondence for random walks on graphs
67. Simplicial SIRS epidemic models with nonlinear incidence rates
68. Route lengths in invariant spatial tree networks
69. Factor of iid Schreier decoration of transitive graphs
70. Coherence resonance in random Erd os-Renyi neural networks: mean-field theory
71. The critical two-point function for long-range percolation on the hierarchical lattice
72. An Efficient and Scalable Algorithm for Estimating Kemeny’s Constant of a Markov Chain on Large Graphs
73. Matrix factorisation and the interpretation of geodesic distance
74. The enumeration of planar graphs via Wick’s theorem
75. Note on sunflowers
76. Overview of Network-based Methods for Analyzing Financial Markets
77. Adversarial Graph Augmentation to Improve Graph Contrastive Learning
78. A variable neighborhood search algorithm for energy conscious task scheduling in heterogeneous computing systems
79. Disintegrating spatial networks based on region centrality
80. From Poincaré inequalities to nonlinear matrix concentration
81. Social dilemmas in off-lattice populations
82. On the distribution of monochromatic complete subgraphs and arithmetic progressions
83. Backdoor attacks to graph neural networks
84. Weighted k-domination problem in fuzzy networks
85. An intelligent hybrid approach for task scheduling in cluster computing environments as an infrastructure for biomedical applications
86. Phase transition of the 2-choices dynamics on core–periphery networks
87. Performance of Domain-Wall Encoding for Quantum Annealing
88. On the dual geometry of Laplacian eigenfunctions
89. Percolation transitions in growing networks under achlioptas processes: Analytic solutions
90. Kernelization and approximation of distance-r independent sets on nowhere dense graphs
91. Deficiency zero for random reaction networks under a stochastic block model framework
92. Graph-Valued Regression: Prediction of unlabelled networks in a Non-Euclidean Graph-Space
93. Optimal Random Packing of Spheres and Extremal Effective Conductivity
94. Noise sensitivity for the top eigenvector of a sparse random matrix
95. On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue
96. Fast and strong amplifiers of natural selection
97. -intersecting families of graphs
98. Minimum degree stability of -free graphs
99. Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs
100. The impact of noise and topology on opinion dynamics in social networks

 

101. A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
102. -Analogs of strongly regular graphs
103. Fractal mountains and binary random loops
104. Improving search using a fault-tolerant overlay in unstructured p2p systems
105. Sparse network optimization for synchronization
106. Digraph signal processing with generalized boundary conditions
107. Nonlinear network dynamics with consensus–dissensus bifurcation
108. Divergence and quasi-isometry classes of random Gromov’s monsters
109. A Quotient Space Formulation for Generative Statistical Analysis of Graphical Data
110. A new approach to finding the extra connectivity of graphs
111. Majority-vote model with limited visibility: An investigation into filter bubbles
112. Simple mathematical models for controlling COVID-19 transmission through social distancing and community awareness
113. Binarized graph neural network
114. On the perfect differential of a graph
115. Divisibility properties of random samples of integers
116. Trustworthiness assessment for industrial IoT as multilayer networks with von Neumann entropy
117. Continuum percolation and stochastic epidemic models on Poisson and Ginibre point processes
118. miRGTF-net: Integrative miRNA-gene-TF network analysis reveals key drivers of breast cancer recurrence
119. The effective graph reveals redundancy, canalization, and control pathways in biochemical regulation and signaling

More Research Projects examples on Random graphs