scientific article; zbMATH DE number 2042286
From MaRDI portal
Publication:4450065
Recommendations
- scientific article; zbMATH DE number 1839489
- Maximum Weight Partial Colorings on Sparse Random Graphs
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
Cited in
(only showing first 100 items - show all)- Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality
- Diameter of the stochastic mean-field model of distance
- Accessibility percolation on random rooted labeled trees
- Asymptotic enumeration and limit laws for multisets: the subexponential case
- The rank of sparse random matrices
- The topological behavior of preferential attachment graphs
- Emergence of extended states at zero in the spectrum of sparse random graphs
- Singularity of the \(k\)-core of a random graph
- Local weak limits for collapsed branching processes with random out-degrees
- Maximum independent sets on random regular graphs
- Pagerank asymptotics on directed preferential attachment networks
- Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
- Spectra of large random trees
- The densest subgraph problem in sparse random graphs
- The number of accessible paths in the hypercube
- On local weak limit and subgraph counts for sparse random graphs
- Matchings on infinite graphs
- A unified framework for generalizing the Gromov-Hausdorff metric
- General epidemiological models: law of large numbers and contact tracing
- Covering a compact space by fixed-radius or growing random balls
- Partition functions of discrete coalescents: from Cayley's formula to Frieze's (3) limit theorem
- Local picture and level-set percolation of the Gaussian free field on a large discrete torus
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results
- Weak disorder in the stochastic mean-field model of distance. II
- Belief propagation for optimal edge cover in the random complete graph
- A fractal dimension for measures via persistent homology
- A survey of max-type recursive distributional equations
- Interacting diffusions on sparse graphs: hydrodynamics from local weak limits
- Maxima and near-maxima of a Gaussian random assignment field
- Dynamic space efficient hashing
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Eternal family trees and dynamics on unimodular random graphs
- Planar stochastic hyperbolic triangulations
- Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics
- On the expected total number of infections for virus spread on a finite network
- Random eigenvalues of graphenes and the triangulation of plane
- Weak disorder asymptotics in the stochastic mean-field model of distance
- Least squares approximation to the distribution of project completion times with Gaussian uncertainty
- The wired minimal spanning forest on the Poisson-weighted infinite tree
- The functional equation of the smoothing transform
- Invasion percolation on power-law branching processes
- Replica symmetry of the minimum matching
- Invasion percolation on the Poisson-weighted infinite tree
- Ising models on locally tree-like graphs
- Local convergence of random graph colorings
- Distributionally robust mixed integer linear programs: persistency models with applications
- Random infinite squarings of rectangles
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Endogeny for the logistic recursive distributional equation
- Around the circular law
- Local neighbourhoods for first-passage percolation on the configuration model
- Limiting properties of random graph models with vertex and edge weights
- Eigenvector statistics of Lévy matrices
- The mean field traveling salesman and related problems
- A framework for imperfectly observed networks
- Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group
- Near-minimal spanning trees: A scaling exponent in probability models
- Factor models on locally tree-like graphs
- Laws of large numbers in stochastic geometry with statistical applications
- Large deviations for marked sparse random graphs with applications to interacting diffusions
- Local weak limit of preferential attachment random trees with additive fitness
- Random minimum spanning tree and dense graph limits
- Gaussian limits for random measures in geometric probability
- Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models
- Parking on a random rooted plane tree
- Optimal stationary markings
- The minimal spanning tree and the upper box dimension
- Dynamic random intersection graph: dynamic local convergence and giant structure
- Recurrence of planar graph limits
- Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
- Ground states for exponential random graphs
- Tree convolution for probability distributions with unbounded support
- Lévy-Khintchine random matrices and the Poisson weighted infinite skeleton tree
- The radial spanning tree of a Poisson point process
- Connectivity of random graphs after centrality-based vertex removal
- Cutting down trees with a Markov chainsaw
- Degree-penalized contact processes
- Transitive graphs uniquely determined by their local structure
- Multisource invasion percolation on the complete graph
- Target-based distributionally robust minimum spanning tree problem
- Minimal spanning forests
- Percolations on random maps. I: Half-plane models
- Mean-field monomer-dimer models. A review
- Marked random graphs with given degree sequence: large deviations on the local topology and applications
- Local limit of the random degree constrained process
- Degree distribution of shortest path trees and bias of network sampling algorithms
- Normal approximation for statistics of randomly weighted complexes
- Renewal sequences and record chains related to multiple zeta sums
- Entropy of some models of sparse random graphs with vertex-names
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
- Attribute network models, stochastic approximation and network sampling
- The limiting distributions of large heavy Wigner and arbitrary random matrices
- On the phase transition in random simplicial complexes
- Ising models on power-law random graphs
- Interacting particle systems as stochastic social dynamics
- Spectrum of non-Hermitian heavy tailed random matrices
- The local approach to causal inference under network interference
- The weak limit of Ising models on locally tree-like graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450065)
