Recommendations
Cited in
(only showing first 100 items - show all)- Shareholding Networks and Centrality: An Application to the Italian Financial Market
- A randomized algorithm for the joining protocol in dynamic distributed networks
- On the extremal values of ratios of number of paths
- Consensus and synchronization problems on small-world networks
- Networks beyond pairwise interactions: structure and dynamics
- PageRank on inhomogeneous random digraphs
- Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
- scientific article; zbMATH DE number 7301719 (Why is no real title available?)
- A scale-free graph model based on bipartite graphs
- Fractal networks: topology, dimension, and complexity
- Expander properties and the cover time of random intersection graphs
- Paths through K-specified edges in a linear graph
- Asymptotic behaviour of estimates of link probability in random networks
- Bounded quantifier depth spectra for random graphs
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
- On the zero-one k-law extensions
- Directed cycles and related structures in random graphs. I: Static properties
- On the length of a random minimum spanning tree
- Best response dynamics on random graphs
- Statistical physics approaches to the complex Earth system
- How does the chromatic number of a random graph vary?
- Zero-one \(k\)-law
- Networks of random trees as a model of neuronal connectivity
- Conflict and error prevention and detection in complex networks
- Agency, potential and contagion
- Clustering coefficients of large networks
- Maintaining dynamic minimum spanning trees: an experimental study
- Approximately strongly regular graphs
- Typical and generic ranks in matrix completion
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability
- scientific article; zbMATH DE number 4147534 (Why is no real title available?)
- The energy of random signed graph
- A discrete model of market interaction in the presence of social networks and price discrimination
- Asymptotic probabilities of extension properties and random l-colourable structures
- The small world effect on the coalescing time of random walks
- A probabilistic algorithm for vertex cover
- On the maximum number of copies of H in graphs with given size and order
- Sparse partition universal graphs for graphs of bounded degree
- Codes identifying sets of vertices in random networks
- A likelihood-ratio type test for stochastic block models with bounded degrees
- Characterisations and examples of graph classes with bounded expansion
- Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
- Lower bounds of size Ramsey number for graphs with small independence number
- MSO 0-1 law for recursive random trees
- Modeling systemic risk with Markov switching graphical SUR models
- An approximate version of Sumner's universal tournament conjecture
- Path hitting in acyclic graphs
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- Jamming in complex networks with degree correlation
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- Anti-Ramsey properties of random graphs
- On the average-case complexity of parameterized clique
- Maximum induced trees in sparse random graphs
- Search for an immobile hider on a stochastic network
- Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
- Spreading messages
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
- Interpolating between bounds on the independence number
- Path Ramsey number for random graphs
- Singular value decomposition of large random matrices (for two-way classification of microarrays)
- Counting extensions revisited
- Component structure of the configuration model: barely supercritical case
- Small subgraphs in random graphs and the power of multiple choices
- Some colouring problems for Paley graphs
- Edge-colouring graphs with bounded local degree sums
- Variance of the subgraph count for sparse Erdős-Rényi graphs
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Percolation on complex networks: theory and application
- Successive minimum spanning trees
- Random simplicial complexes in the medial regime
- Existential monadic second order convergence law fails on sparse random graphs
- Diffusion and cascading behavior in random networks
- Thresholding random geometric graph properties motivated by ad hoc sensor networks
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- Keisler's order is not simple (and simple theories may not be either)
- Epidemic models on social networks—With inference
- Limiting probabilities of first order properties of random sparse graphs and hypergraphs
- Random walk on the random connection model
- When is a random graph projective?
- The component structure of dense random subgraphs of the hypercube
- Bridge-addability, edge-expansion and connectivity
- Goldberg's conjecture is true for random multigraphs
- The size‐Ramsey number of short subdivisions
- Competition for the access to and use of information in networks
- On the generalized Wiener polarity index of trees with a given diameter
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- Epidemic random network simulations in a distributed computing environment
- Cores of random \(r\)-partite hypergraphs
- Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates
- Critical window for connectivity in the configuration model
- Planting colourings silently
- A note on competitive diffusion through social networks
- Globally exponential synchronization in an array of asymmetric coupled neural networks
- Paths of length four
- A note on the \(H\) index in random networks
- Phase transitions and percolation at criticality in enhanced random connection models
- Monadic second-order properties of very sparse random graphs
- The threshold probability for long cycles
- Universality in Anderson localization on random graphs with varying connectivity
This page was built for publication: Paths in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780288)
