Math Thesis Topics

Research Area/ Research Interest:  Random Graphs

Research Paper Topics for Masters and Ph.D. Thesis and publication

  1. Random triangles in random graphs
  2. Large deviations of the greedy independent set algorithm on sparse random graphs
  3. Color-biased Hamilton cycles in random graphs
  4. Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
  5. Ramsey Goodness of Clique Versus Paths in Random Graphs
  6. Toughness in pseudo-random graphs
  7. Mixed connectivity properties of random graphs and some special graphs
  8. Fast uniform generation of random graphs with given degree sequences
  9. Upper tail for homomorphism counts in constrained sparse random graphs
  10. Bipartite Ramsey Numbers of Cycles for Random Graphs
  11. Cycle lengths in sparse random graphs
  12. Residual2Vec: Debiasing graph embedding with random graphs
  13.  A note on the majority dynamics in inhomogeneous random graphs
  14. Number of edges in inhomogeneous random graphs
  15. Exact matching of random graphs with constant correlation
  16. Note on induced paths in sparse random graphs
  17. The birth of geometry in exponential random graphs
  18. Spectral gaps of random graphs and applications
  19. Flooding in weighted sparse random graphs of active and passive nodes
  20. Tuza’s conjecture for random graphs
  21. Friendly bisections of random graphs
  22. An analogue of the Erdős–Gallai theorem for random graphs
  23.  Discontinuous phase transitions in the q-voter model with generalized anticonformity on random graphs
  24. Exponential Inequalities for the Distribution Tails of the Number of Cycles in the Erdös-Rényi Random Graphs
  25. A probabilistic approach to the leader problem in random graphs
  26. Generalization Analysis of Message Passing Neural Networks on Large Random Graphs
  27. Ramsey simplicity of random graphs
  28. Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
  29. Large induced matchings in random graphs
  30.  Chemical distance in geometric random graphs with long edges and scale-free degree distribution
  31.  Ferromagnetic and spin-glass like transition in the q-neighbor Ising model on random graphs
  32. A very sharp threshold for first order logic distinguishability of random graphs
  33. Monochromatic cycle partitions in random graphs
  34. Random graphs with prescribed k-core sequences: A new null model for network analysis
  35. Data Encryption Basing on the Existence of Eulerian Circuits in a Group of Random Graphs
  36. On breadth-first constructions of scaling limits of random graphs and random unicellular maps
  37.  The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
  38. Localization game for random graphs
  39. Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs
  40. Pandemic spread in communities via random graphs
  41.  Ferromagnetic and spin-glass like transition in the q-neighbor Ising model on random graphs
  42. A very sharp threshold for first order logic distinguishability of random graphs
  43. Monochromatic cycle partitions in random graphs
  44. Random graphs with prescribed k-core sequences: A new null model for network analysis
  45. Data Encryption Basing on the Existence of Eulerian Circuits in a Group of Random Graphs
  46. On breadth-first constructions of scaling limits of random graphs and random unicellular maps
  47.  The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
  48. Localization game for random graphs
  49. Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs
  50. Pandemic spread in communities via random graphs
  51. Entrywise limit theorems of eigenvectors and their one-step refinement for sparse random graphs
  52. Sharp Threshold for the Frechet Mean (or Median) of Inhomogeneous Erdos-Renyi Random Graphs
  53. On the performance of the Depth First Search algorithm in supercritical random graphs
  54. Emergence of extended states at zero in the spectrum of sparse random graphs
  55. An elementary approach to component sizes in some critical random graphs
  56. Graphical construction of spatial Gibbs random graphs
  57. Random graphs embeddable in order-dependent surfaces
  58. Random graphs with node and block effects: models, goodness-of-fit tests, and applications to biological networks
  59. Aligning random graphs with a sub-tree similarity message-passing algorithm
  60. Localization and universality of eigenvectors in directed random graphs
  61. Large Deviation Principle for the Maximal Eigenvalue of Inhomogeneous Erdős-Rényi Random Graphs
  62. Local limits of spatial inhomogeneous random graphs
  63. The fewest-big-jumps principle and an application to random graphs
  64. Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
  65. Site percolation on pseudo-random graphs
  66. Stability of clusters in the second-order Kuramoto model on random graphs
  67.  … : The random field XY model on sparse random graphs shows replica symmetry breaking and marginally stable ferromagnetism (2019 J. Phys. A: Math …
  68. The upper tail problem for induced 4-cycles in sparse random graphs
  69. Critical percolation on scale-free random graphs: New universality class for the configuration model
  70. Inference problems in large random graphs
  71. Connectivity of friends-and-strangers graphs on random pairs
  72. Geometric random graphs on circles
  73. Lower bounds on the chromatic number of random graphs
  74. Covering 3-edge-colored random graphs with monochromatic trees
  75. Spectral planting and the hardness of refuting cuts, colorability, and communities in random graphs
  76.  Solving vertex cover in polynomial time on hyperbolic random graphs
  77.  Two modified Zagreb indices for random structures
  78. System Structure Randomness and Integrity. Random Graphs Models
  79. On the eigenvalues of Erdos-Renyi random bipartite graphs
  80.  Maximum likelihood estimation for discrete exponential families and random graphs
  81. Preferential attachment random graphs with edge-step functions
  82. Investigating several fundamental properties of random lobster trees and random spider trees
  83. Bounds for the Twin-width of Graphs
  84. Seymour’s Second Neighborhood Conjecture on sparse random graphs
  85. FF-factors in Quasi-random Hypergraphs
  86. Generating large scale-free networks with the Chung–Lu random graph model
  87. Empirical spectral distributions of sparse random graphs
  88. Hamiltonicity of random graphs in the stochastic block model
  89. Community detection on Euclidean random graphs
  90. Random subcomplexes and Betti numbers of random edge ideals
  91. Guarantees for Spontaneous Synchronization on Random Geometric Graphs
  92. Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs
  93. Discrete curvature on graphs from the effective resistance
  94. A new proof of the K\LR conjecture
  95. Percolation on random graphs with a fixed degree sequence
  96. Barely supercritical percolation on Poissonian scale-free networks
  97. The size-Ramsey number of cubic graphs
  98. From one-way streets to percolation on random mixed graphs
  99. Edge Augmentation on Disconnected Graphs via Eigenvalue Elevation
  100. Rainbow spanning trees in random edge-colored graphs
  101. First Betti number of the path homology of random directed graphs
  102. New lower bound on the modularity of Johnson graphs
  103. The expected values of Sombor indices in random hexagonal chains, phenylene chains and Sombor indices of some chemical graphs
  104. Extremal independence in discrete random systems
  105. A central limit theorem for singular graphons
  106. Connectivity of 1d random geometric graphs
  107. The threshold for the square of a Hamilton cycle
  108. Limiting probabilities of first order properties of random sparse graphs and hypergraphs
  109. Failure of the simultaneous block diagonalization technique applied to complete and cluster synchronization of random networks
  110. Sums of Distances on Graphs and Embeddings into Euclidean Space
  111. On the upper tail problem for random hypergraphs
  112.  Random Sums and Graphs
  113. A relation between a vertex-degree-based topological index and its energy
  114. Random Topology and Random Multiscale Mapping: An Automated Design of Multiscale and Lightweight Neural Network for Remote-Sensing Image Recognition
  115. Disease extinction for susceptible–infected–susceptible models on dynamic graphs and hypergraphs
  116. Further analysis on structure and spectral properties of symmetric graphs
  117. Learning bollobás-riordan graphs under partial observability
  118. Multiple graph realizations method: improving the accuracy and the efficiency of the shortest path method through random sampling
  119.  The inherent community structure of hyperbolic networks
  120. Property (T) in density-type models of random groups
  121. Large deviation principles for block and step graphon random graph models
  122. Sombor index and degree-related properties of simplicial networks
  123. Analytical and statistical studies of Rodriguez–Velazquez indices
  124. Graphon Filters: Signal Processing in Very Large Graphs
  125. An analogue of Chvátal’s Hamiltonicity theorem for randomly perturbed graphs
  126.  Computational and analytical studies of the harmonic index in Erdös–Rényi models
  127. Symmetry and the entropy of small-world structures and graphs
  128. Quantum annealing initialization of the quantum approximate optimization algorithm
  129. Sparse expanders have negative curvature
  130.  Degree distributions in AB random geometric graphs
  131. Stochastic and worst-case generalized sorting revisited
  132. Large deviations in random Latin squares
  133. Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
  134. Entropy of labeled versus unlabeled networks
  135. Cycle factors in randomly perturbed graphs
  136. Algorithmic upper bounds for graph geodetic number
  137. Normalized Sombor indices as complexity measures of random networks
  138. Long twins in random words
  139. Percolation in complex networks
  140. Entropic dynamics of networks
  141. Analytical results for the distribution of first hitting times of random walks on random regular graphs
  142. A tight condition for triangle factors in pseudorandom graphs
  143. Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
  144. Classical algorithms and quantum limitations for maximum cut on high-girth graphs
  145. The H-property of Line Graphons
  146. Approximately counting independent sets in bipartite graphs via graph containers
  147. Random quantum graphs
  148. The Structure of an Outbreak on a College Campus
  149. Quantum variational optimization: The role of entanglement and problem hardness
  150. Local limit of sparse random planar graphs
  151.  Evolution of ribosomal protein network architectures
  152. Several topological indices of random caterpillars
  153. Network representation using graph root distributions
  154. Phase transition in noisy high-dimensional random geometric graphs
  155. Granger causality among graphs and application to functional brain connectivity in autism spectrum disorder
  156. Symmetry violation of quantum multifractality: Gaussian fluctuations versus algebraic localization
  157.  Large cycles in generalized Johnson graphs
  158.  Graph optimization algorithm for low-latency interconnection networks
  159. Enhanced Forman curvature and its relation to Ollivier curvature
  160. Analytical results for the distribution of first return times of random walks on random regular graphs
  161. Non-concentration of the chromatic number of a random graph
  162. On the connectivity and giant component size of random k-out graphs under randomly deleted nodes
  163. Common graphs with arbitrary chromatic number
  164. The Ising antiferromagnet and max cut on random regular graphs
  165.  Dyads, triads, and tetrads: a multivariate simulation approach to uncovering network motifs in social graphs
  166. Reconstruction of neocortex: Organelles, compartments, cells, circuits, and activity
  167. Proxy Graph Matching with Proximal Matching Networks
  168. Inferring couplings in networks across order-disorder phase transitions
  169. Maker-Breaker games on randomly perturbed graphs
  170. Consistent nonparametric estimation for heavy-tailed sparse graphs
  171. Securing emergent behaviour in swarm robotics
  172. Motif estimation via subgraph sampling: The fourth-moment phenomenon
  173. Entropic barriers as a reason for hardness in both classical and quantum algorithms
  174. Asymptotics of the Independence Number of a Random Subgraph of the Graph
  175. Parameters fixing strategy for quantum approximate optimization algorithm
  176. Learning-augmented algorithms for online steiner tree
  177.  Cryptocurrencies activity as a complex network: Analysis of transactions graphs
  178. Interacting thermofield doubles and critical behavior in random regular graphs
  179. Ollivier-Ricci curvature convergence in random geometric graphs
  180. Distributed scheduling using graph neural networks
  181. The Uniform Infinite Cubic Planar Graph
  182. The overlap gap property: A topological barrier to optimizing over random structures
  183. An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem
  184. On planar graphs of uniform polynomial growth
  185. When network bridges foster consensus. Bounded confidence models in networked societies
  186. Solving graph coloring problem using divide and conquer-based turbulent particle swarm optimization
  187. Universality of cutoff for graphs with an added random matching
  188.  Parallel quantum annealing
  189. Spread of epidemic disease on edge-weighted graphs from a database: A case study of covid-19
  190. Quantum magnetism on small-world networks
  191. The implicit graph conjecture is false
  192. Random simplicial complexes: models and phenomena
  193. Asymptotic behavior of the edge metric dimension of the random graph.
  194. The friendship paradox in real and model networks
  195. First and second moments of the size distribution of bond percolation clusters on regular graphs
  196. Stolarsky-Puebla index
  197. Algebraic approach to the Kuramoto model
  198. Non-linear Hamilton cycles in linear quasi-random hypergraphs
  199. Branching random graph model of rough surfaces describes thermal properties of the effective molecular potential
  200. The connectivity threshold for dense graphs
  201.  Photonic resource state generation from a minimal number of quantum emitters
  202. Minimum k-cores and the k-core polytope
  203. Preferential attachment hypergraph with high modularity
  204.  Markov random fields model and applications to image processing
  205. A proof of Brouwer’s toughness conjecture
  206.  A dynamic programming algorithm for solving the k-Color Shortest Path Problem
  207. Localization game for random geometric graphs
  208. On the H-Property for Step-Graphons and Edge Polytopes
  209. Under the skin of foundation nft auctions
  210. An experimental study of external memory algorithms for connected components
  211. Generative model for reciprocity and community detection in networks
  212.  Quality Evaluation Measures Of Genetic Algorithm And Integer Linear Programming For Minimum Dominating Set Problem
  213. Homology-changing percolation transitions on finite graphs
  214. Longest and shortest cycles in random planar graphs
  215. Analysis of a parallel MCMC algorithm for graph coloring with nearly uniform balancing
  216. Simple quasistationary method for simulations of epidemic processes with localized states
  217. ML4S: Learning Causal Skeleton from Vicinal Graphs
  218. Recent progress in combinatorial random matrix theory
  219.  Graph Sampling Through Graph Decomposition and Reconstruction Based on Kronecker Graphs
  220. Switchover phenomenon induced by epidemic seeding on geometric networks
  221. Backtracking (the) Algorithms on the Hamiltonian Cycle Problem
  222. Quantum algorithm for approximating maximum independent sets
  223. A motif building process for simulating random networks
  224.  Configuration models as an urn problem
  225. The maximum tree of a random forest in the configuration graph
  226. Structure, characteristics and connectivity analysis of the asian-australasian cruise shipping network
  227.  Computational complexity continuum within Ising formulation of NP problems
  228. A simple algorithm for graph reconstruction
  229. Asymptotics of the Number of Endpoints of a Random Walk on a Certain Class of Directed Metric Graphs
  230. fMRI functional connectivity analysis via kernel graph in Alzheimer’s disease
  231. Random generators of Markovian evolution: A quantum-classical transition by superdecoherence
  232. Learning Bayesian networks in the presence of structural side information
  233. Oblivious Stacking and MAX -CUT for Circle Graphs
  234.  Random walk on the random connection model
  235. The expected values and variances for Sombor indices in a general random chain
  236. Rankings in directed configuration models with heavy tailed in-degrees
  237. Common graphs with arbitrary connectivity and chromatic number
  238. A tight lower bound on the matching number of graphs via Laplacian eigenvalues
  239. Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes
  240.  Balanced Neutrosophic Graphs
  241. Note on graphs with irreducible characteristic polynomials
  242. Learning network event sequences using long short-term memory and second-order statistic loss
  243. Parameter-free and cooperative local search algorithms for graph colouring
  244. Assortativity measures for weighted and directed networks
  245. Random Walks on Graphs and Approximation of L2-Invariants
  246. Hamiltonicity of graphs perturbed by a random geometric graph
  247. Rainbow Hamilton cycles in randomly colored randomly perturbed dense graphs
  248. One-step replica symmetry breaking of random regular NAE-SAT
  249. Ranking graphs through hitting times of Markov chains
  250. Combinatorial Optimization, Markov Chains, and Stochastic Automata
  251. On the limits of active module identification
  252. On the size-Ramsey number of grids
  253. Atomic subgraphs and the statistical mechanics of networks
  254. Unions of random trees and applications
  255. Central Limit Theorems for global and local empirical measures of diffusions on Erd\H {o} sR\’enyi graphs
  256. Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
  257.  On Hyperbolic Unit Disk Graphs
  258. Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree
  259. Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport
  260.  Quenched local limit theorem for random walks among time-dependent ergodic degenerate weights
  261. The bridges to consensus: Network effects in a bounded confidence opinion dynamics model
  262. A Note on Fokker–Planck Equations and Graphons
  263. Property (T) in k-gonal random groups
  264. Colouring graphs with forbidden bipartite subgraphs
  265. New benchmarks for learning on non-homophilous graphs
  266. Sequential motifs in observed walks
  267. The Hitting times of random walks on bicyclic graphs
  268.  Neuronal graphs: a graph theory primer for microscopic, functional networks of neurons recorded by Calcium imaging
  269. Combinatorial anti-concentration inequalities, with applications
  270. Subdiffusive Thouless time scaling in the Anderson model on random regular graphs
  271. Household bubbles and COVID-19 transmission: insights from percolation theory
  272. Constrained shortest path problems in bi-colored graphs: a label-setting approach
  273. The Sparse Parity Matrix∗
  274. Higher-order percolation in simplicial complexes
  275. Oriented random walk on the Heisenberg group and percolation
  276. Rates of multivariate normal approximation for statistics in geometric probability
  277. Spectrum of Random -regular Graphs Up to the Edge
  278. Exact formula for bond percolation on cliques
  279. Phase transition in random intersection graphs with communities
  280. Long induced paths in a configuration model
  281. On the edit distance function of the random graph
  282. Matching number, Hamiltonian graphs and magnetic Laplacian matrices
  283. Threshold rates for properties of random codes
  284. A portrait of the collaboration network in quantum information
  285. Generalized k-cores of networks under attack with limited knowledge
  286. Locality of Random Digraphs on Expanders
  287. Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu
  288. Typicality and entropy of processes on infinite trees
  289.  Robustness of noisy quantum networks
  290. Employing fuzzy logic to analyze the structure of complex biological and epidemic spreading models
  291. Geometry of Random Cayley Graphs of Abelian Groups
  292. Graphon convergence of random cographs
  293. Topological theory of resilience and failure spreading in flow networks
  294. Probabilistic analysis of optimization problems on generalized random shortest path metrics
  295.  Probability theory for random groups arising in number theory
  296. A convex principle of search time for a multi-biased random walk on complex networks
  297. Clique is hard on average for regular resolution
  298. On the anti-Ramsey threshold for non-balanced graphs
  299. Convergence of combinatorial gravity
  300. A gentle introduction to the differential equation method and dynamic concentration
  301.  Higher order programming with probabilistic effects: A model of stochastic memoization and name generation
  302. Expansion in supercritical random subgraphs of the hypercube and its consequences
  303. Efficient methods for the distance-based critical node detection problem in complex networks
  304. Large deviations for the largest eigenvalue of Gaussian networks with constant average degree
  305.  Network isolators inhibit failure spreading in complex networks
  306. Connectedness matters: construction and exact random sampling of connected networks
  307. Counting extensions revisited
  308.  On the reduced Sombor index and its applications
  309. Fully retroactive minimum spanning tree problem
  310. Accelerating Louvain community detection algorithm on graphic processing unit
  311.  Random-cluster dynamics on random regular graphs in tree uniqueness
  312. Local topological moves determine global diffusion properties of hyperbolic higher-order networks
  313. The expected values of some indices in random phenylene chains
  314. Application of complex systems topologies in artificial neural networks optimization: An overview
  315. Getting the lay of the land in discrete space: A survey of metric dimension and its applications
  316.  Multi-angle quantum approximate optimization algorithm
  317.  Spectral Theory of Graphons
  318. Approximating the cumulant generating function of triangles in the Erdös–Rényi random graph
  319. RTGEN: A Relative Temporal Graph GENerator
  320. Computational thresholds for the fixed-magnetization Ising model
  321. Hypergraph assortativity: A dynamical systems perspective
  322. More about sparse halves in triangle-free graphs
  323. Inferring pattern generators on networks
  324. Random walks on dense graphs and graphons
  325. Predictor-based H∞ leader-following consensus of stochastic multi-agent systems with random input delay
  326. Chemical subdiffusivity of critical 2D percolation
  327. Tail bounds for gaps between eigenvalues of sparse random matrices
  328. Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
  329. Random graph matching in geometric models: the case of complete graphs
  330. A hybrid list-based task scheduling scheme for heterogeneous computing
  331. Conformal growth rates and spectral geometry on distributional limits of graphs
  332. Counting colorings of triangle-free graphs
  333.  OONIS—Object-oriented network infection simulator
  334. Topological indices computing on random chain structures
  335. Complete minors in graphs without sparse cuts
  336. Size-invariant graph representations for graph classification extrapolations
  337. Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
  338. Curvature graph neural network
  339. From random failures to targeted attacks in network dismantling
  340.  Optimisation of the coalescent hyperbolic embedding of complex networks
  341.  Asymptotic entropy of the Gibbs state of complex networks
  342.  Network embedding from the line graph: Random walkers and boosted classification
  343. On the clique number of noisy random geometric graphs
  344. Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks
  345. Path decompositions of random directed graphs
  346. Partitioning a graph into balanced connected classes: Formulations, separation and experiments
  347.  The Nature of Complex Networks
  348. Community detection in the sparse hypergraph stochastic block model
  349. Link scheduling using graph neural networks
  350. Fréchet distribution in geometric graphs for drone networks
  351. Spectral conditions for graph rigidity in the Euclidean plane
  352. Hamiltonicity of random subgraphs of the hypercube
  353. Invariant embeddings of unimodular random planar graphs
  354. Generalized optimal paths and weight distributions revealed through the large deviations of random walks on networks
  355. Cutoff for random lifts of weighted graphs
  356. Analysing mission-critical cyber-physical systems with AND/OR graphs and MaxSAT
  357. Graphgt: Machine learning datasets for graph generation and transformation
  358. A probabilistic compute fabric based on coupled ring oscillators for solving combinatorial optimization problems
  359. Network hierarchy and pattern recovery in directed sparse Hopfield networks
  360. Hamiltonicity in Cherry-quasirandom 3-graphs
  361. Quasirandom Latin squares
  362. Graph theory approach to detect examinees involved in test collusion
  363. General properties on Sombor indices
  364. Generating a Doppelganger Graph: Resembling but Distinct
  365. Accelerated graph learning from smooth signals
  366. Injective edge-coloring of graphs with given maximum degree
  367. Percolation phase transition in weight-dependent random connection models
  368. Online discriminative graph learning from multi-class smooth signals
  369. Clique minors in graphs with a forbidden subgraph
  370. Exact modularity of line graphs of complete graphs
  371. Matérn Gaussian processes on graphs
  372. An explicit vector algorithm for high-girth MaxCut∗
  373.  Two Approaches to Moderate Deviations in Triangle Count in G (n, m) Graphs
  374.  Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
  375. Leveraging a multiple-strain model with mutations in analyzing the spread of COVID-19
  376. Network reliability: Heading out on the highway
  377. A branching process approach to level-k phylogenetic networks
  378. Rainbow clique subdivisions and blow-ups
  379. Centralities in complex networks
  380. Balanced product quantum codes
  381.  Climate Field Completion via Markov Random Fields: Application to the HadCRUT4. 6 Temperature Dataset
  382. Locally interacting diffusions as Markov random fields on path space
  383. t-SNE, forceful colorings and mean field limits
  384. Dirac’s theorem for random regular graphs
  385. A randomized construction of high girth regular graphs
  386. A probabilistic proof of Cooper and Frieze’s” First Visit Time Lemma”
  387. Hybrid quantum-classical algorithms for approximate graph coloring
  388.  Introduction to graph signal processing
  389. Critical thresholds of benefit distribution in an extended snowdrift game model
  390. Girth, magnitude homology, and phase transition of diagonality
  391.  Long-term changes in the small-world organization of brain networks after concussion
  392. Extremal laws for Laplacian random matrices
  393. Spatiotemporal Patterns in Neurobiology: An Overview for Future Artificial Intelligence
  394. Enhancing the connectivity and resiliency of random key pre-distribution schemes for wireless sensor network
  395. Social graph restoration via random walk sampling
  396. A solution-driven multilevel approach for graph coloring
  397.  Self-induced consensus of Reddit users to characterise the GameStop short squeeze
  398. Counterexamples to a conjecture of Harris on Hall ratio
  399. Machine learning for percolation utilizing auxiliary Ising variables
  400. Entropy of graphs in financial markets
  401. Quantum divide and conquer for combinatorial optimization and distributed computing
  402. Multifractal analysis of eigenvectors of small-world networks
  403. On the spectra of general random mixed graphs
  404. An interaction-based contagion model over temporal networks demonstrates that reducing temporal network density reduces total infection rate
  405.  Geodetic Number Of Circulant Graphs
  406. The low-rank hypothesis of complex systems
  407. Paths, cycles and sprinkling in random hypergraphs
  408. Crux and long cycles in graphs
  409. Improving the filtering of branch-and-bound MDD solve
  410. MSO 0-1 law for recursive random trees
  411. How to Quantify Polarization in Models of Opinion Dynamics
  412. Cutoff for permuted Markov chains
  413. The Expected Number of Perfect Matchings in Cubic Planar Graphs
  414. Functional convergence of sequential U-processes with size-dependent kernels
  415. Reliable federated learning systems based on intelligent resource sharing scheme for big data internet of things
  416. Covering cycles in sparse graphs
  417. Eigenvalues of the non-backtracking operator detached from the bulk
  418.  Visibility graph based temporal community detection with applications in biological time series
  419. How does the chromatic number of a random graph vary?
  420. Supervised average consensus in anonymous dynamic networks
  421. Cutoff for non-negatively curved Markov chains
  422. NetKI: a kirchhoff index based statistical graph embedding in nearly linear time
  423. Estimating the number of communities by spectral methods
  424.  Melonic large N limit of 5-index irreducible random tensors
  425. Shotgun assembly of unlabeled erdos-renyi graphs
  426. Random walks and the universe of districting plans
  427. Quantum Markov chain Monte Carlo with digital dissipative dynamics on quantum computers
  428. AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs
  429.  Community detection methods for directed graphs
  430. CANE: community-aware network embedding via adversarial training
  431. What are higher-order networks?
  432. Regularity lemmas for clustering graphs
  433. Ood-gnn: Out-of-distribution generalized graph neural network
  434. Successive minimum spanning trees
  435. Bipartite, Size, and Online Ramsey Numbers of Some Cycles and Paths
  436. Critical behavior of the Anderson model on the Bethe lattice via a large-deviation approach
  437. Scale-free percolation in continuous space: quenched degree and clustering coefficient
  438. Using machine learning for quantum annealing accuracy prediction
  439.  Meta-validation of bipartite network projections
  440. Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods
  441. The Characterization of Graphs Whose Sandpile Group has Fixed Number of Generators
  442. Ramsey Numbers for Nontrivial Berge Cycles
  443.  Spread of variants of epidemic disease based on the microscopic numerical simulations on networks
  444. The component structure of dense random subgraphs of the hypercube
  445. Detecting interactions in discrete-time dynamics by random variable resetting
  446. Dynamic multicast routing management for robust wide area power grid communication
  447. Are Graph Convolutional Networks With Random Weights Feasible?
  448. On the size-Ramsey number of grid graphs
  449. Max-Cut via Kuramoto-type Oscillators
  450. On the eigenvalue and energy of extended adjacency matrix
  451. Maximum Biplex Search over Bipartite Graphs
  452.  Three-state majority-vote model on small-world networks
  453.  Graphs with minimum vertex-degree function-index for convex functions
  454. Covariance matrices of length power functionals of random geometric graphs–an asymptotic analysis
  455.  The paradox of second-order homophily in networks
  456. Loose cores and cycles in random hypergraphs
  457. When Can Liquid Democracy Unveil the Truth?
  458. A performance study of meta-heuristic approaches for quadratic assignment problem
  459. Inducibility of 4-vertex tournaments
  460. Deterministic search on star graphs via quantum walks
  461. Random cographs: Brownian graphon limit and asymptotic degree distribution
  462. Blowup Ramsey numbers
  463.  Certain properties of domination in product vague graphs with an application in medicine
  464. Convergence rates of limit theorems in random chord diagrams
  465. The spatial inheritance enhances cooperation in weak prisoner’s dilemmas with agents’ exponential lifespan
  466. Coloring Graphs Without Bichromatic Cycles or Paths
  467. Further results on the rainbow vertex-disconnection of graphs
  468. State-of-the-Art development of complex systems and their simulation methods
  469. Testing copositivity via mixed–integer linear programming
  470. Large clique is hard on average for resolution
  471.  Isomorphism for random k-uniform hypergraphs
  472. Inclusivity enhances robustness and efficiency of social networks
  473. Secure fast evaluation of iterative methods: with an application to secure pagerank
  474. Generalized quantum-classical correspondence for random walks on graphs
  475. Quantifying dissimilarities between heterogeneous networks with community structure
  476. Lower Gaussian heat kernel bounds for the random conductance model in a degenerate ergodic environment
  477. Quasirandom graphs and the pantograph equation
  478. Improving branch-and-bound using decision diagrams and reinforcement learning
  479. Eigenvector statistics of Lévy matrices
  480. The size-Ramsey number of short subdivisions
  481. The effect of people recommenders on echo chambers and polarization
  482. The impact of noise and topology on opinion dynamics in social networks
  483.  Modeling higher-order interactions in complex networks by edge product of graphs
  484. Template-based minor embedding for adiabatic quantum optimization
  485.  Local and collective transitions in sparsely-interacting ecological communities
  486.  Effects of mobility restrictions during COVID19 in Italy
  487. Random graph matching with improved noise robustness
  488. Around quantum ergodicity
  489. Scale-free random SAT instances
  490. Design of graph signal sampling matrices for arbitrary signal subspaces
  491. Epidemic inference through generative neural networks
  492. Remarks on random walks on graphs and the Floyd boundary
  493. A new proof of Cayley’s formula
  494. Synchronization in multiplex models of neuron–glial systems: Small-world topology and inhibitory coupling
  495.  A graph mining approach for ranking and discovering the interesting frequent subgraph patterns
  496. Measuring the importance of individual units in producing the collective behavior of a complex network
  497. Graph degree heterogeneity facilitates random walker meetings
  498. Sublinear Random Access Generators for Preferential Attachment Graphs
  499. Strategic evasion of centrality measures
  500. Potential-driven random walks on interconnected systems
  501. Mobile networks-on-chip mapping algorithms for optimization of latency and energy consumption
  502. Efficient and reliable overlay networks for decentralized federated learning
  503. Proof of the contiguity conjecture and lognormal limit for the symmetric perceptron
  504. On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
  505. Of Shadows and Gaps in Spatial Search
  506. A note on the Gaffney Laplacian on infinite metric graphs
  507. Order matters: Probabilistic modeling of node sequence for graph generation
  508.  Expected propagation time for probabilistic zero forcing
  509. A SAT approach to twin-width
  510. Unveiling the Truth in Liquid Democracy with Misinformed Voters
  511. A concentration of measure approach to correlated graph matching
  512. Learning to schedule heuristics in branch and bound
  513. Random Permutations–A geometric point of view
  514. Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
  515. Dynamical algorithms for data mining and machine learning over dynamic graphs
  516. Local boxicity
  517. A note lower bounds for the Estrada index
  518. Some spectral properties of the non-backtracking matrix of a graph
  519. Path to fixation of evolutionary processes in graph-structured populations
  520. Phase transitions of the variety of random-field Potts models
  521. Evaluations of Tutte polynomials of regular graphs
  522. Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
  523. Graph neural networks for graph drawing
  524. Freeness over the diagonal for large random matrices
  525. Notes on the stable regularity lemma
  526. How do hyperedges overlap in real-world hypergraphs?-patterns, measures, and generators
  527. Variance and covariance of distributions on graphs
  528. Toward a universal model for spatially structured populations
  529.  Extremal Sombor indices of tetracyclic (chemical) graphs
  530. A unifying generative model for graph learning algorithms: Label propagation, graph convolutions, and combinations
  531. Anchored expansion of Delaunay complexes in real hyperbolic space and stationary point processes
  532. Random-walk laplacian for frequency analysis in periodic graphs
  533. Ramsey properties of algebraic graphs and hypergraphs
  534. On non-localization of eigenvectors of high girth graphs
  535. Thresholds versus fractional expectation-thresholds
  536. Relative Turán problems for uniform hypergraphs
  537. Community detection in complex networks: From statistical foundations to data science applications
  538. Zero-forcing in random regular graphs
  539. A network-based explanation of inequality perceptions
  540. A general variable neighborhood search for the cyclic antibandwidth problem
  541. A neural network solves, explains, and generates university math problems by program synthesis and few-shot learning at human level
  542. Spatial search on Johnson graphs by continuous-time quantum walk
  543. Fast sampling of satisfying assignments from random -SAT
  544. A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes
  545. Making multigraphs simple by a sequence of double edge swaps
  546. Directed percolation in temporal networks
  547. Exponential growth of random determinants beyond invariance
  548. Generalized k-core percolation on higher-order dependent networks
  549. On the second eigenvalue of random bipartite biregular graphs
  550. Curvature on Graphs via Equilibrium Measures
  551. Bipartite clique minors in graphs of large Hadwiger number
  552.  Variability in higher order structure of noise added to weighted networks
  553. … decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random …
  554. Scalable node-disjoint and edge-disjoint multiwavelength routing
  555. Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth
  556.  On the graphs with minimum Sombor index
  557. On finite mixture modeling and model-based clustering of directed weighted multilayer networks
  558. K-way spectral graph partitioning for load balancing in Parallel Computing
  559. On the influence maximization problem and the percolation phase transition
  560. Automorphisms of random trees
  561. Quantum evolution kernel: Machine learning on graphs with programmable arrays of qubits
  562. Mixing time of fractional random walk on finite fields
  563. Greedy approximation for the minimum connected dominating set with labeling
  564. The method of cumulants for the normal approximation
  565. Return probabilities on nonunimodular transitive graphs
  566. Toward 5G cloud radio access network: An energy and latency perspective
  567. Edge Universality of Sparse Random Matrices
  568. Testing Triangle Freeness in the General Model in Graphs with Arboricity O (√ n)
  569. Memetic Teaching–Learning-Based Optimization algorithms for large graph coloring problems
  570. Unbiased graph embedding with biased graph observations
  571. Uncertainty quantification and testing in a stochastic block model with two unequal communities
  572. Hierarchical graph neural nets can capture long-range interactions
  573.  Secretary problem: graphs, matroids and greedoids
  574. Optimal COVID-19 vaccination strategies with limited vaccine and delivery capabilities: a model based on social networks
  575.  Extremal problems for graphical function-indices and f-weighted adjacency matrix
  576.  Some results on the Sombor indices of graphs
  577. Execution Order Matters in Greedy Algorithms with Limited Information
  578.  Simplicial Complexes in Complex Systems: In Search for Alternatives
  579. Adversarial graph augmentation to improve graph contrastive learning
  580. Bcd nets: Scalable variational approaches for bayesian causal discovery
  581. Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
  582. Epidemic spreading and digital contact tracing: Effects of heterogeneous mixing and quarantine failures
  583. Note on random Latin squares and the triangle removal process
  584. Tangled paths: A random graph model from mallows permutations
  585. The sharp K4-percolation threshold on the Erdős–Rényi random graph
  586. A large-deviations principle for all the components in a sparse inhomogeneous random graph
  587. A survey of the modified Moran process and evolutionary graph theory
  588.  Cognitive cascades: How to model (and potentially counter) the spread of fake news
  589. Expected Values of Some Molecular Descriptors in Random Cyclooctane Chains
  590.  Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints
  591.  Detecting network anomalies using Forman–Ricci curvature and a case study for human brain networks
  592. Online graph dictionary learning
  593. Decentralized cooperative online estimation with random observation matrices, communication graphs and time delays
  594. Factors in randomly perturbed hypergraphs
  595.  Fast and Efficient 𝑛-Metrics for Multiple Graphs
  596.  On the structure of graphs with integer Sombor indices
  597. On testing for parameters in Ising models
  598. Learning to Learn Variational Quantum Algorithm
  599. On the Standard (2, 2)-Conjecture
  600. Universal and unavoidable graphs
  601. Counting partitions of with degree congruence conditions
  602. Bursting synchronization in neuronal assemblies of scale-free networks
  603. The discrepancy of random rectangular matrices
  604. Note on sunflowers
  605. A multiscale network-based model of contagion dynamics: heterogeneity, spatial distancing and vaccination
  606. Causal graphical views of fixed effects and random effects models
  607. Graph toughness from Laplacian eigenvalues
  608. Deep Graph Spectral Evolution Networks for Graph Topological Evolution
  609. Classical symmetries and the quantum approximate optimization algorithm
  610. The wired arboreal gas on regular trees
  611.  Fluctuations of extreme eigenvalues of sparse Erdős–Rényi graphs
  612. Failing to hash into supersingular isogeny graphs
  613. Regular Sparse NOMA: Ultimate Performance in Closed Form
  614. Cutoff for almost all random walks on abelian groups
  615. Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure
  616. From algorithms to connectivity and back: finding a giant component in random k-SAT
  617. Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs
  618. From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers
  619. Stability and Generalization Capabilities of Message Passing Graph Neural Networks
  620. The existence of extremal functions for discrete Sobolev inequalities on lattice graphs
  621. Closing the Random Graph Gap in Tuza’s Conjecture through the Online Triangle Packing Process
  622. Modeling quantum dot systems as random geometric graphs with probability amplitude-based weighted links
  623. Graphon filters: Graph signal processing in the limit
  624. Regional and sectoral structures of the Chinese economy: A network perspective from multi-regional input–output tables
  625. Equation attention relationship network (EARN): A geometric deep metric framework for learning similar math expression embedding
  626.  Rare events in random geometric graphs
  627. Long-loop feedback vertex set and dismantling on bipartite factor graphs
  628. Dynamic concentration of the triangle-free process
  629.  Exploratory graph analysis of the network data of the Ethereum blockchain
  630. The effective graph reveals redundancy, canalization, and control pathways in biochemical regulation and signaling
  631. Support of closed walks and second eigenvalue multiplicity of graphs
  632. Random walks and Laplacians on hypergraphs: When do they match?
  633. QAOAKit: A toolkit for reproducible study, application, and verification of the QAOA
  634. A framework of opinion dynamics using fuzzy linguistic 2-tuples
  635. Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph
  636.  Robustness and efficiency of voting consensus protocols within byzantine infrastructures
  637.  DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries
  638. Incorporating bounds from decision diagrams into integer programming
  639. An overview of epidemic models with phase transitions to absorbing states running on top of complex networks
  640. Correlations among game of thieves and other centrality measures in complex networks
  641. Comparison of approximation algorithms for the travelling salesperson problem on semimetric graphs
  642. Accurately Modeling Biased Random Walks on Weighted Graphs Using
  643. Low-congestion shortcuts for graphs excluding dense minors
  644. A review of latent space models for social networks
  645. Formal method for the synthesis of optimal topologies of computing systems based on the projective description of graphs
  646. Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
  647. On distance graph coloring problems
  648. Social network analysis taxonomy based on graph representation
  649.  Noise-induced barren plateaus in variational quantum algorithms
  650. Saved to My library
  651. Time series analysis via network science: Concepts and algorithms
  652. A modification of the random cutting model
  653. SWFC-ART: A cost-effective approach for Fixed-Size-Candidate-Set Adaptive Random Testing through small world graphs
  654. Simple mathematical models for controlling COVID-19 transmission through social distancing and community awareness
  655.  Influence maximization algorithm based on reverse reachable set
  656. Covering graphs by monochromatic trees and Helly-type results for hypergraphs
  657. Matching a desired causal state via shift interventions
  658. Counting H-free orientations of graphs
  659. Orientations and cycles in supersingular isogeny graphs
  660. Sprinkling a few random edges doubles the power
  661. MPGVAE: improved generation of small organic molecules using message passing neural nets
  662.  The connectome predicts resting-state functional connectivity across the Drosophila brain
  663. Random simplicial complexes, duality and the critical dimension
  664.  Advanced Common Core Math Explorations: Probability and Statistics (Grades 5-8)
  665. Random matrices associated with general barrier billiards
  666. Pearson correlations on complex networks
  667.  Robustness assessment of multimodal freight transport networks
  668. The number of satisfying assignments of random 2-SAT formulas
  669. Pseudorandom Generators, Resolution and Heavy Width
  670. Bounds on approximating Max XOR with quantum and classical local algorithms
  671.  Forecasting elections results via the voter model with stubborn nodes
  672.  A Ramsey–Turán theory for tilings in graphs
  673. Independent dominating sets in graphs of girth five
  674. Rolling backwards can move you forward: on embedding problems in sparse expanders
  675. Making an -Free Graph -Colorable
  676. Degree-preserving graph dynamics–a versatile process to construct random networks
  677. ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs
  678. Recursive contact tracing in Reed–Frost epidemic models
  679.  Concurrence percolation threshold of large-scale quantum networks
  680.  A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
  681. Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem
  682. On the Largest Common Subtree of Random Leaf-Labeled Binary Trees
  683. Barak–Erdős graphs and the infinite-bin model
  684. The size Ramsey number of graphs with bounded treewidth
  685. Transferability Properties of Graph Neural Networks
  686.  Morphological models of random structures
  687. Universality of approximate message passing algorithms and tensor networks
  688. Hat chromatic number of graphs
  689.  Factor of iid schreier decoration of transitive graphs
  690. Spectral large deviations of sparse random matrices
  691. A study of connectivity on dynamic graphs: computing persistent connected components
  692. On Compressing Temporal Graphs
  693. Mixing time of PageRank surfers on sparse random digraphs
  694. On Color Isomorphic Pairs in Proper Edge Colourings of Complete Graphs
  695. Hitting times for non-backtracking random walks
  696. Graph and hypergraph colouring via nibble methods: A survey
  697. Modeling and simulation of secure connectivity and hop count of multi-hop ad-hoc wireless networks with colluding and non-colluding eavesdroppers
  698. Combinatorial optimization with physics-inspired graph neural networks
  699. Expander Random Walks: The General Case and Limitations
  700. A metric on directed graphs and Markov chains based on hitting probabilities
  701. Popularity-similarity random SAT formulas
  702. A Critical Probability for Biclique Partition of
  703. Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity
  704. The localization capture time of a graph
  705. ShortWalk: an approach to network embedding on directed graphs
  706. Path Laplacians versus fractional Laplacians as nonlocal operators on networks
  707. Structural analysis of nanoscale network materials using graph theory
  708.  The strength of weak bots
  709. Belief propagation for networks with loops
  710.  A historical perspective of Tian’s evolution algebras
  711. Generalized spectral clustering via Gromov-Wasserstein learning
  712. Graph distances in scale-free percolation: the logarithmic case
  713. Broadcasting on paths and cycles
  714. Network Robustness Analysis for IoT Networks using Regular Graphs
  715.  Assessing the impact of the density and sparsity of the network on community detection using a Gaussian mixture random partition graph generator
  716. The planted k-factor problem
  717. Expander random walks: A fourier-analytic approach
  718. Longest paths in random hypergraphs
  719. Identifying influential links to control spreading of epidemics
  720. Topological modelling of gas networks for co-simulation applications in multi-energy system
  721. Social dilemmas in off-lattice populations
  722. Hitting all maximum independent sets
  723. Adding negative learning to ant colony optimization: A comprehensive study
  724. On the derivation of mean-field percolation critical exponents from the triangle condition
  725. Delocalization and quantum diffusion of random band matrices in high dimensions I: Self-energy renormalization
  726.  Who does what to whom? graph representations of action-predication in speech relate to psychopathological dimensions of psychosis
  727. Persistence of information flow: A multiscale characterization of human brain
  728. Distributed algorithms to determine eigenvectors of matrices on spatially distributed networks
  729. A multilayer network model of the coevolution of the spread of a disease and competing opinions
  730. Entropic independence: optimal mixing of down-up random walks
  731. Factor-of-iid balanced orientation of non-amenable graphs
  732.  Mobility-based SIR model for complex networks: with case study Of COVID-19
  733. Higher-order relations skew link prediction in graphs
  734. A new approach to finding the extra connectivity of graphs
  735. Large complete minors in random subgraphs
  736. Interest clustering coefficient: a new metric for directed networks like Twitter
  737. A comparative study of polynomial-type chaos expansions for indicator functions
  738. Erdos-Hajnal for graphs with no 5-hole
  739. Well-mixing vertices and almost expanders
  740. High-performance computing implementations of agent-based economic models for realizing 1: 1 scale simulations of large economies
  741.  Regularity of extended conjugate graphs of finite groups
  742. The Probability of Encounters of Mutual Search Using Lévy Walk on Unit Disk Graphs
  743. Hamiltonian Berge cycles in random hypergraphs
  744. Graph neural network initialisation of quantum approximate optimisation
  745. Evolution of cooperation in heterogeneously stochastic interactions
  746.  Percolation on feature-enriched interconnected systems
  747. Homological percolation transitions in growing simplicial complexes
  748. Topological embeddings into random 2-complexes
  749. Ordering chemical graphs by Sombor indices and its applications
  750. Two problems in extremal combinatorics
  751. Bipartite independence number in graphs with bounded maximum degree
  752. Graphon signal processing
  753.  Hidden network generating rules from partially observed complex networks
  754. Heider balance under disordered triadic interactions
  755. Anomaly detection for big data using efficient techniques: A review
  756.  Accrual of functional redundancy along the lifespan and its effects on cognition
  757. On spectral algorithms for community detection in stochastic blockmodel graphs with vertex covariates
  758. On some graph densities in locally dense graphs
  759. Singularity of sparse random matrices: simple proofs
  760. Longitudinal network models and permutation-uniform Markov chains
  761.  Random tensor theory for tensor decomposition
  762. Bridged Hamiltonian Cycles in Sub-critical Random Geometric Graphs
  763. Sharp threshold for the Erdős–Ko–Rado theorem
  764. Degree-preserving network growth
  765. Network Analysis of Local Gene Regulators in Arabidopsis thaliana under Spaceflight Stress
  766. Joint distribution of the cokernels of random -adic matrices
  767. LQG graphon mean field games: Graphon invariant subspaces
  768. The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
  769.  Interplay between epidemic spread and information diffusion on two-layered networks with partial mapping
  770. Deterministic fast scrambling with neutral atom arrays
  771. On fast computations of numerical parameters of homogeneous algebraic graphs of large girth and small diameter and encryption of large files.
  772. Phase transitions of Best-of-two and Best-of-three on stochastic block models
  773. Modeling multi-scale data via a network of networks
  774. Randomly stopped extreme Zipf extensions
  775. Competing spreading dynamics in simplicial complex
  776. Assemblies of neurons can learn to classify well-separated distributions
  777. General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching
  778.  Eigenstate thermalization hypothesis for Wigner matrices
  779. Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs
  780. Algorithms and complexity of power domination in graphs
  781. Diffusion profile embedding as a basis for graph vertex similarity
  782. Covid-19 epidemic under the K-quarantine model: Network approach
  783. Neuronal avalanches in Watts-Strogatz networks of stochastic spiking neurons
  784. Learn to improve: A novel deep reinforcement learning approach for beyond 5G network slicing
  785. Superlinear elliptic inequalities on weighted graphs
  786.  Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
  787. Dynamical phases in amultifractal”Rosenzweig-Porter model
  788. Selfish creation of social networks
  789. Dynamic hidden-variable network models
  790. The Gross–Saccoman conjecture is true
  791. Asymptotically efficient estimators for stochastic blockmodels: The naive MLE, the rank-constrained MLE, and the spectral estimator
  792. Meyniel extremal families of Abelian Cayley graphs
  793. Urban sensing as a random search process
  794. Circular inference predicts nonuniform overactivation and dysconnectivity in brain-wide connectomes
  795. Numerically efficient computation of the survival signature for the reliability analysis of large networks
  796. Software reuse analytics using integrated random forest and gradient boosting machine learning algorithm
  797. Weak local limit of preferential attachment random trees with additive fitness
  798. Increased segregation of structural brain networks underpins enhanced broad cognitive abilities of cognitive training
  799.  A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
  800. A nonamenable “factor” of a Euclidean space
  801. Kr-factors in graphs with low independence number
  802. Extremal problems on Sombor indices of unicyclic graphs with a given diameter
  803. Improved clustering algorithms for the bipartite stochastic block model
  804. Directed polymers on infinite graphs
  805. Kleinberg’s Navigation in Fractal Small-World Networks by Dynamic Rejection Sampling
  806. The average order of dominating sets of a graph
  807.  Growing urban bicycle networks
  808. Theory of chain walking catalysis: From disordered dendrimers to dendritic bottle-brushes
  809. About weighted random sampling in preferential attachment models
  810. Height function delocalisation on cubic planar graphs
  811.  COVIDrugNet: a network-based web tool to investigate the drugs currently in clinical trial to contrast COVID-19
  812. Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
  813. Spin systems with hyperbolic symmetry: a survey
  814. Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?
  815. Graph-based technique for survivability assessment and optimization of IoT applications
  816.  Finite representation of reaction kinetics in unbounded biopolymer structures
  817. General graph generators: experiments, analyses, and improvements
  818. A phase transition for repeated averages
  819. Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
  820. On the resilience of modern power systems: A complex network perspective
  821. Optimal Targeting in Super-Modular Games
  822. Scheduling energy-conscious tasks in distributed heterogeneous computing systems
  823. Dirichlet energy constrained learning for deep graph neural networks
  824. Scaling limits for the Gibbs states on distance-regular graphs with classical parameters
  825. Transferability of graph neural networks: an extended graphon approach
  826. Geometry, topology and simplicial synchronization
  827.  Agent-based computational epidemiological modeling
  828. Tournaments, Johnson Graphs, and NC-Teaching
  829.  Searching for small-world and scale-free behaviour in long-term historical data of a real-world power grid
  830. Design and Analysis of NB QC-LDPC Codes Over Small Alphabets
  831. Graphon mean field games and their equations
  832. Size-Ramsey numbers of powers of hypergraph trees and long subdivisions
  833. Explicit Abelian Lifts and Quantum LDPC Codes
  834. Three types of Kirchhoff indices in the random cyclooctane chains
  835. Generative Algorithm for Molecular Graphs Uncovers Products of Oil Oxidation
  836. Variational Inference in high-dimensional linear regression
  837. Hybrid multiagent collaboration for time-critical tasks: a mathematical model and heuristic approach
  838.  Characterization of vulnerability of road networks to random and nonrandom disruptions using network percolation approach
  839. Weighted connected vertex cover based energy-efficient link monitoring for wireless sensor networks towards secure internet of things
  840. Quantum spin systems for measurement-based quantum computation
  841. Disentangling homophily, community structure, and triadic closure in networks
  842.  Strong Cliques in Claw-Free Graphs
  843. Knowledge base question answering by case-based reasoning over subgraphs
  844. Perturbative quantum field theory on random trees
  845. The component counts of random injections
  846. Hamilton transversals in random Latin squares
  847. When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
  848. Some relation between spectral dimension and Ahlfors regular conformal dimension on infinite graphs
  849. Cayley Graphs and Probability Isomorphic Groups
  850. Solving Tur\’an’s Tetrahedron Problem for the -Norm
  851. Network Analysis Based on Important Node Selection and Community Detection
  852. Near-perfect clique-factors in sparse pseudorandom graphs
  853. An adaptive spectral graph wavelet method for PDEs on networks
  854. TrammelGraph: visual graph abstraction for comparison
  855. Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
  856.  Homological scaffold via minimal homology bases
  857. VisGraphNet: A complex network interpretation of convolutional neural features
  858. Algebraic and combinatorial expansion in random simplicial complexes
  859. Provenance-based algorithms for rich queries over graph databases
  860. Leveraging the self-transition probability of ordinal patterns transition network for transportation mode identification based on GPS data
  861. A theory of evolutionary dynamics on any complex spatial structure
  862. A survey on mining and analysis of uncertain graphs
  863. Efficient route selection for drone-based delivery under time-varying dynamics
  864. An up-to-date review of scan statistics
  865.  A ribbon graph derivation of the algebra of functional renormalization for random multi-matrices with multi-trace interactions
  866. Random translation-invariant Hamiltonians and their spectral gaps
  867. Do higher-order interactions promote synchronization?
  868. Boolean matrix factorization via nonnegative auxiliary optimization
  869. Evolutionary game on a growing multilayer network
  870. Large expanders in high genus unicellular maps
  871. The harmonic mean formula for random processes
  872. A direct comparison between the mixing time of the interchange process with” few” particles and independent random walks
  873. A framework for optimal quantum spatial search using alternating phase-walks
  874. NTS-NOTEARS: Learning Nonparametric Temporal DAGs With Time-Series Data and Prior Knowledge
  875. Fast iterative solution of the optimal transport problem on graphs
  876. On maximal cliques of Cayley graphs over fields
  877.  Sublinear domination and core–periphery networks
  878. Enumerating alternating matrix spaces over finite fields with explicit coordinates
  879. The 1–2–3 conjecture almost holds for regular graphs
  880. Dyed fabric illumination estimation with regularized random vector function link network
  881.  Asymptotic behaviors of random walks on countable groups
  882.  Fixation probabilities in network structured meta-populations
  883. Functional Gaussian approximations in Hilbert spaces: the non-diffusive case
  884. Graph tikhonov regularization and interpolation via random spanning forests
  885. Information technologies for analysis and modeling of computer network’s development
  886. Entanglement negativity spectrum of random mixed states: A diagrammatic approach
  887. Tight Ramsey bounds for multiple copies of a graph
  888. Approximate counting and sampling via local central limit theorems
  889. Random 2-cell embeddings of multistars
  890. Minimal constraints in the parity formulation of optimization problems
  891. Robust analysis of cascading failures in complex networks
  892. The complexity of average-case dynamic subgraph counting
  893. List-decodability with large radius for Reed-Solomon codes
  894. Comparing unified, pinned, and host/device memory allocations for memory-intensive workloads on Tegra SoC
  895.  Loss of structural balance in stock markets
  896. A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
  897. A network-based explanation of perceived inequality
  898. Regularity method and large deviation principles for the Erd\H {o} s–R\’enyi hypergraph
  899. Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
  900. Nonlocal diffusion of variable order on graphs
  901. Local convergence of random planar graphs
  902. Gaussian Whittle-Mat\’ern fields on metric graphs
  903. Stochastic quorum percolation and noise focusing in neuronal networks
  904. Geometric Structure and Ergodic Properties of Bony Multi-Graphs
  905.  Finite state graphon games with applications to epidemics
  906. Categorical data structures for technical computing
  907. Diva: A scalable, interactive and customizable visual analytics platform for information diffusion on large networks
  908. Learning sparse graph with minimax concave penalty under gaussian markov random fields
  909. Towards the characterization of realistic model generators using graph neural networks
  910.  Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature
  911. A decomposition of student achievement gap by gender in China: Evidence from random class assignment
  912.  Propagation source identification of infectious diseases with graph convolutional networks
  913. Directed percolation in random temporal network models with heterogeneities
  914. Chimeras unfolded
  915. Herd immunity and epidemic size in networks with vaccination homophily
  916. Identification of edge disconnections in networks based on graph filter outputs
  917. Spatial search on Johnson graphs by discrete-time quantum walk
  918. Optimal mixing time for the Ising model in the uniqueness regime
  919. Integer programming for learning directed acyclic graphs from continuous data
  920.  Evolution of networks of protein domain organization
  921. The dual challenge of search and coordination for organizational adaptation: how structures of influence matter
  922. Information-driven path planning
  923. Inferential statistical reasoning of math teachers: Experiences in virtual contexts generated by the COVID-19 pandemic
  924. An Overlapping Community Detection Approach in Ego-Splitting Networks Using Symmetric Nonnegative Matrix Factorization
  925. Models of random subtrees of a graph
  926. Site percolation and isoperimetric inequalities for plane graphs
  927. Math matters: A novel, brief educational intervention decreases whole number bias when reasoning about COVID-19.
  928. Choice number of Kneser graphs
  929. On Realizing a Single Degree Sequence by a Bipartite Graph
  930. A survey of reconfigurable optical networks
  931. Shortest paths in graphs of convex sets
  932. A novel measure inspired by Lyapunov exponents for the characterization of dynamics in state-transition networks
  933. Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
  934. Schauder estimate for quasilinear discrete PDEs of parabolic type
  935.  A comprehensive analysis of the correlation between maximal clique size and centrality metrics for complex network graphs
  936. Collective behavior of multileader multiagent systems with random interactions over signed digraphs
  937. Frozen 1-RSB structure of the symmetric Ising perceptron
  938. Algebraic Identification of Smart Systems
  939. Classical and quantum random-walk centrality measures in multilayer networks
  940. On 3-graphs with no four vertices spanning exactly two edges
  941. Ollivier persistent ricci curvature-based machine learning for the protein–ligand binding affinity prediction
  942. Cascading failures of overload behaviors on interdependent networks
  943. Benchpress: a scalable and platform-independent workflow for benchmarking structure learning algorithms for graphical models
  944. Mass scaling of the near-critical 2D Ising model using random currents
  945. Impact of graph structures for QAOA on MaxCut
  946. Sampling from the low temperature Potts model through a Markov chain on flows
  947. Simplicial SIRS epidemic models with nonlinear incidence rates
  948. A model of COVID-19 propagation based on a gamma subordinated negative binomial branching process
  949.  Reputation based on edge dynamics promotes cooperative behavior
  950. Allocating resources for epidemic spreading on metapopulation networks
  951. Circuit lower bounds for the p-spin optimization problem
  952. Content-based and knowledge graph-based paper recommendation: Exploring user preferences with the knowledge graphs for scientific paper recommendation
  953.  Reference to global state and social contagion dynamics
  954. High-order structure exploration on massive graphs: A local graph clustering perspective
  955. Effects of asymptomatic infection and self-initiated awareness on the coupled disease-awareness dynamics in multiplex networks
  956. Limits and consistency of non-local and graph approximations to the Eikonal equation
  957. Correlation decay and the absence of zeros property of partition functions
  958. Multilevel approaches for the critical node problem
  959. Information sources estimation in time-varying networks
  960. Integrating emotion-imitating into strategy learning improves cooperation in social dilemmas with extortion
  961. Efficient node selection strategy for sampling bandlimited signals on graphs
  962. Mean-field limit of non-exchangeable systems
  963. Network Shuffling: Privacy Amplification via Random Walks
  964.  Scarcity of scale-free topology is universal across biochemical networks
  965. Neutral quasispecies evolution and the maximal entropy random walk
  966. Homomorphism complexes, reconfiguration, and homotopy for directed graphs
  967. Galton–Watson games
  968. Structural heterogeneity and evolutionary dynamics on complex networks
  969. A General Framework for Hypergraph Coloring
  970. Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
  971. On triangle-free list assignments
  972. Hypergrid subgraphs and the origin of scarred quantum walks in many-body Hilbert space
  973. Reflecting on prediction strategies for epidemics: Preparedness and public health response
  974.  Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
  975.  Supercritical percolation on nonamenable graphs: Isoperimetry, analyticity, and exponential decay of the cluster size distribution
  976. bioMCS 2.0: A distributed, energy-aware fog-based framework for data forwarding in mobile crowdsensing
  977. Perfect state transfer on weighted abelian Cayley graphs
  978. Lower bounds on the clique-chromatic numbers of some distance graphs
  979. A practical test for a planted community in heterogeneous networks
  980. Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
  981. Gaussian approximation for rooted edges in a random minimal directed spanning tree
  982.  The interplay between communities and homophily in semi-supervised classification using graph neural networks
  983. Accessibility: A Generalization of the Node Degree (A Tutorial)
  984. -intersecting families of graphs
  985. Evaluating Node embeddings of complex networks
  986. Symmetry classification and universality in non-Hermitian many-body quantum chaos by the Sachdev-Ye-Kitaev model
  987. Learning combinatorial node labeling algorithms
  988. Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
  989. Coprime mappings and lonely runners
  990. Controllability of Network Opinion in Erdös–Rényi Graphs Using Sparse Control Inputs
  991. Homological connectivity in random Čech complexes
  992.  Dynamical Sampling on Graphs
  993.  Two remarks on graph norms
  994. A Note on Consistent Rotation Maps of Graph Cartesian Products
  995. Maximum values of degree-based entropies of bipartite graphs
  996.  Intelligent Media Forensics and Traffic Handling Scheme in 5G Edge Networks
  997. An exact method for the minimum feedback arc set problem
  998. Subcubic algorithms for Gomory–Hu tree in unweighted graphs
  999. Optimal non-convex exact recovery in stochastic block model via projected power method
  1000. Phase transitions of the k-majority dynamics in a biased communication model
Prof.Fazal Rehman Shamil (Available for Professional Discussions)
1. Message on Facebook page for discussions,
2. Video lectures on Youtube
3. Email is only for Advertisement/business enquiries.