**Research Area/ Research Interest: Random Graphs**

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

- Random triangles in random graphs
- Large deviations of the greedy independent set algorithm on sparse random graphs
- Color-biased Hamilton cycles in random graphs
- Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
- Ramsey Goodness of Clique Versus Paths in Random Graphs
- Toughness in pseudo-random graphs
- Mixed connectivity properties of random graphs and some special graphs
- Fast uniform generation of random graphs with given degree sequences
- Upper tail for homomorphism counts in constrained sparse random graphs
- Bipartite Ramsey Numbers of Cycles for Random Graphs
- Cycle lengths in sparse random graphs
- Residual2Vec: Debiasing graph embedding with random graphs
- A note on the majority dynamics in inhomogeneous random graphs
- Number of edges in inhomogeneous random graphs
- Exact matching of random graphs with constant correlation
- Note on induced paths in sparse random graphs
- The birth of geometry in exponential random graphs
- Spectral gaps of random graphs and applications
- Flooding in weighted sparse random graphs of active and passive nodes
- Tuza’s conjecture for random graphs
- Friendly bisections of random graphs
- An analogue of the Erdős–Gallai theorem for random graphs
- Discontinuous phase transitions in the q-voter model with generalized anticonformity on random graphs
- Exponential Inequalities for the Distribution Tails of the Number of Cycles in the Erdös-Rényi Random Graphs
- A probabilistic approach to the leader problem in random graphs
- Generalization Analysis of Message Passing Neural Networks on Large Random Graphs
- Ramsey simplicity of random graphs
- Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
- Large induced matchings in random graphs
- Chemical distance in geometric random graphs with long edges and scale-free degree distribution
- Ferromagnetic and spin-glass like transition in the q-neighbor Ising model on random graphs
- A very sharp threshold for first order logic distinguishability of random graphs
- Monochromatic cycle partitions in random graphs
- Random graphs with prescribed k-core sequences: A new null model for network analysis
- Data Encryption Basing on the Existence of Eulerian Circuits in a Group of Random Graphs
- On breadth-first constructions of scaling limits of random graphs and random unicellular maps
- The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
- Localization game for random graphs
- Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs
- Pandemic spread in communities via random graphs
- Ferromagnetic and spin-glass like transition in the q-neighbor Ising model on random graphs
- A very sharp threshold for first order logic distinguishability of random graphs
- Monochromatic cycle partitions in random graphs
- Random graphs with prescribed k-core sequences: A new null model for network analysis
- Data Encryption Basing on the Existence of Eulerian Circuits in a Group of Random Graphs
- On breadth-first constructions of scaling limits of random graphs and random unicellular maps
- The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
- Localization game for random graphs
- Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs
- Pandemic spread in communities via random graphs
- Entrywise limit theorems of eigenvectors and their one-step refinement for sparse random graphs
- Sharp Threshold for the Frechet Mean (or Median) of Inhomogeneous Erdos-Renyi Random Graphs
- On the performance of the Depth First Search algorithm in supercritical random graphs
- Emergence of extended states at zero in the spectrum of sparse random graphs
- An elementary approach to component sizes in some critical random graphs
- Graphical construction of spatial Gibbs random graphs
- Random graphs embeddable in order-dependent surfaces
- Random graphs with node and block effects: models, goodness-of-fit tests, and applications to biological networks
- Aligning random graphs with a sub-tree similarity message-passing algorithm
- Localization and universality of eigenvectors in directed random graphs
- Large Deviation Principle for the Maximal Eigenvalue of Inhomogeneous Erdős-Rényi Random Graphs
- Local limits of spatial inhomogeneous random graphs
- The fewest-big-jumps principle and an application to random graphs
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- Site percolation on pseudo-random graphs
- Stability of clusters in the second-order Kuramoto model on random graphs
- … : The random field XY model on sparse random graphs shows replica symmetry breaking and marginally stable ferromagnetism (2019 J. Phys. A: Math …
- The upper tail problem for induced 4-cycles in sparse random graphs
- Critical percolation on scale-free random graphs: New universality class for the configuration model
- Inference problems in large random graphs
- Connectivity of friends-and-strangers graphs on random pairs
- Geometric random graphs on circles
- Lower bounds on the chromatic number of random graphs
- Covering 3-edge-colored random graphs with monochromatic trees
- Spectral planting and the hardness of refuting cuts, colorability, and communities in random graphs
- Solving vertex cover in polynomial time on hyperbolic random graphs
- Two modified Zagreb indices for random structures
- System Structure Randomness and Integrity. Random Graphs Models
- On the eigenvalues of Erdos-Renyi random bipartite graphs
- Maximum likelihood estimation for discrete exponential families and random graphs
- Preferential attachment random graphs with edge-step functions
- Investigating several fundamental properties of random lobster trees and random spider trees
- Bounds for the Twin-width of Graphs
- Seymour’s Second Neighborhood Conjecture on sparse random graphs
- FF-factors in Quasi-random Hypergraphs
- Generating large scale-free networks with the Chung–Lu random graph model
- Empirical spectral distributions of sparse random graphs
- Hamiltonicity of random graphs in the stochastic block model
- Community detection on Euclidean random graphs
- Random subcomplexes and Betti numbers of random edge ideals
- Guarantees for Spontaneous Synchronization on Random Geometric Graphs
- Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs
- Discrete curvature on graphs from the effective resistance
- A new proof of the K\LR conjecture
- Percolation on random graphs with a fixed degree sequence
- Barely supercritical percolation on Poissonian scale-free networks
- The size-Ramsey number of cubic graphs
- From one-way streets to percolation on random mixed graphs
- Edge Augmentation on Disconnected Graphs via Eigenvalue Elevation
- Rainbow spanning trees in random edge-colored graphs
- First Betti number of the path homology of random directed graphs
- New lower bound on the modularity of Johnson graphs
- The expected values of Sombor indices in random hexagonal chains, phenylene chains and Sombor indices of some chemical graphs
- Extremal independence in discrete random systems
- A central limit theorem for singular graphons
- Connectivity of 1d random geometric graphs
- The threshold for the square of a Hamilton cycle
- Limiting probabilities of first order properties of random sparse graphs and hypergraphs
- Failure of the simultaneous block diagonalization technique applied to complete and cluster synchronization of random networks
- Sums of Distances on Graphs and Embeddings into Euclidean Space
- On the upper tail problem for random hypergraphs
- Random Sums and Graphs
- A relation between a vertex-degree-based topological index and its energy
- Random Topology and Random Multiscale Mapping: An Automated Design of Multiscale and Lightweight Neural Network for Remote-Sensing Image Recognition
- Disease extinction for susceptible–infected–susceptible models on dynamic graphs and hypergraphs
- Further analysis on structure and spectral properties of symmetric graphs
- Learning bollobás-riordan graphs under partial observability
- Multiple graph realizations method: improving the accuracy and the efficiency of the shortest path method through random sampling
- The inherent community structure of hyperbolic networks
- Property (T) in density-type models of random groups
- Large deviation principles for block and step graphon random graph models
- Sombor index and degree-related properties of simplicial networks
- Analytical and statistical studies of Rodriguez–Velazquez indices
- Graphon Filters: Signal Processing in Very Large Graphs
- An analogue of Chvátal’s Hamiltonicity theorem for randomly perturbed graphs
- Computational and analytical studies of the harmonic index in Erdös–Rényi models
- Symmetry and the entropy of small-world structures and graphs
- Quantum annealing initialization of the quantum approximate optimization algorithm
- Sparse expanders have negative curvature
- Degree distributions in AB random geometric graphs
- Stochastic and worst-case generalized sorting revisited
- Large deviations in random Latin squares
- Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
- Entropy of labeled versus unlabeled networks
- Cycle factors in randomly perturbed graphs
- Algorithmic upper bounds for graph geodetic number
- Normalized Sombor indices as complexity measures of random networks
- Long twins in random words
- Percolation in complex networks
- Entropic dynamics of networks
- Analytical results for the distribution of first hitting times of random walks on random regular graphs
- A tight condition for triangle factors in pseudorandom graphs
- Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
- Classical algorithms and quantum limitations for maximum cut on high-girth graphs
- The H-property of Line Graphons
- Approximately counting independent sets in bipartite graphs via graph containers
- Random quantum graphs
- The Structure of an Outbreak on a College Campus
- Quantum variational optimization: The role of entanglement and problem hardness
- Local limit of sparse random planar graphs
- Evolution of ribosomal protein network architectures
- Several topological indices of random caterpillars
- Network representation using graph root distributions
- Phase transition in noisy high-dimensional random geometric graphs
- Granger causality among graphs and application to functional brain connectivity in autism spectrum disorder
- Symmetry violation of quantum multifractality: Gaussian fluctuations versus algebraic localization
- Large cycles in generalized Johnson graphs
- Graph optimization algorithm for low-latency interconnection networks
- Enhanced Forman curvature and its relation to Ollivier curvature
- Analytical results for the distribution of first return times of random walks on random regular graphs
- Non-concentration of the chromatic number of a random graph
- On the connectivity and giant component size of random k-out graphs under randomly deleted nodes
- Common graphs with arbitrary chromatic number
- The Ising antiferromagnet and max cut on random regular graphs
- Dyads, triads, and tetrads: a multivariate simulation approach to uncovering network motifs in social graphs
- Reconstruction of neocortex: Organelles, compartments, cells, circuits, and activity
- Proxy Graph Matching with Proximal Matching Networks
- Inferring couplings in networks across order-disorder phase transitions
- Maker-Breaker games on randomly perturbed graphs
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Securing emergent behaviour in swarm robotics
- Motif estimation via subgraph sampling: The fourth-moment phenomenon
- Entropic barriers as a reason for hardness in both classical and quantum algorithms
- Asymptotics of the Independence Number of a Random Subgraph of the Graph
- Parameters fixing strategy for quantum approximate optimization algorithm
- Learning-augmented algorithms for online steiner tree
- Cryptocurrencies activity as a complex network: Analysis of transactions graphs
- Interacting thermofield doubles and critical behavior in random regular graphs
- Ollivier-Ricci curvature convergence in random geometric graphs
- Distributed scheduling using graph neural networks
- The Uniform Infinite Cubic Planar Graph
- The overlap gap property: A topological barrier to optimizing over random structures
- An improved lower bound for multicolor Ramsey numbers and the half-multiplicity Ramsey number problem
- On planar graphs of uniform polynomial growth
- When network bridges foster consensus. Bounded confidence models in networked societies
- Solving graph coloring problem using divide and conquer-based turbulent particle swarm optimization
- Universality of cutoff for graphs with an added random matching
- Parallel quantum annealing
- Spread of epidemic disease on edge-weighted graphs from a database: A case study of covid-19
- Quantum magnetism on small-world networks
- The implicit graph conjecture is false
- Random simplicial complexes: models and phenomena
- Asymptotic behavior of the edge metric dimension of the random graph.
- The friendship paradox in real and model networks
- First and second moments of the size distribution of bond percolation clusters on regular graphs
- Stolarsky-Puebla index
- Algebraic approach to the Kuramoto model
- Non-linear Hamilton cycles in linear quasi-random hypergraphs
- Branching random graph model of rough surfaces describes thermal properties of the effective molecular potential
- The connectivity threshold for dense graphs
- Photonic resource state generation from a minimal number of quantum emitters
- Minimum k-cores and the k-core polytope
- Preferential attachment hypergraph with high modularity
- Markov random fields model and applications to image processing
- A proof of Brouwer’s toughness conjecture
- A dynamic programming algorithm for solving the k-Color Shortest Path Problem
- Localization game for random geometric graphs
- On the H-Property for Step-Graphons and Edge Polytopes
- Under the skin of foundation nft auctions
- An experimental study of external memory algorithms for connected components
- Generative model for reciprocity and community detection in networks
- Quality Evaluation Measures Of Genetic Algorithm And Integer Linear Programming For Minimum Dominating Set Problem
- Homology-changing percolation transitions on finite graphs
- Longest and shortest cycles in random planar graphs
- Analysis of a parallel MCMC algorithm for graph coloring with nearly uniform balancing
- Simple quasistationary method for simulations of epidemic processes with localized states
- ML4S: Learning Causal Skeleton from Vicinal Graphs
- Recent progress in combinatorial random matrix theory
- Graph Sampling Through Graph Decomposition and Reconstruction Based on Kronecker Graphs
- Switchover phenomenon induced by epidemic seeding on geometric networks
- Backtracking (the) Algorithms on the Hamiltonian Cycle Problem
- Quantum algorithm for approximating maximum independent sets
- A motif building process for simulating random networks
- Configuration models as an urn problem
- The maximum tree of a random forest in the configuration graph
- Structure, characteristics and connectivity analysis of the asian-australasian cruise shipping network
- Computational complexity continuum within Ising formulation of NP problems
- A simple algorithm for graph reconstruction
- Asymptotics of the Number of Endpoints of a Random Walk on a Certain Class of Directed Metric Graphs
- fMRI functional connectivity analysis via kernel graph in Alzheimer’s disease
- Random generators of Markovian evolution: A quantum-classical transition by superdecoherence
- Learning Bayesian networks in the presence of structural side information
- Oblivious Stacking and MAX -CUT for Circle Graphs
- Random walk on the random connection model
- The expected values and variances for Sombor indices in a general random chain
- Rankings in directed configuration models with heavy tailed in-degrees
- Common graphs with arbitrary connectivity and chromatic number
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes
- Balanced Neutrosophic Graphs
- Note on graphs with irreducible characteristic polynomials
- Learning network event sequences using long short-term memory and second-order statistic loss
- Parameter-free and cooperative local search algorithms for graph colouring
- Assortativity measures for weighted and directed networks
- Random Walks on Graphs and Approximation of L2-Invariants
- Hamiltonicity of graphs perturbed by a random geometric graph
- Rainbow Hamilton cycles in randomly colored randomly perturbed dense graphs
- One-step replica symmetry breaking of random regular NAE-SAT
- Ranking graphs through hitting times of Markov chains
- Combinatorial Optimization, Markov Chains, and Stochastic Automata
- On the limits of active module identification
- On the size-Ramsey number of grids
- Atomic subgraphs and the statistical mechanics of networks
- Unions of random trees and applications
- Central Limit Theorems for global and local empirical measures of diffusions on Erd\H {o} sR\’enyi graphs
- Spectral clustering under degree heterogeneity: a case for the random walk Laplacian
- On Hyperbolic Unit Disk Graphs
- Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree
- Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport
- Quenched local limit theorem for random walks among time-dependent ergodic degenerate weights
- The bridges to consensus: Network effects in a bounded confidence opinion dynamics model
- A Note on Fokker–Planck Equations and Graphons
- Property (T) in k-gonal random groups
- Colouring graphs with forbidden bipartite subgraphs
- New benchmarks for learning on non-homophilous graphs
- Sequential motifs in observed walks
- The Hitting times of random walks on bicyclic graphs
- Neuronal graphs: a graph theory primer for microscopic, functional networks of neurons recorded by Calcium imaging
- Combinatorial anti-concentration inequalities, with applications
- Subdiffusive Thouless time scaling in the Anderson model on random regular graphs
- Household bubbles and COVID-19 transmission: insights from percolation theory
- Constrained shortest path problems in bi-colored graphs: a label-setting approach
- The Sparse Parity Matrix∗
- Higher-order percolation in simplicial complexes
- Oriented random walk on the Heisenberg group and percolation
- Rates of multivariate normal approximation for statistics in geometric probability
- Spectrum of Random -regular Graphs Up to the Edge
- Exact formula for bond percolation on cliques
- Phase transition in random intersection graphs with communities
- Long induced paths in a configuration model
- On the edit distance function of the random graph
- Matching number, Hamiltonian graphs and magnetic Laplacian matrices
- Threshold rates for properties of random codes
- A portrait of the collaboration network in quantum information
- Generalized k-cores of networks under attack with limited knowledge
- Locality of Random Digraphs on Expanders
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu
- Typicality and entropy of processes on infinite trees
- Robustness of noisy quantum networks
- Employing fuzzy logic to analyze the structure of complex biological and epidemic spreading models
- Geometry of Random Cayley Graphs of Abelian Groups
- Graphon convergence of random cographs
- Topological theory of resilience and failure spreading in flow networks
- Probabilistic analysis of optimization problems on generalized random shortest path metrics
- Probability theory for random groups arising in number theory
- A convex principle of search time for a multi-biased random walk on complex networks
- Clique is hard on average for regular resolution
- On the anti-Ramsey threshold for non-balanced graphs
- Convergence of combinatorial gravity
- A gentle introduction to the differential equation method and dynamic concentration
- Higher order programming with probabilistic effects: A model of stochastic memoization and name generation
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- Efficient methods for the distance-based critical node detection problem in complex networks
- Large deviations for the largest eigenvalue of Gaussian networks with constant average degree
- Network isolators inhibit failure spreading in complex networks
- Connectedness matters: construction and exact random sampling of connected networks
- Counting extensions revisited
- On the reduced Sombor index and its applications
- Fully retroactive minimum spanning tree problem
- Accelerating Louvain community detection algorithm on graphic processing unit
- Random-cluster dynamics on random regular graphs in tree uniqueness
- Local topological moves determine global diffusion properties of hyperbolic higher-order networks
- The expected values of some indices in random phenylene chains
- Application of complex systems topologies in artificial neural networks optimization: An overview
- Getting the lay of the land in discrete space: A survey of metric dimension and its applications
- Multi-angle quantum approximate optimization algorithm
- Spectral Theory of Graphons
- Approximating the cumulant generating function of triangles in the Erdös–Rényi random graph
- RTGEN: A Relative Temporal Graph GENerator
- Computational thresholds for the fixed-magnetization Ising model
- Hypergraph assortativity: A dynamical systems perspective
- More about sparse halves in triangle-free graphs
- Inferring pattern generators on networks
- Random walks on dense graphs and graphons
- Predictor-based H∞ leader-following consensus of stochastic multi-agent systems with random input delay
- Chemical subdiffusivity of critical 2D percolation
- Tail bounds for gaps between eigenvalues of sparse random matrices
- Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
- Random graph matching in geometric models: the case of complete graphs
- A hybrid list-based task scheduling scheme for heterogeneous computing
- Conformal growth rates and spectral geometry on distributional limits of graphs
- Counting colorings of triangle-free graphs
- OONIS—Object-oriented network infection simulator
- Topological indices computing on random chain structures
- Complete minors in graphs without sparse cuts
- Size-invariant graph representations for graph classification extrapolations
- Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
- Curvature graph neural network
- From random failures to targeted attacks in network dismantling
- Optimisation of the coalescent hyperbolic embedding of complex networks
- Asymptotic entropy of the Gibbs state of complex networks
- Network embedding from the line graph: Random walkers and boosted classification
- On the clique number of noisy random geometric graphs
- Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks
- Path decompositions of random directed graphs
- Partitioning a graph into balanced connected classes: Formulations, separation and experiments
- The Nature of Complex Networks
- Community detection in the sparse hypergraph stochastic block model
- Link scheduling using graph neural networks
- Fréchet distribution in geometric graphs for drone networks
- Spectral conditions for graph rigidity in the Euclidean plane
- Hamiltonicity of random subgraphs of the hypercube
- Invariant embeddings of unimodular random planar graphs
- Generalized optimal paths and weight distributions revealed through the large deviations of random walks on networks
- Cutoff for random lifts of weighted graphs
- Analysing mission-critical cyber-physical systems with AND/OR graphs and MaxSAT
- Graphgt: Machine learning datasets for graph generation and transformation
- A probabilistic compute fabric based on coupled ring oscillators for solving combinatorial optimization problems
- Network hierarchy and pattern recovery in directed sparse Hopfield networks
- Hamiltonicity in Cherry-quasirandom 3-graphs
- Quasirandom Latin squares
- Graph theory approach to detect examinees involved in test collusion
- General properties on Sombor indices
- Generating a Doppelganger Graph: Resembling but Distinct
- Accelerated graph learning from smooth signals
- Injective edge-coloring of graphs with given maximum degree
- Percolation phase transition in weight-dependent random connection models
- Online discriminative graph learning from multi-class smooth signals
- Clique minors in graphs with a forbidden subgraph
- Exact modularity of line graphs of complete graphs
- Matérn Gaussian processes on graphs
- An explicit vector algorithm for high-girth MaxCut∗
- Two Approaches to Moderate Deviations in Triangle Count in G (n, m) Graphs
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
- Leveraging a multiple-strain model with mutations in analyzing the spread of COVID-19
- Network reliability: Heading out on the highway
- A branching process approach to level-k phylogenetic networks
- Rainbow clique subdivisions and blow-ups
- Centralities in complex networks
- Balanced product quantum codes
- Climate Field Completion via Markov Random Fields: Application to the HadCRUT4. 6 Temperature Dataset
- Locally interacting diffusions as Markov random fields on path space
- t-SNE, forceful colorings and mean field limits
- Dirac’s theorem for random regular graphs
- A randomized construction of high girth regular graphs
- A probabilistic proof of Cooper and Frieze’s” First Visit Time Lemma”
- Hybrid quantum-classical algorithms for approximate graph coloring
- Introduction to graph signal processing
- Critical thresholds of benefit distribution in an extended snowdrift game model
- Girth, magnitude homology, and phase transition of diagonality
- Long-term changes in the small-world organization of brain networks after concussion
- Extremal laws for Laplacian random matrices
- Spatiotemporal Patterns in Neurobiology: An Overview for Future Artificial Intelligence
- Enhancing the connectivity and resiliency of random key pre-distribution schemes for wireless sensor network
- Social graph restoration via random walk sampling
- A solution-driven multilevel approach for graph coloring
- Self-induced consensus of Reddit users to characterise the GameStop short squeeze
- Counterexamples to a conjecture of Harris on Hall ratio
- Machine learning for percolation utilizing auxiliary Ising variables
- Entropy of graphs in financial markets
- Quantum divide and conquer for combinatorial optimization and distributed computing
- Multifractal analysis of eigenvectors of small-world networks
- On the spectra of general random mixed graphs
- An interaction-based contagion model over temporal networks demonstrates that reducing temporal network density reduces total infection rate
- Geodetic Number Of Circulant Graphs
- The low-rank hypothesis of complex systems
- Paths, cycles and sprinkling in random hypergraphs
- Crux and long cycles in graphs
- Improving the filtering of branch-and-bound MDD solve
- MSO 0-1 law for recursive random trees
- How to Quantify Polarization in Models of Opinion Dynamics
- Cutoff for permuted Markov chains
- The Expected Number of Perfect Matchings in Cubic Planar Graphs
- Functional convergence of sequential U-processes with size-dependent kernels
- Reliable federated learning systems based on intelligent resource sharing scheme for big data internet of things
- Covering cycles in sparse graphs
- Eigenvalues of the non-backtracking operator detached from the bulk
- Visibility graph based temporal community detection with applications in biological time series
- How does the chromatic number of a random graph vary?
- Supervised average consensus in anonymous dynamic networks
- Cutoff for non-negatively curved Markov chains
- NetKI: a kirchhoff index based statistical graph embedding in nearly linear time
- Estimating the number of communities by spectral methods
- Melonic large N limit of 5-index irreducible random tensors
- Shotgun assembly of unlabeled erdos-renyi graphs
- Random walks and the universe of districting plans
- Quantum Markov chain Monte Carlo with digital dissipative dynamics on quantum computers
- AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs
- Community detection methods for directed graphs
- CANE: community-aware network embedding via adversarial training
- What are higher-order networks?
- Regularity lemmas for clustering graphs
- Ood-gnn: Out-of-distribution generalized graph neural network
- Successive minimum spanning trees
- Bipartite, Size, and Online Ramsey Numbers of Some Cycles and Paths
- Critical behavior of the Anderson model on the Bethe lattice via a large-deviation approach
- Scale-free percolation in continuous space: quenched degree and clustering coefficient
- Using machine learning for quantum annealing accuracy prediction
- Meta-validation of bipartite network projections
- Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods
- The Characterization of Graphs Whose Sandpile Group has Fixed Number of Generators
- Ramsey Numbers for Nontrivial Berge Cycles
- Spread of variants of epidemic disease based on the microscopic numerical simulations on networks
- The component structure of dense random subgraphs of the hypercube
- Detecting interactions in discrete-time dynamics by random variable resetting
- Dynamic multicast routing management for robust wide area power grid communication
- Are Graph Convolutional Networks With Random Weights Feasible?
- On the size-Ramsey number of grid graphs
- Max-Cut via Kuramoto-type Oscillators
- On the eigenvalue and energy of extended adjacency matrix
- Maximum Biplex Search over Bipartite Graphs
- Three-state majority-vote model on small-world networks
- Graphs with minimum vertex-degree function-index for convex functions
- Covariance matrices of length power functionals of random geometric graphs–an asymptotic analysis
- The paradox of second-order homophily in networks
- Loose cores and cycles in random hypergraphs
- When Can Liquid Democracy Unveil the Truth?
- A performance study of meta-heuristic approaches for quadratic assignment problem
- Inducibility of 4-vertex tournaments
- Deterministic search on star graphs via quantum walks
- Random cographs: Brownian graphon limit and asymptotic degree distribution
- Blowup Ramsey numbers
- Certain properties of domination in product vague graphs with an application in medicine
- Convergence rates of limit theorems in random chord diagrams
- The spatial inheritance enhances cooperation in weak prisoner’s dilemmas with agents’ exponential lifespan
- Coloring Graphs Without Bichromatic Cycles or Paths
- Further results on the rainbow vertex-disconnection of graphs
- State-of-the-Art development of complex systems and their simulation methods
- Testing copositivity via mixed–integer linear programming
- Large clique is hard on average for resolution
- Isomorphism for random k-uniform hypergraphs
- Inclusivity enhances robustness and efficiency of social networks
- Secure fast evaluation of iterative methods: with an application to secure pagerank
- Generalized quantum-classical correspondence for random walks on graphs
- Quantifying dissimilarities between heterogeneous networks with community structure
- Lower Gaussian heat kernel bounds for the random conductance model in a degenerate ergodic environment
- Quasirandom graphs and the pantograph equation
- Improving branch-and-bound using decision diagrams and reinforcement learning
- Eigenvector statistics of Lévy matrices
- The size-Ramsey number of short subdivisions
- The effect of people recommenders on echo chambers and polarization
- The impact of noise and topology on opinion dynamics in social networks
- Modeling higher-order interactions in complex networks by edge product of graphs
- Template-based minor embedding for adiabatic quantum optimization
- Local and collective transitions in sparsely-interacting ecological communities
- Effects of mobility restrictions during COVID19 in Italy
- Random graph matching with improved noise robustness
- Around quantum ergodicity
- Scale-free random SAT instances
- Design of graph signal sampling matrices for arbitrary signal subspaces
- Epidemic inference through generative neural networks
- Remarks on random walks on graphs and the Floyd boundary
- A new proof of Cayley’s formula
- Synchronization in multiplex models of neuron–glial systems: Small-world topology and inhibitory coupling
- A graph mining approach for ranking and discovering the interesting frequent subgraph patterns
- Measuring the importance of individual units in producing the collective behavior of a complex network
- Graph degree heterogeneity facilitates random walker meetings
- Sublinear Random Access Generators for Preferential Attachment Graphs
- Strategic evasion of centrality measures
- Potential-driven random walks on interconnected systems
- Mobile networks-on-chip mapping algorithms for optimization of latency and energy consumption
- Efficient and reliable overlay networks for decentralized federated learning
- Proof of the contiguity conjecture and lognormal limit for the symmetric perceptron
- On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
- Of Shadows and Gaps in Spatial Search
- A note on the Gaffney Laplacian on infinite metric graphs
- Order matters: Probabilistic modeling of node sequence for graph generation
- Expected propagation time for probabilistic zero forcing
- A SAT approach to twin-width
- Unveiling the Truth in Liquid Democracy with Misinformed Voters
- A concentration of measure approach to correlated graph matching
- Learning to schedule heuristics in branch and bound
- Random Permutations–A geometric point of view
- Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
- Dynamical algorithms for data mining and machine learning over dynamic graphs
- Local boxicity
- A note lower bounds for the Estrada index
- Some spectral properties of the non-backtracking matrix of a graph
- Path to fixation of evolutionary processes in graph-structured populations
- Phase transitions of the variety of random-field Potts models
- Evaluations of Tutte polynomials of regular graphs
- Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
- Graph neural networks for graph drawing
- Freeness over the diagonal for large random matrices
- Notes on the stable regularity lemma
- How do hyperedges overlap in real-world hypergraphs?-patterns, measures, and generators
- Variance and covariance of distributions on graphs
- Toward a universal model for spatially structured populations
- Extremal Sombor indices of tetracyclic (chemical) graphs
- A unifying generative model for graph learning algorithms: Label propagation, graph convolutions, and combinations
- Anchored expansion of Delaunay complexes in real hyperbolic space and stationary point processes
- Random-walk laplacian for frequency analysis in periodic graphs
- Ramsey properties of algebraic graphs and hypergraphs
- On non-localization of eigenvectors of high girth graphs
- Thresholds versus fractional expectation-thresholds
- Relative Turán problems for uniform hypergraphs
- Community detection in complex networks: From statistical foundations to data science applications
- Zero-forcing in random regular graphs
- A network-based explanation of inequality perceptions
- A general variable neighborhood search for the cyclic antibandwidth problem
- A neural network solves, explains, and generates university math problems by program synthesis and few-shot learning at human level
- Spatial search on Johnson graphs by continuous-time quantum walk
- Fast sampling of satisfying assignments from random -SAT
- A centrality model for directed graphs based on the Two-Way-Random Path and associated indices for characterizing the nodes
- Making multigraphs simple by a sequence of double edge swaps
- Directed percolation in temporal networks
- Exponential growth of random determinants beyond invariance
- Generalized k-core percolation on higher-order dependent networks
- On the second eigenvalue of random bipartite biregular graphs
- Curvature on Graphs via Equilibrium Measures
- Bipartite clique minors in graphs of large Hadwiger number
- Variability in higher order structure of noise added to weighted networks
- … decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random …
- Scalable node-disjoint and edge-disjoint multiwavelength routing
- Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth
- On the graphs with minimum Sombor index
- On finite mixture modeling and model-based clustering of directed weighted multilayer networks
- K-way spectral graph partitioning for load balancing in Parallel Computing
- On the influence maximization problem and the percolation phase transition
- Automorphisms of random trees
- Quantum evolution kernel: Machine learning on graphs with programmable arrays of qubits
- Mixing time of fractional random walk on finite fields
- Greedy approximation for the minimum connected dominating set with labeling
- The method of cumulants for the normal approximation
- Return probabilities on nonunimodular transitive graphs
- Toward 5G cloud radio access network: An energy and latency perspective
- Edge Universality of Sparse Random Matrices
- Testing Triangle Freeness in the General Model in Graphs with Arboricity O (√ n)
- Memetic Teaching–Learning-Based Optimization algorithms for large graph coloring problems
- Unbiased graph embedding with biased graph observations
- Uncertainty quantification and testing in a stochastic block model with two unequal communities
- Hierarchical graph neural nets can capture long-range interactions
- Secretary problem: graphs, matroids and greedoids
- Optimal COVID-19 vaccination strategies with limited vaccine and delivery capabilities: a model based on social networks
- Extremal problems for graphical function-indices and f-weighted adjacency matrix
- Some results on the Sombor indices of graphs
- Execution Order Matters in Greedy Algorithms with Limited Information
- Simplicial Complexes in Complex Systems: In Search for Alternatives
- Adversarial graph augmentation to improve graph contrastive learning
- Bcd nets: Scalable variational approaches for bayesian causal discovery
- Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
- Epidemic spreading and digital contact tracing: Effects of heterogeneous mixing and quarantine failures
- Note on random Latin squares and the triangle removal process
- Tangled paths: A random graph model from mallows permutations
- The sharp K4-percolation threshold on the Erdős–Rényi random graph
- A large-deviations principle for all the components in a sparse inhomogeneous random graph
- A survey of the modified Moran process and evolutionary graph theory
- Cognitive cascades: How to model (and potentially counter) the spread of fake news
- Expected Values of Some Molecular Descriptors in Random Cyclooctane Chains
- Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints
- Detecting network anomalies using Forman–Ricci curvature and a case study for human brain networks
- Online graph dictionary learning
- Decentralized cooperative online estimation with random observation matrices, communication graphs and time delays
- Factors in randomly perturbed hypergraphs
- Fast and Efficient 𝑛-Metrics for Multiple Graphs
- On the structure of graphs with integer Sombor indices
- On testing for parameters in Ising models
- Learning to Learn Variational Quantum Algorithm
- On the Standard (2, 2)-Conjecture
- Universal and unavoidable graphs
- Counting partitions of with degree congruence conditions
- Bursting synchronization in neuronal assemblies of scale-free networks
- The discrepancy of random rectangular matrices
- Note on sunflowers
- A multiscale network-based model of contagion dynamics: heterogeneity, spatial distancing and vaccination
- Causal graphical views of fixed effects and random effects models
- Graph toughness from Laplacian eigenvalues
- Deep Graph Spectral Evolution Networks for Graph Topological Evolution
- Classical symmetries and the quantum approximate optimization algorithm
- The wired arboreal gas on regular trees
- Fluctuations of extreme eigenvalues of sparse Erdős–Rényi graphs
- Failing to hash into supersingular isogeny graphs
- Regular Sparse NOMA: Ultimate Performance in Closed Form
- Cutoff for almost all random walks on abelian groups
- Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure
- From algorithms to connectivity and back: finding a giant component in random k-SAT
- Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs
- From block-Toeplitz matrices to differential equations on graphs: towards a general theory for scalable masked Transformers
- Stability and Generalization Capabilities of Message Passing Graph Neural Networks
- The existence of extremal functions for discrete Sobolev inequalities on lattice graphs
- Closing the Random Graph Gap in Tuza’s Conjecture through the Online Triangle Packing Process
- Modeling quantum dot systems as random geometric graphs with probability amplitude-based weighted links
- Graphon filters: Graph signal processing in the limit
- Regional and sectoral structures of the Chinese economy: A network perspective from multi-regional input–output tables
- Equation attention relationship network (EARN): A geometric deep metric framework for learning similar math expression embedding
- Rare events in random geometric graphs
- Long-loop feedback vertex set and dismantling on bipartite factor graphs
- Dynamic concentration of the triangle-free process
- Exploratory graph analysis of the network data of the Ethereum blockchain
- The effective graph reveals redundancy, canalization, and control pathways in biochemical regulation and signaling
- Support of closed walks and second eigenvalue multiplicity of graphs
- Random walks and Laplacians on hypergraphs: When do they match?
- QAOAKit: A toolkit for reproducible study, application, and verification of the QAOA
- A framework of opinion dynamics using fuzzy linguistic 2-tuples
- Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph
- Robustness and efficiency of voting consensus protocols within byzantine infrastructures
- DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries
- Incorporating bounds from decision diagrams into integer programming
- An overview of epidemic models with phase transitions to absorbing states running on top of complex networks
- Correlations among game of thieves and other centrality measures in complex networks
- Comparison of approximation algorithms for the travelling salesperson problem on semimetric graphs
- Accurately Modeling Biased Random Walks on Weighted Graphs Using
- Low-congestion shortcuts for graphs excluding dense minors
- A review of latent space models for social networks
- Formal method for the synthesis of optimal topologies of computing systems based on the projective description of graphs
- Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
- On distance graph coloring problems
- Social network analysis taxonomy based on graph representation
- Noise-induced barren plateaus in variational quantum algorithms
- Saved to My library
- Time series analysis via network science: Concepts and algorithms
- A modification of the random cutting model
- SWFC-ART: A cost-effective approach for Fixed-Size-Candidate-Set Adaptive Random Testing through small world graphs
- Simple mathematical models for controlling COVID-19 transmission through social distancing and community awareness
- Influence maximization algorithm based on reverse reachable set
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs
- Matching a desired causal state via shift interventions
- Counting H-free orientations of graphs
- Orientations and cycles in supersingular isogeny graphs
- Sprinkling a few random edges doubles the power
- MPGVAE: improved generation of small organic molecules using message passing neural nets
- The connectome predicts resting-state functional connectivity across the Drosophila brain
- Random simplicial complexes, duality and the critical dimension
- Advanced Common Core Math Explorations: Probability and Statistics (Grades 5-8)
- Random matrices associated with general barrier billiards
- Pearson correlations on complex networks
- Robustness assessment of multimodal freight transport networks
- The number of satisfying assignments of random 2-SAT formulas
- Pseudorandom Generators, Resolution and Heavy Width
- Bounds on approximating Max XOR with quantum and classical local algorithms
- Forecasting elections results via the voter model with stubborn nodes
- A Ramsey–Turán theory for tilings in graphs
- Independent dominating sets in graphs of girth five
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- Making an -Free Graph -Colorable
- Degree-preserving graph dynamics–a versatile process to construct random networks
- ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs
- Recursive contact tracing in Reed–Frost epidemic models
- Concurrence percolation threshold of large-scale quantum networks
- A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
- Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem
- On the Largest Common Subtree of Random Leaf-Labeled Binary Trees
- Barak–Erdős graphs and the infinite-bin model
- The size Ramsey number of graphs with bounded treewidth
- Transferability Properties of Graph Neural Networks
- Morphological models of random structures
- Universality of approximate message passing algorithms and tensor networks
- Hat chromatic number of graphs
- Factor of iid schreier decoration of transitive graphs
- Spectral large deviations of sparse random matrices
- A study of connectivity on dynamic graphs: computing persistent connected components
- On Compressing Temporal Graphs
- Mixing time of PageRank surfers on sparse random digraphs
- On Color Isomorphic Pairs in Proper Edge Colourings of Complete Graphs
- Hitting times for non-backtracking random walks
- Graph and hypergraph colouring via nibble methods: A survey
- Modeling and simulation of secure connectivity and hop count of multi-hop ad-hoc wireless networks with colluding and non-colluding eavesdroppers
- Combinatorial optimization with physics-inspired graph neural networks
- Expander Random Walks: The General Case and Limitations
- A metric on directed graphs and Markov chains based on hitting probabilities
- Popularity-similarity random SAT formulas
- A Critical Probability for Biclique Partition of
- Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity
- The localization capture time of a graph
- ShortWalk: an approach to network embedding on directed graphs
- Path Laplacians versus fractional Laplacians as nonlocal operators on networks
- Structural analysis of nanoscale network materials using graph theory
- The strength of weak bots
- Belief propagation for networks with loops
- A historical perspective of Tian’s evolution algebras
- Generalized spectral clustering via Gromov-Wasserstein learning
- Graph distances in scale-free percolation: the logarithmic case
- Broadcasting on paths and cycles
- Network Robustness Analysis for IoT Networks using Regular Graphs
- Assessing the impact of the density and sparsity of the network on community detection using a Gaussian mixture random partition graph generator
- The planted k-factor problem
- Expander random walks: A fourier-analytic approach
- Longest paths in random hypergraphs
- Identifying influential links to control spreading of epidemics
- Topological modelling of gas networks for co-simulation applications in multi-energy system
- Social dilemmas in off-lattice populations
- Hitting all maximum independent sets
- Adding negative learning to ant colony optimization: A comprehensive study
- On the derivation of mean-field percolation critical exponents from the triangle condition
- Delocalization and quantum diffusion of random band matrices in high dimensions I: Self-energy renormalization
- Who does what to whom? graph representations of action-predication in speech relate to psychopathological dimensions of psychosis
- Persistence of information flow: A multiscale characterization of human brain
- Distributed algorithms to determine eigenvectors of matrices on spatially distributed networks
- A multilayer network model of the coevolution of the spread of a disease and competing opinions
- Entropic independence: optimal mixing of down-up random walks
- Factor-of-iid balanced orientation of non-amenable graphs
- Mobility-based SIR model for complex networks: with case study Of COVID-19
- Higher-order relations skew link prediction in graphs
- A new approach to finding the extra connectivity of graphs
- Large complete minors in random subgraphs
- Interest clustering coefficient: a new metric for directed networks like Twitter
- A comparative study of polynomial-type chaos expansions for indicator functions
- Erdos-Hajnal for graphs with no 5-hole
- Well-mixing vertices and almost expanders
- High-performance computing implementations of agent-based economic models for realizing 1: 1 scale simulations of large economies
- Regularity of extended conjugate graphs of finite groups
- The Probability of Encounters of Mutual Search Using Lévy Walk on Unit Disk Graphs
- Hamiltonian Berge cycles in random hypergraphs
- Graph neural network initialisation of quantum approximate optimisation
- Evolution of cooperation in heterogeneously stochastic interactions
- Percolation on feature-enriched interconnected systems
- Homological percolation transitions in growing simplicial complexes
- Topological embeddings into random 2-complexes
- Ordering chemical graphs by Sombor indices and its applications
- Two problems in extremal combinatorics
- Bipartite independence number in graphs with bounded maximum degree
- Graphon signal processing
- Hidden network generating rules from partially observed complex networks
- Heider balance under disordered triadic interactions
- Anomaly detection for big data using efficient techniques: A review
- Accrual of functional redundancy along the lifespan and its effects on cognition
- On spectral algorithms for community detection in stochastic blockmodel graphs with vertex covariates
- On some graph densities in locally dense graphs
- Singularity of sparse random matrices: simple proofs
- Longitudinal network models and permutation-uniform Markov chains
- Random tensor theory for tensor decomposition
- Bridged Hamiltonian Cycles in Sub-critical Random Geometric Graphs
- Sharp threshold for the Erdős–Ko–Rado theorem
- Degree-preserving network growth
- Network Analysis of Local Gene Regulators in Arabidopsis thaliana under Spaceflight Stress
- Joint distribution of the cokernels of random -adic matrices
- LQG graphon mean field games: Graphon invariant subspaces
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- Interplay between epidemic spread and information diffusion on two-layered networks with partial mapping
- Deterministic fast scrambling with neutral atom arrays
- On fast computations of numerical parameters of homogeneous algebraic graphs of large girth and small diameter and encryption of large files.
- Phase transitions of Best-of-two and Best-of-three on stochastic block models
- Modeling multi-scale data via a network of networks
- Randomly stopped extreme Zipf extensions
- Competing spreading dynamics in simplicial complex
- Assemblies of neurons can learn to classify well-separated distributions
- General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching
- Eigenstate thermalization hypothesis for Wigner matrices
- Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs
- Algorithms and complexity of power domination in graphs
- Diffusion profile embedding as a basis for graph vertex similarity
- Covid-19 epidemic under the K-quarantine model: Network approach
- Neuronal avalanches in Watts-Strogatz networks of stochastic spiking neurons
- Learn to improve: A novel deep reinforcement learning approach for beyond 5G network slicing
- Superlinear elliptic inequalities on weighted graphs
- Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
- Dynamical phases in a
`multifractal”Rosenzweig-Porter model`

- Selfish creation of social networks
- Dynamic hidden-variable network models
- The Gross–Saccoman conjecture is true
- Asymptotically efficient estimators for stochastic blockmodels: The naive MLE, the rank-constrained MLE, and the spectral estimator
- Meyniel extremal families of Abelian Cayley graphs
- Urban sensing as a random search process
- Circular inference predicts nonuniform overactivation and dysconnectivity in brain-wide connectomes
- Numerically efficient computation of the survival signature for the reliability analysis of large networks
- Software reuse analytics using integrated random forest and gradient boosting machine learning algorithm
- Weak local limit of preferential attachment random trees with additive fitness
- Increased segregation of structural brain networks underpins enhanced broad cognitive abilities of cognitive training
- A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
- A nonamenable “factor” of a Euclidean space
- Kr-factors in graphs with low independence number
- Extremal problems on Sombor indices of unicyclic graphs with a given diameter
- Improved clustering algorithms for the bipartite stochastic block model
- Directed polymers on infinite graphs
- Kleinberg’s Navigation in Fractal Small-World Networks by Dynamic Rejection Sampling
- The average order of dominating sets of a graph
- Growing urban bicycle networks
- Theory of chain walking catalysis: From disordered dendrimers to dendritic bottle-brushes
- About weighted random sampling in preferential attachment models
- Height function delocalisation on cubic planar graphs
- COVIDrugNet: a network-based web tool to investigate the drugs currently in clinical trial to contrast COVID-19
- Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
- Spin systems with hyperbolic symmetry: a survey
- Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?
- Graph-based technique for survivability assessment and optimization of IoT applications
- Finite representation of reaction kinetics in unbounded biopolymer structures
- General graph generators: experiments, analyses, and improvements
- A phase transition for repeated averages
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- On the resilience of modern power systems: A complex network perspective
- Optimal Targeting in Super-Modular Games
- Scheduling energy-conscious tasks in distributed heterogeneous computing systems
- Dirichlet energy constrained learning for deep graph neural networks
- Scaling limits for the Gibbs states on distance-regular graphs with classical parameters
- Transferability of graph neural networks: an extended graphon approach
- Geometry, topology and simplicial synchronization
- Agent-based computational epidemiological modeling
- Tournaments, Johnson Graphs, and NC-Teaching
- Searching for small-world and scale-free behaviour in long-term historical data of a real-world power grid
- Design and Analysis of NB QC-LDPC Codes Over Small Alphabets
- Graphon mean field games and their equations
- Size-Ramsey numbers of powers of hypergraph trees and long subdivisions
- Explicit Abelian Lifts and Quantum LDPC Codes
- Three types of Kirchhoff indices in the random cyclooctane chains
- Generative Algorithm for Molecular Graphs Uncovers Products of Oil Oxidation
- Variational Inference in high-dimensional linear regression
- Hybrid multiagent collaboration for time-critical tasks: a mathematical model and heuristic approach
- Characterization of vulnerability of road networks to random and nonrandom disruptions using network percolation approach
- Weighted connected vertex cover based energy-efficient link monitoring for wireless sensor networks towards secure internet of things
- Quantum spin systems for measurement-based quantum computation
- Disentangling homophily, community structure, and triadic closure in networks
- Strong Cliques in Claw-Free Graphs
- Knowledge base question answering by case-based reasoning over subgraphs
- Perturbative quantum field theory on random trees
- The component counts of random injections
- Hamilton transversals in random Latin squares
- When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
- Some relation between spectral dimension and Ahlfors regular conformal dimension on infinite graphs
- Cayley Graphs and Probability Isomorphic Groups
- Solving Tur\’an’s Tetrahedron Problem for the -Norm
- Network Analysis Based on Important Node Selection and Community Detection
- Near-perfect clique-factors in sparse pseudorandom graphs
- An adaptive spectral graph wavelet method for PDEs on networks
- TrammelGraph: visual graph abstraction for comparison
- Combinatorial necessary conditions for regular graphs to induce periodic quantum walks
- Homological scaffold via minimal homology bases
- VisGraphNet: A complex network interpretation of convolutional neural features
- Algebraic and combinatorial expansion in random simplicial complexes
- Provenance-based algorithms for rich queries over graph databases
- Leveraging the self-transition probability of ordinal patterns transition network for transportation mode identification based on GPS data
- A theory of evolutionary dynamics on any complex spatial structure
- A survey on mining and analysis of uncertain graphs
- Efficient route selection for drone-based delivery under time-varying dynamics
- An up-to-date review of scan statistics
- A ribbon graph derivation of the algebra of functional renormalization for random multi-matrices with multi-trace interactions
- Random translation-invariant Hamiltonians and their spectral gaps
- Do higher-order interactions promote synchronization?
- Boolean matrix factorization via nonnegative auxiliary optimization
- Evolutionary game on a growing multilayer network
- Large expanders in high genus unicellular maps
- The harmonic mean formula for random processes
- A direct comparison between the mixing time of the interchange process with” few” particles and independent random walks
- A framework for optimal quantum spatial search using alternating phase-walks
- NTS-NOTEARS: Learning Nonparametric Temporal DAGs With Time-Series Data and Prior Knowledge
- Fast iterative solution of the optimal transport problem on graphs
- On maximal cliques of Cayley graphs over fields
- Sublinear domination and core–periphery networks
- Enumerating alternating matrix spaces over finite fields with explicit coordinates
- The 1–2–3 conjecture almost holds for regular graphs
- Dyed fabric illumination estimation with regularized random vector function link network
- Asymptotic behaviors of random walks on countable groups
- Fixation probabilities in network structured meta-populations
- Functional Gaussian approximations in Hilbert spaces: the non-diffusive case
- Graph tikhonov regularization and interpolation via random spanning forests
- Information technologies for analysis and modeling of computer network’s development
- Entanglement negativity spectrum of random mixed states: A diagrammatic approach
- Tight Ramsey bounds for multiple copies of a graph
- Approximate counting and sampling via local central limit theorems
- Random 2-cell embeddings of multistars
- Minimal constraints in the parity formulation of optimization problems
- Robust analysis of cascading failures in complex networks
- The complexity of average-case dynamic subgraph counting
- List-decodability with large radius for Reed-Solomon codes
- Comparing unified, pinned, and host/device memory allocations for memory-intensive workloads on Tegra SoC
- Loss of structural balance in stock markets
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- A network-based explanation of perceived inequality
- Regularity method and large deviation principles for the Erd\H {o} s–R\’enyi hypergraph
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
- Nonlocal diffusion of variable order on graphs
- Local convergence of random planar graphs
- Gaussian Whittle-Mat\’ern fields on metric graphs
- Stochastic quorum percolation and noise focusing in neuronal networks
- Geometric Structure and Ergodic Properties of Bony Multi-Graphs
- Finite state graphon games with applications to epidemics
- Categorical data structures for technical computing
- Diva: A scalable, interactive and customizable visual analytics platform for information diffusion on large networks
- Learning sparse graph with minimax concave penalty under gaussian markov random fields
- Towards the characterization of realistic model generators using graph neural networks
- Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature
- A decomposition of student achievement gap by gender in China: Evidence from random class assignment
- Propagation source identification of infectious diseases with graph convolutional networks
- Directed percolation in random temporal network models with heterogeneities
- Chimeras unfolded
- Herd immunity and epidemic size in networks with vaccination homophily
- Identification of edge disconnections in networks based on graph filter outputs
- Spatial search on Johnson graphs by discrete-time quantum walk
- Optimal mixing time for the Ising model in the uniqueness regime
- Integer programming for learning directed acyclic graphs from continuous data
- Evolution of networks of protein domain organization
- The dual challenge of search and coordination for organizational adaptation: how structures of influence matter
- Information-driven path planning
- Inferential statistical reasoning of math teachers: Experiences in virtual contexts generated by the COVID-19 pandemic
- An Overlapping Community Detection Approach in Ego-Splitting Networks Using Symmetric Nonnegative Matrix Factorization
- Models of random subtrees of a graph
- Site percolation and isoperimetric inequalities for plane graphs
- Math matters: A novel, brief educational intervention decreases whole number bias when reasoning about COVID-19.
- Choice number of Kneser graphs
- On Realizing a Single Degree Sequence by a Bipartite Graph
- A survey of reconfigurable optical networks
- Shortest paths in graphs of convex sets
- A novel measure inspired by Lyapunov exponents for the characterization of dynamics in state-transition networks
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
- Schauder estimate for quasilinear discrete PDEs of parabolic type
- A comprehensive analysis of the correlation between maximal clique size and centrality metrics for complex network graphs
- Collective behavior of multileader multiagent systems with random interactions over signed digraphs
- Frozen 1-RSB structure of the symmetric Ising perceptron
- Algebraic Identification of Smart Systems
- Classical and quantum random-walk centrality measures in multilayer networks
- On 3-graphs with no four vertices spanning exactly two edges
- Ollivier persistent ricci curvature-based machine learning for the protein–ligand binding affinity prediction
- Cascading failures of overload behaviors on interdependent networks
- Benchpress: a scalable and platform-independent workflow for benchmarking structure learning algorithms for graphical models
- Mass scaling of the near-critical 2D Ising model using random currents
- Impact of graph structures for QAOA on MaxCut
- Sampling from the low temperature Potts model through a Markov chain on flows
- Simplicial SIRS epidemic models with nonlinear incidence rates
- A model of COVID-19 propagation based on a gamma subordinated negative binomial branching process
- Reputation based on edge dynamics promotes cooperative behavior
- Allocating resources for epidemic spreading on metapopulation networks
- Circuit lower bounds for the p-spin optimization problem
- Content-based and knowledge graph-based paper recommendation: Exploring user preferences with the knowledge graphs for scientific paper recommendation
- Reference to global state and social contagion dynamics
- High-order structure exploration on massive graphs: A local graph clustering perspective
- Effects of asymptomatic infection and self-initiated awareness on the coupled disease-awareness dynamics in multiplex networks
- Limits and consistency of non-local and graph approximations to the Eikonal equation
- Correlation decay and the absence of zeros property of partition functions
- Multilevel approaches for the critical node problem
- Information sources estimation in time-varying networks
- Integrating emotion-imitating into strategy learning improves cooperation in social dilemmas with extortion
- Efficient node selection strategy for sampling bandlimited signals on graphs
- Mean-field limit of non-exchangeable systems
- Network Shuffling: Privacy Amplification via Random Walks
- Scarcity of scale-free topology is universal across biochemical networks
- Neutral quasispecies evolution and the maximal entropy random walk
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Galton–Watson games
- Structural heterogeneity and evolutionary dynamics on complex networks
- A General Framework for Hypergraph Coloring
- Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
- On triangle-free list assignments
- Hypergrid subgraphs and the origin of scarred quantum walks in many-body Hilbert space
- Reflecting on prediction strategies for epidemics: Preparedness and public health response
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
- Supercritical percolation on nonamenable graphs: Isoperimetry, analyticity, and exponential decay of the cluster size distribution
- bioMCS 2.0: A distributed, energy-aware fog-based framework for data forwarding in mobile crowdsensing
- Perfect state transfer on weighted abelian Cayley graphs
- Lower bounds on the clique-chromatic numbers of some distance graphs
- A practical test for a planted community in heterogeneous networks
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- Gaussian approximation for rooted edges in a random minimal directed spanning tree
- The interplay between communities and homophily in semi-supervised classification using graph neural networks
- Accessibility: A Generalization of the Node Degree (A Tutorial)
- -intersecting families of graphs
- Evaluating Node embeddings of complex networks
- Symmetry classification and universality in non-Hermitian many-body quantum chaos by the Sachdev-Ye-Kitaev model
- Learning combinatorial node labeling algorithms
- Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
- Coprime mappings and lonely runners
- Controllability of Network Opinion in Erdös–Rényi Graphs Using Sparse Control Inputs
- Homological connectivity in random Čech complexes
- Dynamical Sampling on Graphs
- Two remarks on graph norms
- A Note on Consistent Rotation Maps of Graph Cartesian Products
- Maximum values of degree-based entropies of bipartite graphs
- Intelligent Media Forensics and Traffic Handling Scheme in 5G Edge Networks
- An exact method for the minimum feedback arc set problem
- Subcubic algorithms for Gomory–Hu tree in unweighted graphs
- Optimal non-convex exact recovery in stochastic block model via projected power method
- Phase transitions of the k-majority dynamics in a biased communication model