scientific article
From MaRDI portal
Publication:3286850
zbMath0103.16301MaRDI QIDQ3286850
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Bounded quantifier depth spectra for random graphs, First passage percolation on the Newman-Watts small world model, Epidemic outbreak for an SIS model in multiplex networks with immunization, Prosperity is associated with instability in dynamical networks, An analysis of shipping agreements: the cooperative container network, When Markov chains meet: a continuous-time model of network evolution, Emergence of the giant component in preferential-attachment growing networks, Spectral properties of unimodular lattice triangulations, Graph-theoretic design and analysis of key predistribution schemes, Enhancing complex network controllability by minimum link direction reversal, Triangles in random cubic planar graphs, How does the core sit inside the mantle?, Evolution of high-order connected components in random hypergraphs, On spanning structures in random hypergraphs, Universal zero-one \(k\)-law, Bounds on Gromov hyperbolicity constant, On the zero-one \(k\)-law extensions, Multiple effects of self-protection on the spreading of epidemics, Immunization strategy based on the critical node in percolation transition, Methods for removing links in a network to minimize the spread of infections, Bounding the \(HL\)-index of a graph: a majorization approach, Upper bounds on Fourier entropy, Robust \(\mathcal{H}_{\infty}\) decentralized dynamic control for synchronization of a complex dynamical network with randomly occurring uncertainties, Long paths in sparse random graphs, Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs, Analysis of average shortest-path length of scale-free network, Validity studies in clustering methodologies, Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law, Communication in markets. A suggested approach, Birth and growth of multicyclic components in random hypergraphs, General compartmental epidemic models, Balanced and 1-balanced graph constructions, Color the cycles, Approximability of the vertex cover problem in power-law graphs, Phase transitions in exponential random graphs, Randomised broadcasting: memory vs. randomness, Spectral distributions of adjacency and Laplacian matrices of random graphs, Average-case complexity of backtrack search for coloring sparse random graphs, Parameterisation of Keeling's network generation algorithm, Upper-bounding the \(k\)-colorability threshold by counting covers, Robust synchronization of a class of chaotic networks, Extension of the zero-one \(k\)-law, Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs, Cycle structure of percolation on high-dimensional tori, Bound and exact methods for assessing link vulnerability in complex networks, On risk-averse maximum weighted subgraph problems, Random induced subgraphs of Cayley graphs induced by transpositions, On the mixing time of geographical threshold graphs, Dense subgraphs in the \(H\)-free process, Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs, Random subshifts of finite type, Random 2 XORSAT phase transition, Zero-one \(k\)-law, On the complexity of the herding attack and some related attacks on hash functions, Random groups arising as graph products., Analysis of a drop-push model for percolation and coagulation, Scaling limit for the random walk on the largest connected component of the critical random graph, Synchrony-optimized networks of non-identical Kuramoto oscillators, Cores of random \(r\)-partite hypergraphs, On rainbow-\(k\)-connectivity of random graphs, Random graphs with a given degree sequence, An evolution model of trading behavior based on peer effect in networks, Random continuous model of scale-free networks, Achlioptas process phase transitions are continuous, The large deviation principle for the Erdős-Rényi random graph, Continuous-time quantum walks on Erdős-Rényi networks, Optimal control strategy for traffic driven epidemic spreading based on community structure, Pinning synchronization of the complex networks with non-delayed and delayed coupling, The component sizes of a critical random graph with given degree sequence, Connected components and evolution of random graphs: An algebraic approach, The effects of decision-making processes and population turnover on the formation of social networks, Characterisations and examples of graph classes with bounded expansion, The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs, A testing based extraction algorithm for identifying significant communities in networks, On the kernel size of clique cover reductions for random intersection graphs, Thresholds and expectation-thresholds of monotone properties with small minterms, Synchronization of complex dynamical networks with discontinuous coupling signals, Primordial evolvability: impasses and challenges, Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection, Client-waiter games on complete and random graphs, Cryptographic Boolean functions with biased inputs, Failure risk propagation and protection schemes in coupled systems, Small subgraphs in the trace of a random walk, Clustering and community detection in directed networks: a survey, Recent advances in percolation theory and its applications, Asymptotically optimal induced universal graphs, Statistical physics of vaccination, On distribution function of the diameter in uncertain graph, Can topology reshape segregation patterns?, Incremental single-source shortest paths in digraphs with arbitrary positive arc weights, Neighbourhood reaction in the evolution of cooperation, Maximizing information exchange between complex networks, Potential games in volatile environments, Small subgraphs in random graphs and the power of multiple choices, On the isolated vertices and connectivity in random intersection graphs, Properties of complexity measures for PRAMs and WRAMs, Penalized Estimation of Directed Acyclic Graphs From Discrete Data, Latent Space Modeling of Multidimensional Networks with Application to the Exchange of Votes in Eurovision Song Contest, The one-out-of-\(k\) retrieval problem and linear network coding, The filling problem in the cube, On a method for random graphs, Complex systems: features, similarity and connectivity, Networks beyond pairwise interactions: structure and dynamics, Large-scale estimation of random graph models with local dependence, Analytical and statistical studies of Rodriguez-Velazquez indices, Induced trees in sparse random graphs, An efficient procedure for mining egocentric temporal motifs, On the order of the largest induced tree in a random graph, An exact threshold theorem for random graphs and the node-packing problem, Random hypergraphs and topological gelation criterion for crosslinked polymer systems, Threshold phenomena in random structures, Poisson convergence and Poisson processes with applications to random graphs, Preferential deletion in dynamic models of web-like networks, Note on the structure of Kruskal's algorithm, Counting connected graphs asymptotically, Phase transitions in dynamical random graphs, On large deviation properties of Erdős-Rényi random graphs, Properties of atypical graphs from negative complexities, Gelation in coagulating systems, On the number of induced subgraphs of a random graph, Maximal paths in random dynamic graphs, Phase synchronization in complex networks with decayed long-range interactions, On effectiveness of wiretap programs in mapping social networks, Generating simple random graphs with prescribed degree distribution, When are networks truly modular?, Threshold for monotone symmetric properties through a logarithmic Sobolev inequality, Complex networks: from graph theory to biology, Random interval graphs, Topological relationships between brain and social networks, Codes identifying sets of vertices in random networks, On the number of positive solutions of a nonlinear algebraic system, Small subgraphs of random regular graphs, The prisoner's dilemma on co-evolving networks under perfect rationality, Random graph asymptotics on high-dimensional tori, Geometry and topology of random 2-complexes, On the spectra of first-order language properties for random graphs, On the chromatic number of random regular graphs, When local and global clustering of networks diverge, Proper connection number of random graphs, The phase transition in site percolation on pseudo-random graphs, Matrix and discrepancy view of generalized random and quasirandom graphs, Survival time of a random graph, Optimal and near-optimal broadcast in random graphs, A note about critical percolation on finite graphs, Topology of random 2-complexes, Two sufficient conditions for Poisson approximations in the ferromagnetic Ising model, Critical random graphs: Diameter and mixing time, Edge percolation on a random regular graph of low degree, Colorings of spaces, and random graphs, Continuum limit of critical inhomogeneous random graphs, Distance-based parametric bootstrap tests for clustering of species ranges, Phase transitions for modified Erdős--Rényi processes, Distributed fault detection and isolation of continuous-time non-linear systems, Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence, Average-case analysis of incremental topological ordering, Variance of the subgraph count for sparse Erdős-Rényi graphs, Critical points for random Boolean networks, A program generating homogeneous random graphs with given weights, Low eigenvalues of Laplacian matrices of large random graphs, Measuring agility of networked organizational structures via network entropy and mutual information, Geography of local configurations, The \((k,\ell )\)-proper index of graphs, Understanding the scalability of Bayesian network inference using clique tree growth curves, Homomorphism complexes and \(k\)-cores, Social pressure and environmental effects on networks: a path to cooperation, On the Potts antiferromagnet on random graphs, Effect of migration based on strategy and cost on the evolution of cooperation, Percolation of interdependent network of networks, Minimal attractors in digraph system models of neuronal networks, Discovering bands from graphs, On pinning synchronization of complex dynamical networks, Modeling acquaintance networks based on balance theory, Large random graphs in pseudo-metric spaces, The chromatic number of random graphs at the double-jump threshold, On the \(k\)-orientability of random graphs, A note on coloring sparse random graphs, Increasing the flexibility of the herding attack, Pinning a complex dynamical network via impulsive control, Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT, Navigable small-world networks with few random bits, The Alexander-Orbach conjecture holds in high dimensions, Dominating communities for hierarchical control of complex networks, Random biochemical networks: the probability of self-sustaining autocatalysis, The evolution of the min-min random graph process, A model of the emergence and evolution of integrated worldviews, Topological-based bottleneck analysis and improvement strategies for traffic networks, Minimal ordered Ramsey graphs, On a random graph evolving by degrees, Almost all regular graphs are Hamiltonian, Trees in random graphs, Limit distribution for the existence of Hamiltonian cycles in a random graph, On the connectivity of random m-orientable graphs and digraphs, k-connectivity in random undirected graphs, Random subgraphs of the n-cycle, Hamiltonian cycles in random regular graphs, Component structure in the evolution of random hypergraphs, Balanced extensions of graphs and hypergraphs, Random near-regular graphs and the node packing problem, On the value of a random minimum spanning tree problem, Infinite spectra in the first order theory of graphs, A network model characterized by a latent attribute structure with competition, Exceptional times of the critical dynamical Erdős-Rényi graph, Sampling social networks using shortest paths, Growing network: models following nonlinear preferential attachment rule, Comparison of communities detection algorithms for multiplex, Age, innovations and time operator of networks, Epidemic spreading driven by biased random walks, Network topology inference from infection statistics, Design of inner coupling matrix for robustly self-synchronizing networks, Traffic-driven SIR epidemic spreading in networks, Evolving dynamics of trading behavior based on coordination game in complex networks, A method of characterizing network topology based on the breadth-first search tree, Explosive percolation in thresholded networks, A method of examining the structure and topological properties of public-transport networks, Vulnerability of complex networks under three-level-tree attacks, A general stochastic model for studying time evolution of transition networks, Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient, Optimizing controllability of edge dynamics in complex networks by perturbing network structure, Equilibrium distributions in entropy driven balanced processes, Spectral coarse grained controllability of complex networks, Unique entity estimation with application to the Syrian conflict, Sharpness of the phase transition for continuum percolation in \(\mathbb{R}^2\), Fractional PI pinning synchronization of fractional complex dynamical networks, Structure-oriented prediction in complex networks, Reconstruction methods for networks: the case of economic and financial systems, Scaling invariance in a social network with limited attention and innovation, Large deviations in generalized random graphs with node weights, On edge exchangeable random graphs, Phase transition phenomena in random discrete structures, Network-based naive Bayes model for social network, Scale-free behavior of networks with the copresence of preferential and uniform attachment rules, An environment aware epidemic spreading model and immune strategy in complex networks, Influence maximization of informed agents in social networks, Brownian excursions, critical random graphs and the multiplicative coalescent, Analysis on invulnerability of wireless sensor network towards cascading failures based on coupled map lattice, Underestimated cost of targeted attacks on complex networks, Local law and Tracy-Widom limit for sparse random matrices, Information-theoretic thresholds from the cavity method, Vertices cannot be hidden from quantum spatial search for almost all random graphs, Optimizing adiabatic quantum program compilation using a graph-theoretic framework, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Asymptotic normality of graph statistics, Random induced subgraphs of generalized \(n\)-cubes, Improvement on load-induced cascading failure in asymmetrical interdependent networks: modeling and analysis, Threshold for the outbreak of cascading failures in degree-degree uncorrelated networks, Subgraph counts in random graphs using incomplete U-statistics methods, The power grid as a complex network: a survey, Effective usage of shortest paths promotes transportation efficiency on scale-free networks, Dynamical robustness analysis of weighted complex networks, Evolutionary network games: equilibria from imitation and best response dynamics, The hidden algorithm of Ore's theorem on Hamiltonian cycles, More on the colorful monochromatic connectivity, Factorizing the complete graph into factors with large star number, Scale-free networks in evolution, On measuring the complexity of networks: Kolmogorov complexity versus entropy, The science of science: from the perspective of complex systems, When distributed computation is communication expensive, Threshold functions for small subgraphs: an analytic approach, The asymptotic distribution of short cycles in random regular graphs, First order sentences about random graphs: small number of alternations, Historical payoff promotes cooperation in the prisoner's dilemma game, Dominating complex networks by identifying minimum skeletons, Degree sequences of random graphs, Principles of statistical mechanics of uncorrelated random networks, Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?, A local-world evolving network model, Complexity and synchronization of the World Trade Web, A coarse-grained framework for spiking neuronal networks: between homogeneity and synchrony, Length of optimal path in random networks with strong disorder, Threshold functions and Poisson convergence for systems of equations in random sets, A dynamical characterization of the small world phase, Strict convexity of the free energy of the canonical ensemble under decay of correlations, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, Information content based model for the topological properties of the gene regulatory network of \textit{Escherichia coli}, The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph, One-factor in random graphs based on vertex choice, Holes in random graphs, Connectivity threshold for random chordal graphs, Size and connectivity of the \(k\)-core of a random graph, Threshold functions for local properties of graphs: Triangles, Expected parallel time and sequential space complexity of graph and digraph problems, Infinitary logics and 0-1 laws, Matching theory -- a sampler: From Dénes König to the present, The size of the largest hole in a random graph, An exact probability distribution on the connectivity of random graphs, Some applications of graph theory to clustering, Hamiltonian circuits in random graphs, Data analysis and the connectivity of random graphs, The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges, On the chromatic index of almost all graphs, Survey sampling in graphs, On finite superuniversal graphs, Evolution of the \(n\)-cube, A central limit theorem for decomposable random variables with applications to random graphs, Elements of a theory of computer simulation. I, Statistical evaluation of algebraic constraints for social networks, Pinning control of scale-free dynamical networks, Constructing optimal ultrametrics, Extremal problems and generalized degrees, The phase transition in a random hypergraph, Size of the largest cluster under zero-range invariant measures, A decomposability index in logical analysis of data, Forbidden subgraphs in connected graphs, The genus of a random graph, Counting \(H\)-free graphs, Walks on random digraphs, The clustering coefficient and the diameter of small-world networks, Giant vacant component left by a random walk in a random \(d\)-regular graph, Stochastic coalescence in logarithmic time, The local structure of globalization, The synchronization transition in correlated oscillator populations, Scaling in small-world resistor networks, Efficient immunization strategies on complex networks, Phase transition in the spanning-hyperforest model on complete hypergraphs, Markov fundamental tensor and its applications to network analysis, Thresholds in the resilience of modular social networks to invasion by defectors, Satisfiability threshold for random XOR-CNF formulas, Topological effects and performance optimization in transportation continuous network design, Research of innovation diffusion on industrial networks, High-order degree and combined degree in complex networks, A modified bootstrap percolation on a random graph coupled with a lattice, A general scheme for log-determinant computation of matrices via stochastic polynomial approximation, Cooperation enhanced by the `survival of the fittest' rule in prisoner's dilemma games on complex networks, The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks, Methods for approximating stochastic evolutionary dynamics on graphs, Generating realistic labelled, weighted random graphs, Dynamical analysis of a discrete-time SIS epidemic model on complex networks, Link prediction using time series of neighborhood-based node similarity scores, Network structures and poverty traps, Thresholds versus fractional expectation-thresholds, Pinning control of complex networks with time-varying inner and outer coupling, A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes, Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting, Critical random graphs and the differential equations technique, Autocatalytic networks in cognition and the origin of culture, Evolution of a modified binomial random graph by agglomeration, Competition for the access to and use of information in networks, A moment-generating formula for Erdős-Rényi component sizes, On the critical probability in percolation, Charting the replica symmetric phase, Fifty years of graph matching, network alignment and network comparison, Controllability and modularity of complex networks, Noise sensitivity and Voronoi percolation, Robustness on topology reconfiguration of complex networks: an entropic approach, Topological modelling of gas networks for co-simulation applications in multi-energy systems, A scaling limit for the length of the longest cycle in a sparse random graph, Spectral based hypothesis testing for community detection in complex networks, How (not) to integrate blood subtyping technology to kidney exchange, Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory, Synchronization of coupled networks with mixed delays by intermittent control, The satisfiability threshold for random linear equations, Application of complex networks theory in urban traffic network researches, Last passage percolation on the complete graph, Asymptotic normality determined by high moments, and submap counts of random maps, Alloy*: a general-purpose higher-order relational constraint solver, Counting connected graphs inside-out, A new scale-free network model for simulating and predicting epidemics, Sharp thresholds for half-random games. II, Structure of large random hypergraphs, Phase transition of random non-uniform hypergraphs, Asymptotics of integrals of Betti numbers for random simplicial complex processes, Cycles of given lengths in unicyclic components in sparse random graphs, Evolutionary bet-hedging in structured populations, Multilayer brain networks, Stein's method via induction, A note on generalization of bent Boolean functions, Opinion formation with zealots on temporal network, The characteristics of cycle-nodes-ratio and its application to network classification, Directionality of real world networks as predicted by path length in directed and undirected graphs, Community structure inhibits cooperation in the spatial prisoner's dilemma, Variability analysis of complex networks measures based on stochastic distances, Equilibrium games in networks, Predicting trophic relations in ecological networks: a test of the allometric diet breadth model, Generalized nonlinearity of \(S\)-boxes, A hybrid automata model of social networking addiction, Large-scale influence maximization via maximal covering location, Mining susceptibility gene modules and disease risk genes from SNP data by combining network topological properties with support vector regression, Power-law partial correlation network models, Word-of-mouth and estimating demand based on network structure and epidemic models, Model the evolution of protein interaction network assisted with protein age, On the chromatic number of the preferential attachment graph, The normalized matching property in random and pseudorandom bipartite graphs, Adaptive estimation of nonparametric geometric graphs, Immunization strategies in directed networks, Anti-concentration for subgraph counts in random graphs, Age evolution in the mean field forest fire model via multitype branching processes, Stochastic block model in a new critical regime and the interacting multiplicative coalescent, Rainbow monochromatic \(k\)-edge-connection colorings of graphs, Further results on the rainbow vertex-disconnection of graphs, A gentle introduction to deep learning for graphs, On the Lambert \(w\) function, Large induced trees in sparse random graphs, Higher order clustering coefficients in Barabási-Albert networks, \(w\)-density and \(w\)-balanced property of weighted graphs, Networks in life: Scaling properties and eigenvalue spectra, Nowhere-zero flows in random graphs, On the largest component of the random graph at a nearcritical stage, On the robustness of interconnections in random graphs: a symbolic approach., Packet transport and load distribution in scale-free network models, Directed cycles and related structures in random graphs. I: Static properties, Testing community structure for hypergraphs, Cascading failures in networks with the harmonic closeness under edge attack strategies, Distributed adaptive Newton methods with global superlinear convergence, Epidemic spreading of evolving community structure, Strictly balanced uniform hypergraphs and generalizations of zero-one law, SEAIR epidemic spreading model of COVID-19, Cycle analysis of directed acyclic graphs, The evolving network model with community size and distance preferences, The many facets of the Estrada indices of graphs and networks, Modeling and analysis knowledge transmission process in complex networks by considering internalization mechanism, Pinning-controlled synchronization of partially coupled dynamical networks via impulsive control, Percolation transitions in growing networks under achlioptas processes: analytic solutions, Better immigration: prisoner's dilemma game with population change on dynamic network, Graph-valued regression: prediction of unlabelled networks in a non-Euclidean graph space, Objective Bayesian edge screening and structure selection for Ising networks, A coarse graining algorithm based on \(m\)-order degree in complex network, Extreme events in dynamical systems and random walkers: a review, Pinning control of clustered complex networks with different size, Key node selection in minimum-cost control of complex networks, Collective dynamics in heterogeneous networks of neuronal cellular automata, Emergent organization in a model market, Controllable subspace of edge dynamics in complex networks, Synchronization of delayed complex networks via intermittent control with non-period, Catching homologies by geometric entropy, Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method, Optimal full ranking from pairwise comparisons, Impact of punishment on the evolution of cooperation in spatial prisoner's dilemma game, Naming game with biased assimilation over adaptive networks, Reconstruction of network topology using status-time-series data, Reconstruction of networks from one-step data by matching positions, Compressive sensing of high betweenness centrality nodes in networks, Target control of edge dynamics in complex networks, Benjamini-Schramm convergence and spectra of random hyperbolic surfaces of high genus, A mean-field approximation of SIR epidemics on an Erdös-Rényi network model, A novel measure of edge and vertex centrality for assessing robustness in complex networks, Conditional quenched mean-field approach for recurrent-state epidemic dynamics in complex networks, Positive correlation between strategy persistence and teaching ability promotes cooperation in evolutionary prisoner's dilemma games, Growth model for fractal scale-free networks generated by a random walk, Impact of structural balance on self-avoiding pruning walk, Viral marketing on social networks: an epidemiological perspective, Epidemic spreading dynamics on complex networks with adaptive social-support, Controlling edge dynamics in multilayer networks, Non-equilibrium kinetic Biswas-Chatterjee-Sen model on complex networks, Dynamics of discrete epidemic models on heterogeneous networks, Learning pseudo-backdoors for mixed integer programs, Graph \(r\)-hued colorings -- a survey, Estimating the number of connected components in a graph via subgraph sampling, Concentration of the spectral norm of Erdős-Rényi random graphs, Centers of complex networks, Computational and analytical studies of the Randić index in Erdős-Rényi models, Graph-theoretical derivation of brain structural connectivity, A study on scale free social network evolution model with degree exponent \(<2\), Vaccination behavior by coupling the epidemic spreading with the human decision under the game theory, Global dynamics of an epidemic model with incomplete recovery in a complex network, Synchronization of complex networks with impulsive control involving stabilizing delay, Target control and expandable target control of complex networks, Investigating peer and sorting effects within an adaptive multiplex network model, On the probability of nonexistence in binomial subsets, The impact of information spreading on epidemic vaccination game dynamics in a heterogeneous complex network -- a theoretical approach, Spread of two linked social norms on complex interaction networks, Threshold functions for small subgraphs in simple graphs and multigraphs, Quantifier alternation in first-order formulas with infinite spectra, Conflict-free connection number of random graphs, Modelling the evolution of genetic regulatory networks, Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem, Complexity results for autocatalytic network models, Bivariate gamma model, Exponential Chebyshev inequalities for random graphons and their applications, Predator-prey games on complex networks, Analysis of epidemic outbreaks in two-layer networks with different structures for information spreading and disease diffusion, Functional integration of ecological networks through pathway proliferation, A model for random chain complexes, Large cycles in random generalized Johnson graphs, Finding the resistance distance and eigenvector centrality from the network's eigenvalues, Evolution of cooperation in networked heterogeneous fluctuating environments, Inferring pattern generators on networks, On the influence maximization problem and the percolation phase transition, Secretary problem: graphs, matroids and greedoids, Phase transitions and percolation at criticality in enhanced random connection models, Undirected congruence model: topological characteristics and epidemic spreading, Public health interventions in the face of pandemics: network structure, social distancing, and heterogeneity, The completely delocalized region of the Erdős-Rényi graph, Adaptive persistence based on environment comparison enhances cooperation in evolutionary games, Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem, The random cluster model on the complete graph via large deviations, On the length of the shortest path in a sparse Barak-Erdős graph, A fair-cost analysis of the random neighbor sampling method, Rainbow and monochromatic vertex-connection of random graphs, Phases of small worlds: a mean field formulation, On a game of chance in Marc Elsberg's thriller ``GREED, Predicting the cascading failure of dynamical networks based on a new dimension reduction method, A case study on the shareholder network effect of stock market data: an SARMA approach, On the theory of dynamic graph regression problem, Cover time on a square lattice by two colored random walkers, Optimal synchronizability of complex networks, Loose cores and cycles in random hypergraphs, COVID-19 epidemic under the K-quarantine model: network approach, Typical values of extremal-weight combinatorial structures with independent symmetric weights, Amplitude death in multiplex networks with competing attractive and repulsive interactions, The covering threshold of a directed acyclic graph by directed acyclic subgraphs, Erosion of synchronization: coupling heterogeneity and network structure, A dynamic logistic regression for network link prediction, Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning, The complex network synchronization via chaos control nodes, Non-consensus opinion models on complex networks, Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity, Phase transition in a random NK landscape model, On extremal problems of graphs and generalized graphs, The evolution of the random reversal graph, Formation of a giant component in the intersection graph of a random chord diagram, High-dimensional tests for functional networks of brain anatomic regions, Robust sparse Gaussian graphical modeling, Monadic second-order properties of very sparse random graphs, Complex networks: structure and dynamics, Resolving Braess's paradox in random networks, The emergence of ``super-groups in dynamical networks, Incremental algorithm for maintaining a DFS tree for undirected graphs, Epidemic spreading over quenched networks with local behavioral response, Comparing classical and quantum pageranks, Labelled graph strategic rewriting for social networks, A metric to compare vulnerability of the graphs of different sizes, The first order theory of \(G(n, c/n)\), Influence maximization with deactivation in social networks, Examining the potential effects of species aggregation on the network structure of food webs, Thresholds for virus spread on networks, The continuum limit of critical random graphs, Circular law theorem for random Markov matrices, Estimating and understanding exponential random graph models, Critical phenomena in exponential random graphs, Unlacing hypercube percolation: a survey, On the tree-depth of random graphs, Applying correlation dimension to the analysis of the evolution of network structure, Efficient identifications of structural similarities for graphs, Time-dependent solution of the NIMFA equations around the epidemic threshold, Boolean dynamics of Kauffman models with a scale-free network, Composite centrality: a natural scale for complex evolving networks, Adaptive network dynamics and evolution of leadership in collective migration, Optimally connected hybrid complex networks with windmill graphs backbone, Almost Eulerian compatible spanning circuits in edge-colored graphs, On the line graph of a graph with diameter 2, On the number of weakly connected subdigraphs in random \(k\)NN digraphs, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Best response dynamics improve sustainability and equity outcomes in common-pool resources problems, compared to imitation dynamics, Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs, Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model, Deficiency zero for random reaction networks under a stochastic block model framework, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Statistical physics approaches to the complex Earth system, Interplay between epidemic spread and information diffusion on two-layered networks with partial mapping, An up-to-date review of scan statistics, Reputation-based co-evolutionary model promotes cooperation in prisoner's dilemma game, Preferential attachment without vertex growth: emergence of the giant component, Graphon-valued stochastic processes from population genetics, Effects of asymptomatic infection and self-initiated awareness on the coupled disease-awareness dynamics in multiplex networks, Limiting distribution of short cycles in inhomogeneous random uniform hypergraph, Identification of information networks in stock markets, Thresholds for extreme orientability, Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs, Network construction with subgraph connectivity constraints, Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives, Percolation on dense graph sequences, Query evaluation on a database given by a random graph, Occupancy problems and random algebras, The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws, Reputation-based popularity promotes cooperation in the spatial prisoner's dilemma game, Detecting a most closeness-central clique in complex networks, Search for an immobile hider on a stochastic network, Scalable and exact sampling method for probabilistic generative graph models, A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network, The geometry of continuous latent space models for network data, Consistent structure estimation of exponential-family random graph models with block structure, Pair quenched mean-field approach to epidemic spreading in multiplex networks, Finite-time synchronization of complex multilinks networks with perturbations and time-varying delay based on nonlinear adaptive controller, Observer-based lag synchronization between two different complex networks, Threshold analysis of the susceptible-infected-susceptible model on overlay networks, Contagion spreading on complex networks with local deterministic dynamics, On the logistic behaviour of the topological ultrametricity of data, The mystery of the six degrees of separation. I: From order to random, Limit laws for the number of triangles in the generalized random graphs with random node weights, Upper tail bounds for stars, A new class of the planar networks with high clustering and high entropy, Counting copies of a fixed subgraph in \(F\)-free graphs, A note on log-concave random graphs, Evolutionary dynamics on graphs -- the effect of graph structure and initial placement on mutant spread, The eternal multiplicative coalescent encoding via excursions of Lévy-type processes, The Myerson value on local structures of coalitions, The graph spectra and spectral moments of random graphs, Eigenvector-based identification of bipartite subgraphs, Decay of correlations and uniqueness of the Infinite-Volume Gibbs measure of the Canonical ensemble of 1d-lattice systems, Model-based clustering with sparse covariance matrices, Networks of random trees as a model of neuronal connectivity, Asymptotic behavior of lifetime sums for random simplicial complex processes, The maximal length of 2-path in random critical graphs, Adaptive synchronization of an uncertain coupling complex network with time-delay, Analytic description of the phase transition of inhomogeneous multigraphs, Vulnerability aware graphs for RFID protocol security benchmarking, An old approach to the giant component problem, Gaussian networks generated by random walks, On the zero-one 4-law for the Erdős-Rényi random graphs, An average study of hypergraphs and their minimal transversals, Constrained flow control in storage networks: capacity maximization and balancing, Bifurcation in Transmission Networks Under Variation of Link Capacity, Packing Hamilton Cycles Online, Sources of variation in social networks, Constructions of independent sets in random intersection graphs, Laplacian Spectra and Synchronization Processes on Complex Networks, TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks, Counting extensions, The critical point of \(k\)-clique percolation in the Erdős-Rényi graph, Internet Based Service Networks, A new framework to approach Vizing's conjecture, An information-percolation bound for spin synchronization on general graphs, Asymptotic theory of sparse Bradley-Terry model, A two-step communication opinion dynamics model with self-persistence and influence index for social networks based on the DeGroot model, Finding key node sets in complex networks based on improved discrete fireworks algorithm, Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach, Identifying influential links to control spreading of epidemics, Isotropic random geometric networks in two dimensions with a penetrable cavity, Pinning synchronization of complex networks with time-varying outer coupling and nonlinear multiple time-varying delay coupling, The spatial inheritance enhances cooperation in weak prisoner's dilemmas with agents' exponential lifespan, Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States, Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes, Evaluating tacit knowledge diffusion with algebra matrix algorithm based social networks, BDD-based optimization for the quadratic stable set problem, Concentration of maximum degree in random planar graphs, Bifurcation and propagation dynamics of a discrete pair SIS epidemic model on networks with correlation coefficient, On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph, Verifiable communication on networks, A gentle introduction to the differential equation method and dynamic concentration, Relationship between fragility and resilience in complex networks, A graph complexity measure based on the spectral analysis of the Laplace operator, Controlling of nonlinear dynamical networks based on decoupling and re-coupling method, Mechanism of investor behavior propagation in stock market, Lower bounds on the chromatic number of random graphs, An exact method to generate all nondominated spanning trees, Diffusion of resources and their impact on epidemic spreading in multilayer networks with simplicial complexes, Group-wise shrinkage estimation in penalized model-based clustering, Quantum walk inspired algorithm for graph similarity and isomorphism, Upperbounds on the probability of finding marked connected components using quantum walks, Investigation of SIS epidemics on dynamic network models with temporary link deactivation control schemes, Threshold functions for incidence properties in finite vector spaces, On the structure of random graphs with constant \(r\)-balls, Large random simplicial complexes, III the critical dimension, Influence of behavioral adoption preference based on heterogeneous population on multiple weighted networks, A random growth model with any real or theoretical degree distribution, Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization, Asymptotics for Shamir's problem, DEMOGRAPHICS INDUCE EXTINCTION OF DISEASE IN AN SIS MODEL BASED ON CONDITIONAL MARKOV CHAIN, The distribution of first hitting times of randomwalks on Erdős–Rényi networks, Decentralized guaranteed cost dynamic control for synchronization of a complex dynamical network with randomly switching topology, Universal construction mechanism for networks from one-dimensional symbol sequences, On the strength of connectedness of a random graph, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Risk-Dependent Centrality in Economic and Financial Networks, Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study, Dynamics of random graphs with bounded degrees, Discontinuous percolation in diffusion-limited cluster aggregation, Evolution of autocatalytic sets in a competitive percolation model, Discontinuous transition of a multistage independent cascade model on networks, Topology dependent epidemic spreading velocity in weighted networks, Shortest node-disjoint paths on random graphs, Percolation transition of random networks under a piecewise linear weighted function, Using raster-based GIS and graph theory to analyze complex networks, A unified network performance measure with importance identification and the ranking of network components, Mathematical modeling of the malignancy of cancer using graph evolution, Local tail bounds for functions of independent random variables, The percolation signature of the spin glass transition, Lifshitz tails for spectra of Erdős-Rényi random graphs, Radio communication in random graphs, Monotone properties of random geometric graphs have sharp thresholds, Reconstruction of Kauffman networks applying trees, Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint), On topological minors in random simplicial complexes, The typical structure of sparse $K_{r+1}$-free graphs, The threshold function for vanishing of the top homology group of random 𝑑-complexes, Applications of the variance of final outbreak size for disease spreading in networks, Evolution of social networks, Colorings of partial Steiner systems and their applications, Strategies for network security, Statistical Characterization of a Small World Network Applied to Forest Fires, Phase Transitions in Discrete Structures, A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics, Determination of multifractal dimensions of complex networks by means of the sandbox algorithm, Small Subgraphs in Random Distance Graphs, An introduction to large deviations for random graphs, Synchronization of Heterogeneous Oscillators Under Network Modifications: Perturbation and Optimization of the Synchrony Alignment Function, On some extremal problems on \(r\)-graphs, On the spectral distribution of distance-k graph of free product graphs, On Hamilton-cycles of random graphs, On a Ramsey type theorem, Probabilistic methods in group theory, On the factorization of the complete graph, Two critical periods in the evolution of random planar graphs, A general critical condition for the emergence of a giant component in random graphs with given degrees, Control and optimal response problems for quasilinear impulsive integrodifferential equations, A hierarchy of randomness for graphs, Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics, The resolution complexity of random graph \(k\)-colorability, SAT distributions with planted assignments and phase transitions between decision and optimization problems, On the typical case complexity of graph optimization, Stochastic analysis and applications, On graphs with randomly deleted edges, Sharp thresholds of graph properties, and the $k$-sat problem, Bounds for the Twin-Width of Graphs, Randomized Reference Models for Temporal Networks, Percolation on spatial anisotropic networks*, Recent development on fragmentation, aggregation and percolation, Two-Population SIR Model and Strategies to Reduce Mortality in Pandemics, Stolarsky–Puebla Index, Convex Relaxations for Permutation Problems, The One-Out-of-k Retrieval Problem and Linear Network Coding, Some Introductory Notes on Random Graphs, Statistical Physics and Network Optimization Problems, Liquidity Shock, Animal Spirits and Bank Runs, Towards Identifying and Predicting Spatial Epidemics on Complex Meta-population Networks, A colored mean-field model for analyzing the effects of awareness on epidemic spreading in multiplex networks, Analyzing local and global properties of multigraphs, Short Monadic Second Order Sentences about Sparse Random Graphs, Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability, Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability, Information geometric methods for complexity, Small subgraphs and their extensions in a random distance graph, Complexity of Coloring Random Graphs, Liquidity Induced Asset Bubbles via Flows of ELMMs, Criteria for stochastic pinning control of networks of chaotic maps, Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease, Synchronizability of random rectangular graphs, Interplay between the local information based behavioral responses and the epidemic spreading in complex networks, Unnamed Item, A dynamic topological sort algorithm for directed acyclic graphs, Limiting properties of stochastic quantum walks on directed graphs, First-order properties of bounded quantifier depth of very sparse random graphs, On controlling networks of limit-cycle oscillators, Random Simplicial Complexes, Unnamed Item, Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs, On percolation and ‐hardness, Corona graphs as a model of small-world networks, The evolution of altruism in spatial threshold public goods games via an insurance mechanism, Laplacian spectrum of a family of recursive trees and its applications in network coherence, Equilibria, information and frustration in heterogeneous network games with conflicting preferences, The distribution of first hitting times of random walks on directed Erdős–Rényi networks, Controllability and observability of cascading failure networks, The many faces of graph dynamics, Generalizedk-core pruning process on directed networks, Impact of imperfect vaccination and defense against contagion on vaccination behavior in complex networks, Universality of local spectral statistics of random matrices, Entropy production and fluctuation theorems on complex networks, Susceptible-infected-recovered epidemics in random networks with population awareness, Generating symmetric graphs, Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time, Charting the replica symmetric phase, On the evolution of random graphs over expanding square lattices, Simple, Robust and Optimal Ranking from Pairwise Comparisons, Community Detection and Stochastic Block Models, Statistical inference on random dot product graphs: a survey, Decentralized adaptive synchronization of an uncertain complex delayed dynamical network, Giant Component in Random Multipartite Graphs with Given Degree Sequences, Small-world graphs: characterization and alternative constructions, Совместность случайных систем уравнений с неравновероятной выборкой двузначных неизвестных, Exponential Random Graphs as Models of Overlay Networks, Hidden Population Size Estimation From Respondent-Driven Sampling: A Network Approach, Largest Components in Random Hypergraphs, Reducing a cortical network to a Potts model yields storage capacity estimates, Community Finding of Scale-Free Network: Algorithm and Evaluation Criterion, Network of interacting neurons with random synaptic weights, Random stable matchings, Inhomogeneous percolation models for spreading phenomena in random graphs, Review of statistical network analysis: models, algorithms, and software, Existence thresholds and Ramsey properties of random posets, The Kőnig graph process, Epidemic spreading on multilayer homogeneous evolving networks, Large-deviation properties of resilience of power grids, Unimodular lattice triangulations as small-world and scale-free random graphs, Detecting interactions in discrete-time dynamics by random variable resetting, Every monotone graph property has a sharp threshold, Approximability Distance in the Space of H-Colourability Problems, Zero-One Laws for Sparse Random Graphs, On the greedy algorithm with random costs, Random Trees in Random Graphs, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, Additional Closeness and Networks Growth, The threshold for the square of a Hamilton cycle, Sharp concentration of the equitable chromatic number of dense random graphs, The replica symmetric phase of random constraint satisfaction problems, Simplicial SIRS epidemic models with nonlinear incidence rates, Counterparty Credit Limits: The Impact of a Risk-Mitigation Measure on Everyday Trading, The Structure of an Outbreak on a College Campus, A Random Graph With a Subcritical Number of Edges, Bayesian Structure Learning in Multilayered Genomic Networks, The combination of targeted vaccination and ring vaccination, Speed and concentration of the covering time for structured coupon collectors, Synchronization and extinction in a high-infectivity spatial SIRS with long-range links, Mesoscopic model reduction for the collective dynamics of sparse coupled oscillator networks, SAT Distributions with Phase Transitions between Decision and Optimization Problems, Topology of random -dimensional cubical complexes, Evolution of random graph processes with degree constraints, Hitting times for Shamir’s problem, Performance and robustness of discrete and finite time average consensus algorithms, Critical percolation on random regular graphs, The mean and variance of the distribution of shortest path lengths of random regular graphs, Random Simplicial Complexes: Models and Phenomena, A view from the bridge spanning combinatorics and probability, Non-equilibrium random walks on multiplex networks, Efficient Learning of Quadratic Variance Function Directed Acyclic Graphs via Topological Layers, The Euler characteristic as a topological marker for outbreaks in vector-borne disease, Synchronization in complex networks with long-range interactions, Rigidity Percolation in Disordered 3D Rod Systems, Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering, Change-Point Detection for Graphical Models in the Presence of Missing Values, Contagion dynamics in multilayer networks with community structure, Random simplicial complexes, duality and the critical dimension, Optimal control of aging in complex networks, The shape of partial correlation matrices, Maps on random hypergraphs and random simplicial complexes, Gravitational community detection by predicting diameter, On the Power of Choice for Boolean Functions, An Updated Experimental Evaluation of Graph Bipartization Methods, Efficient and Reliable Overlay Networks for Decentralized Federated Learning, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Эволюционные уравнения и случайные графы, Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs, Bounds on the Spectral Radius of Digraphs from Subgraph Counts, Overcoming Oscillation Quenching via Mean-Field Feedback, Information and Dimensionality of Anisotropic Random Geometric Graphs, A Short Proof of the Random Ramsey Theorem, Convergence of Achlioptas Processes via Differential Equations with Unique Solutions, Counting Connected Hypergraphs via the Probabilistic Method, Logical laws for short existential monadic second-order sentences about graphs, Percolation on Homology Generators in Codimension One, Manipulative Waiters with Probabilistic Intuition, The Threshold Probability for Long Cycles, Planting Colourings Silently, A bird’s-eye view of naming game dynamics: From trait competition to Bayesian inference, Modularity of Erdős‐Rényi random graphs, First-order zero-one law for the uniform model of the random graph, Random Graphs and Their Subgraphs, Subcritical Random Hypergraphs, High-Order Components, and Hypertrees, Asymptotic normality in random graphs with given vertex degrees, Phase transitions in graphs on orientable surfaces, Spreading of two interacting diseases in multiplex networks, Optimal Nonlinear Pricing in Social Networks Under Asymmetric Network Information, Upper Tail Bounds for Cycles, An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances, Two faces of greedy leaf removal procedure on graphs, Random Čech complexes on Riemannian manifolds, Discontinuous percolation transitions in growing networks, Unnamed Item, Average-Case Analysis of Online Topological Ordering, A General Framework for Stable Roommates Problems using Answer Set Programming, The relationship between structure and function in locally observed complex networks, Temporal prediction of epidemic patterns in community networks, Arm exponents in high dimensional percolation, Information Spreading in Dynamic Networks: An Analytical Approach, Non-concentration of the chromatic number of a random graph, Consensus dynamics on weighted multiplex networks: a long-range interaction perspective, Co-controllability of drug-disease-gene network, Spatial autoregression with repeated measurements for social networks, The idemetric property: when most distances are (almost) the same, CUSUM multi-chart for detecting unknown abrupt changes under finite measure space for network observation sequences, Longest Paths in Random Hypergraphs, Maximum likelihood estimation for discrete exponential families and random graphs, Topics of Stochastic Algebraic Topology, Counting connected graphs with large excess, Unnamed Item, On the connectivity and diameter of small-world networks, Percolation Hamiltonians, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, Constrained Stress Majorization Using Diagonally Scaled Gradient Projection, Infinitary logic for computer science, Random 2-XORSAT at the Satisfiability Threshold, THE CORRELATION OF THE DEGREES OF BERNOULLI RANDOM GRAPHS, Mathematical analysis of nonlocal PDEs for network generation, Cluster synchronization: From single-layer to multi-layer networks, The probability of unusually large components in the near-critical Erdős–Rényi graph, A counterexample to the DeMarco‐Kahn upper tail conjecture, Plane and planarity thresholds for random geometric graphs, Data Based Reconstruction of Duplex Networks, Finite-Time Influence Systems and the Wisdom of Crowd Effect, On the Number of Solutions in Random Graphk-Colouring, Expected Maximum Block Size in Critical Random Graphs, Cross-Multiplicative Coalescent Processes and Applications, On Erdős–Ko–Rado for random hypergraphs I, On Komlós’ tiling theorem in random graphs, On a conditionally Poissonian graph process, TheN-star network evolution model, Multiscale dynamics of an adaptive catalytic network, Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier, Optimal threshold for a random graph to be 2-universal, Diffusion processes on small-world networks with distance dependent random links, Гигантская компонента в случайных дистанционных графах специального вида, On the probability of planarity of a random graph near the critical point, On the Second Largest Component of Random Hyperbolic Graphs, Replica theory for Levy spin glasses, Consensus and synchronization problems on small-world networks, The Phase Transition in Multitype Binomial Random Graphs, Unnamed Item, The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks, Universal finite-size scaling for percolation theory in high dimensions, The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes, Graphical construction of spatial Gibbs random graphs, Triangles in randomly perturbed graphs, The critical window in random digraphs, The integer homology threshold in 𝑌_{𝑑}(𝑛,𝑝), Degree-biased advection–diffusion on undirected graphs/networks, Epidemic spreading on metapopulation networks considering indirect contact, Evolving Shelah‐Spencer graphs, Continuum limit of p-Laplacian evolution problems on graphs: Lq graphons and sparse graphs, A probabilistic approach to the leader problem in random graphs, On a problem of M. Talagrand, Approximating sparse graphs: The random overlapping communities model, A proof of the Kahn–Kalai conjecture, Perfect matchings in random subgraphs of regular bipartite graphs, A random graph model for clustering graphs, Phase transition in count approximation by count-min sketch with conservative updates, The giant component after percolation of product graphs, A local algorithm and its percolation analysis of bipartite z-matching problem, Dynamic treatment regimes with interference, Cycle lengths in randomly perturbed graphs, Representing complex networks without connectivity via spectrum series, An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs, Recurrent emotional contagion for the crowd evacuation of a cyber-physical society, Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis, A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph, A scaling limit for the length of the longest cycle in a sparse random digraph, Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes, Color‐biased Hamilton cycles in random graphs, Phase transition in random intersection graphs with communities, Longest and shortest cycles in random planar graphs, Limiting probabilities of first order properties of random sparse graphs and hypergraphs, Ramsey goodness of trees in random graphs, Data-Driven Discovery of Governing Equations for Coarse-Grained Heterogeneous Network Dynamics, Site percolation on pseudo‐random graphs, Down‐set thresholds, Growth strategy determines the memory and structural properties of brain networks, Testing for association in multiview network data, The mechanisms of labor division from the perspective of task urgency and game theory, Network reliability: Heading out on the highway, On evolving network models and their influence on opinion formation, Modeling the competitive propagation of rumors and counter-rumors in two-layer complex networks with nonlinear spreading and decay rates, Convergence of blanket times for sequences of random walks on critical random graphs, An integer program for positive semidefinite zero forcing in graphs, Contagion dynamics on a compound model, A study of connectivity on dynamic graphs: computing persistent connected components, Solving larger maximum clique problems using parallel quantum annealing, The influence of social embedding on belief system and its application in online public opinion guidance, On the time to identify the nodes in a random graph, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, The scaling limit of a critical random directed graph, Formalizing delayed adaptive corruptions and the security of flooding networks, To copatent or not to copatent: an agent-based model for firms facing this dilemma, Peer effects and endogenous social interactions, Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication, Bounding robustness in complex networks under topological changes through majorization techniques, On the chromatic number in the stochastic block model, Triangles and subgraph probabilities in random regular graphs, Combinatorial statistics and the sciences, Phase transitions in a power-law uniform hypergraph, Random hypergraphs, random simplicial complexes and their Künneth-type formulae, Impact of non-diffusive interactions on Turing instability, The birth of the strong components, Scalable approximate Bayesian computation for growing network models via extrapolated and sampled summaries, One‐sided sharp thresholds for homology of random flag complexes, CONTAGION IN HETEROGENEOUS FINANCIAL NETWORKS, CONTROLLING NETWORK DYNAMICS, ENERGY COST FOR TARGET CONTROL OF COMPLEX NETWORKS, Solving maximum weighted matching on large graphs with deep reinforcement learning, Speeding up random walk mixing by starting from a uniform vertex, Sharp Thresholds in Random Simple Temporal Graphs, Large-deviation properties of largest component for random graphs, Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules, Exact enumeration of satisfiable 2-SAT formulae, Risk‐averse optimization and resilient network flows, How does the chromatic number of a random graph vary?, Unnamed Item, Unnamed Item, Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems, Paul Erdős, 1913-1996, Counting configuration-free sets in groups, Coloring the edges of a random graph without a monochromatic giant component, Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs, Resilience for the Littlewood-Offord problem, Almost all graphs with average degree 4 are 3-colorable, The condensation phase transition in random graph coloring, An exact algorithm for robust influence maximization, Evolutionary dynamics with game transitions, Discrete scale invariance in supercritical percolation, A Theory of Network Security: Principles of Natural Selection and Combinatorics, Tree decompositions and social graphs, On solving the densestk-subgraph problem on large graphs, Pandemic spread in communities via random graphs, Imaginary replica analysis of loopy regular random graphs, Discontinuous percolation transitions in cluster merging processes, Spectral theory of sparse non-Hermitian random matrices, Top eigenpair statistics for weighted sparse graphs, Analytical results for the distribution of first hitting times of random walks on random regular graphs, Phase transitions in the Ising model on a hierarchical random graph based on the triangle, Probabilistic intuition holds for a class of small subgraph games, Multidimensional Lambert-Euler inversion and vector-multiplicative coalescent processes, Graphs, hypergraphs and hashing, Controlling the spread of infectious diseases by using random walk method to remove many important links, A General Pairwise Comparison Model for Extremely Sparse Networks, The communication complexity of functions with large outputs, Nonlinear directed acyclic graph estimation based on the kernel partial correlation coefficient, Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs, Largest component of subcritical random graphs with given degree sequence, Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model, Two typical analytic models for reverse bond percolation on real networks, Shor–Laflamme distributions of graph states and noise robustness of entanglement, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Embedded topics in the stochastic block model, On the complexity of binary polynomial optimization over acyclic hypergraphs, Large-deviation properties of SIR model incorporating protective measures, Network-based uncertainty quantification for mathematical models in epidemiology, Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks, Girth, magnitude homology and phase transition of diagonality, Scheduling on uniform machines with a conflict graph: complexity and resolution, The mass of simple and higher-order networks, Neural pinning control for adaptive trajectory tracking of complex dynamical networks, Robust exponential stabilization of stochastic coupled T‐S fuzzy complex networks subject to state‐dependent impulsive control, Guarantees for Spontaneous Synchronization on Random Geometric Graphs, Asymptotic bounds for clustering problems in random graphs, How social networks influence human behavior: an integrated latent space approach for differential social influence, Adaptive randomization in network data, Prominent examples of flip processes, Sharp thresholds in adaptive random graph processes, High-dimensional Bayesian network classification with network global-local shrinkage priors, A GENERALIZATION OF THRESHOLD-BASED AND PROBABILITY-BASED MODELS OF INFORMATION DIFFUSION, Unnamed Item, Unnamed Item
