The following pages link to (Q3509398):
Displaying 24 items.
- The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks (Q332431) (← links)
- Extreme values for two-dimensional discrete Gaussian free field (Q400568) (← links)
- Maximum of the characteristic polynomial of random unitary matrices (Q507178) (← links)
- Direct consequences of the basic ballot theorem (Q634565) (← links)
- Total progeny in killed branching random walk (Q644779) (← links)
- Planar stochastic hyperbolic triangulations (Q737310) (← links)
- Sharp probability estimates for random walks with barriers (Q839420) (← links)
- A history and a survey of lattice path enumeration (Q972828) (← links)
- Return probabilities on nonunimodular transitive graphs (Q2084837) (← links)
- Generating 2-Gray codes for ballot sequences in constant amortized time (Q2092396) (← links)
- Noise sensitivity and exceptional times of transience for a simple symmetric random walk in one dimension (Q2200500) (← links)
- Maximal displacement of a supercritical branching random walk in a time-inhomogeneous random environment (Q2274298) (← links)
- A three-player singled out game (Q2320995) (← links)
- Percolations on random maps. I: Half-plane models (Q2346178) (← links)
- The half plane UIPT is recurrent (Q2413242) (← links)
- A model problem for multiplicative chaos in number theory (Q2674713) (← links)
- Convergence in Law of the Maximum of the Two‐Dimensional Discrete Gaussian Free Field (Q3461980) (← links)
- (Q4634994) (← links)
- Asymptotic of the maximal displacement in a branching random walk (Q5043134) (← links)
- An elementary approach to component sizes in critical random graphs (Q5049906) (← links)
- Smart Contract Execution - the (+-)-Biased Ballot Problem. (Q5136237) (← links)
- Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems (Q5886344) (← links)
- Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022 (Q6095414) (← links)
- The probability of unusually large components for critical percolation on random \(d\)-regular graphs (Q6110546) (← links)
