Add to ORKGA way to study, theoretically and computationally, the number and the form of linked polygons configurations with the Hopf topology (and more) in the asymptotic limit of large lengths.ope
23 pages, LateXWe solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matri...
We review recent theoretical studies on the statistical and dynamical properties of polymers with no...
We study asymptotic properties of diffusion and other transport processes (including self-avoiding w...
A way to study, theoretically and computationally, the number and the form of linked polygons config...
We describe a model of random links based on random 4-valent maps, which can be sampled due to the w...
A veritable zoo of different knots is seen in the ensemble of looped polymer chains, whether created...
This thesis is dedicated to the study of the asymptotic behavior of some large random graphs and tre...
In this thesis the author examines geometric properties of (Poisson) loop soups generated from loop ...
International audienceWe study random knotting by considering knot and link diagrams as decorated, (...
Our world is filled with complex systems, ranging from technological systems such as the Internet an...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
Polymer networks invariably possess topological defects: loops of different orders which have profou...
A scaling theory of general polymer networks in bulk and semi-infinite good solvents is derived by u...
Cette thèse est consacrée à l'étude du comportement asymptotique de grands graphes et arbres aléatoi...
This thesis is devoted to the detectability of an inhomogeneous region possibly embedded in a noisy ...
23 pages, LateXWe solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matri...
We review recent theoretical studies on the statistical and dynamical properties of polymers with no...
We study asymptotic properties of diffusion and other transport processes (including self-avoiding w...
A way to study, theoretically and computationally, the number and the form of linked polygons config...
We describe a model of random links based on random 4-valent maps, which can be sampled due to the w...
A veritable zoo of different knots is seen in the ensemble of looped polymer chains, whether created...
This thesis is dedicated to the study of the asymptotic behavior of some large random graphs and tre...
In this thesis the author examines geometric properties of (Poisson) loop soups generated from loop ...
International audienceWe study random knotting by considering knot and link diagrams as decorated, (...
Our world is filled with complex systems, ranging from technological systems such as the Internet an...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
Polymer networks invariably possess topological defects: loops of different orders which have profou...
A scaling theory of general polymer networks in bulk and semi-infinite good solvents is derived by u...
Cette thèse est consacrée à l'étude du comportement asymptotique de grands graphes et arbres aléatoi...
This thesis is devoted to the detectability of an inhomogeneous region possibly embedded in a noisy ...
23 pages, LateXWe solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matri...
We review recent theoretical studies on the statistical and dynamical properties of polymers with no...
We study asymptotic properties of diffusion and other transport processes (including self-avoiding w...