The following pages link to Jean-François Marckert (Q168481):
Displaying 49 items.
- Processes iterated ad libitum (Q326834) (← links)
- A new encoding of coalescent processes: applications to the additive and multiplicative cases (Q328790) (← links)
- Directed animals, quadratic systems and rewriting systems (Q456390) (← links)
- Markovianity of the invariant distribution of probabilistic cellular automata on the line (Q491921) (← links)
- Measure-valued Pólya urn processes (Q516105) (← links)
- Limit of normalized quadrangulations: the Brownian map (Q874732) (← links)
- Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
- Directed animals and gas models revisited (Q1010631) (← links)
- Uniform bounds for exponential moment of maximum of a Dyck path (Q1038972) (← links)
- Some families of increasing planar maps (Q1039067) (← links)
- States spaces of the snake and its tour: Convergence of the discrete snake (Q1426861) (← links)
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk (Q1429105) (← links)
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion (Q1431505) (← links)
- Iterated foldings of discrete spaces and their limits: candidates for the role of Brownian map in higher dimensions (Q2070447) (← links)
- Parameterised branching processes: a functional version of Kesten \& Stigum theorem (Q2169076) (← links)
- A natural stochastic extension of the sandpile model on a graph (Q2349213) (← links)
- The probability that \(n\) random points in a disk are in convex position (Q2357058) (← links)
- Many empty triangles have a common edge (Q2391838) (← links)
- One more approach to the convergence of the empirical process to the Brownian bridge (Q2426828) (← links)
- Invariance principles for random bipartite planar maps (Q2456024) (← links)
- Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks (Q2461969) (← links)
- The lineage process in Galton-Watson trees and globally centered discrete snakes (Q2476404) (← links)
- Reinforced weak convergence of stochastic processes (Q2483844) (← links)
- Convergence of discrete snakes (Q2576794) (← links)
- Directed, cylindric and radial Brownian webs (Q2631845) (← links)
- Growing random uniform \(d\)-ary trees (Q2694455) (← links)
- Parking with density (Q2746214) (← links)
- Asymptotics of geometrical navigation on a random set of points in the plane (Q3111049) (← links)
- (Q3176602) (← links)
- The rotation correspondence is asymptotically a dilatation (Q4459585) (← links)
- Ladder variables, internal structure of Galton–Watson trees and finite branching random walks (Q4462696) (← links)
- (Q4524565) (← links)
- Noncrossing trees are almost conditioned Galton–Watson trees (Q4534222) (← links)
- A new combinatorial representation of the additive coalescent (Q4633321) (← links)
- The combinatorics of the colliding bullets (Q5113944) (← links)
- Invariant measures of interacting particle systems: Algebraic aspects (Q5135955) (← links)
- Compact convex sets of the plane and probability theory (Q5174383) (← links)
- On the reduction of a random basis (Q5194619) (← links)
- The CRT is the scaling limit of unordered binary trees (Q5198666) (← links)
- Asymptotics of trees with a prescribed degree sequence and applications (Q5415593) (← links)
- On the reduction of a random basis (Q5851031) (← links)
- Parking functions, empirical processes, and the width of rooted labeled trees (Q5928528) (← links)
- AROUND SYLVESTER'S QUESTION IN THE PLANE (Q6072622) (← links)
- A combinatorial proof of Aldous–Broder theorem for general Markov chains (Q6074870) (← links)
- Almost triangular Markov chains on \(\mathbb{N}\) (Q6136837) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
- Growing random uniform d-ary trees (Q6367464) (← links)
- Markov chains on trees: almost lower and upper directed cases (Q6752965) (← links)
- The Sylvester question in $\mathbb{R}^d$: convex sets with a flat floor (Q6753241) (← links)
