Adrien Joseph
We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behaviours of the shattering times, defined as the first instants when all the blocks of the partition process have cardinality less than a fixed integer. Our results may be applied to the study of certain random split trees.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider the height process of a Lévy process with no negative jumps, and its associated continuous tree representation. Using tools developed by Duquesne and Le Gall, we construct a fragmentation process at height, which generalizes the fragmentation at height of stable trees given by Miermont. In this more general framework, we recover that the dislocation measures are the same as the dislocation measures of the fragmentation at node introduced by Abraham and Delmas, up to a factor equal to the fragment size. We also compute the asymptotic for the number of small fragments.
The basic object we consider is a certain model of continuum random tree, called the stable tree. We construct a fragmentation process $(F^-(t), t>=0)$ out of this tree by removing the vertices located under height $t$. Thanks to a self-similarity property of the stable tree, we show that the fragmentation process is also self-similar. The semigroup and other features of the fragmentation are given explicitly. Asymptotic results are given, as well as a couple of related results on continuous-state branching processes.
We present a further analysis of the fragmentation at heights of the normalized Brownian excursion. Specifically we study a representation for the mass of a tagged fragment in terms of a Doob transformation of the 1/2-stable subordinator and use it to study its jumps; this accounts for a description of how a typical fragment falls apart. These results carry over to the height fragmentation of the stable tree. Additionally, the sizes of the fragments in the Brownian fragmentation when it is about to reduce to dust are described in a limit theorem.
Given a general critical or sub-critical branching mechanism and its associated Lévy continuum random tree, we consider a pruning procedure on this tree using a Poisson snake. It defines a fragmentation process on the tree. We compute the family of dislocation measures associated with this fragmentation. This work generalizes the work made for a Brownian tree [Abraham, Serlet] and for a tree without Brownian part [Abraham, Delmas].
We show that the genealogy of any self-similar fragmentation process can be encoded in a compact measured real tree. Under some Malthusian hypotheses, we compute the fractal Hausdorff dimension of this tree through the use of a natural measure on the set of its leaves. This generalizes previous work of Haas and Miermont which was restricted to conservative fragmentation processes.
We encode a certain class of stochastic fragmentation processes, namely self-similar fragmentation processes with a negative index of self-similarity, into a metric family tree which belongs to the family of Continuum Random Trees of Aldous. When the splitting times of the fragmentation are dense near 0, the tree can in turn be encoded into a continuous height function, just as the Brownian Continuum Random Tree is encoded in a normalized Brownian excursion. Under mild hypotheses, we then compute the Hausdorff dimensions of these trees, and the maximal Hölder exponents of the height functions.
We study a natural fragmentation process of the so-called stable tree introduced by Duquesne and Le Gall, which consists in removing the nodes of the tree according to a certain procedure that makes the fragmentation self-similar with positive index. Explicit formulas for the semigroup are given, and we provide asymptotic results. We also give an alternative construction of this fragmentation, using paths of Levy processes, hence echoing the two alternative constructions of the standard additive coalescent by fragmenting the Brownian continuum random tree or using Brownian paths, respectively …
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of Aldous's beta-splitting models and Ford's alpha models for phylogenetic trees. This confirms in a strong way that the whole trees grow at the same speed as the mean height of a randomly chosen leaf.
We consider the model of Brownian motion indexed by the Brownian tree. For every $r\geq 0$ and every connected component of the set of points where Brownian motion is greater than $r$, we define the boundary size of this component, and we then show that the collection of these boundary sizes evolves when $r$ varies like a well-identified growth-fragmentation process. We then prove that the same growth-fragmentation process appears when slicing a Brownian disk at height $r$ and considering the perimeters of the resulting connected components.
Asymptotics for Beta-Splitting Trees via Homogeneous Fragmentations and Meromorphic Potential Theory
该研究将Beta分裂树嵌入齐次可交换碎形，通过次鞅位势测度推导各类高度渐近性质，解决了临界参数下最大高度极限的开放问题。
We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a random stable tree at random points, which split the tree into smaller subtrees. When coding each of these cutpoints by a chord in the unit disk, we separate the disk into smaller connected components, corresponding to the smaller subtrees of the initial tree. This geometric point of view allows us in particular to highlight a new relation between the Aldous-P…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate proportional to their sizes (isolation of connected component). A phase transition occurs when the isolation is able to stop the growth fragmentation process and cause extinction. When the process survives, the number of clusters increases exponentially and we prove that the normalized empirical measure of clusters a.s. converges to a limit law on recursive …
We consider a natural destruction process of an infinite recursive tree by removing each edge after an independent exponential time. The destruction up to time t is encoded by a partition $Π$(t) of N into blocks of connected vertices. Despite the lack of exchangeability, just like for an exchangeable fragmentation process, the process $Π$ is Markovian with transitions determined by a splitting rates measure r. However, somewhat surprisingly, r fails to fulfill the usual integrability condition for the dislocation measure of exchangeable fragmentations. We further observe that a time-dependent …
We are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size of the boundary grows. The limiting process is described using a self-similar growth-fragmentation process with explicit parameters. To this end, we introduce a branching peeling exploration of Boltzmann triangulations, which allows us to identify a crucial martingale involving the perimeters of cycles at given heights. We also use a recent result concerning …
A tightness criterion for fragmentations
本文提出一个简单准则判断随机碎片过程的紧性，并纠正了Berzunza-Ojeda和Holmgren (2023)中依赖错误引理的证明，同时验证了多种随机树模型碎片过程的紧性。
Ancestral diversity in fragmentation trees
研究碎片树中祖先多样性的渐进行为，通过一般k值和碎片树模型揭示相变现象。
Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree ${\cal T}^{\mathrm{br}}$. The associated cut tree cut$({\cal T}^{\mathrm{br}})$, introduced by Bertoin and Miermont [Ann Appl Probab, 23:1469--1493, 2013], is defined in a measurable way from the fragmentation process, describing the genealogy of the fragmentation, and is itself distributed as a Brownian CRT. In this work, we introduce a shuffle transform, which can be considered as the reverse of the map taking ${\cal T}^{\mathrm{br}}$ to cut$({\cal T}^{\mathrm{br}})$.
Perron--Frobenius theorem for a general tree-valued growth-fragmentation-isolation process
针对连续时间树值动力学模型，建立了Perron-Frobenius型定理，扩展了先前工作，不依赖均匀随机递归树性质。
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a general criterion for the existence of giant percolation clusters in large trees, which answers a question raised by David Croydon.
Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees
本文研究条件临界稳定 Galton–Watson 树随机删边所得碎裂过程，证明其重标度后收敛到 $\alpha$-稳定 Lévy 树的比例切割碎裂，并通过稳定 Lévy 游程划分给出构造，推广 Brownian CRT 结果。
A Markov Additive Process is a bi-variate Markov process $(ξ,J)=\big((ξ_t,J_t),t\geq0\big)$ which should be thought of as a multi-type Lévy process: the second component $J$ is a Markov chain on a finite space $\{1,\ldots,K\}$, and the first component $ξ$ behaves locally as a Lévy process, with local dynamics depending on $J$. In the subordinator-like case where $ξ$ is nondecreasing, we establish several results concerning the moments of $ξ$ and of its exponential functional $I_ξ=\int_{0}^{\infty} e^{-ξ_t}\mathrm dt,$ extending the work of Carmona et al., and Bertoin and Yor. We then apply the…
We consider a family of fragmentation processes where the rate at which a particle splits is proportional to a function of its mass. Let $F\_{1}^{(m)}(t),F\_{2}^{(m)}(t),...$ denote the decreasing rearrangement of the masses present at time $t$ in a such process, starting from an initial mass $m$. Let then $m\to \infty $. Under an assumption of regular variation type on the dynamics of the fragmentation, we prove that the sequence $(F\_{2}^{(m)},F\_{3}^{(m)},...)$ converges in distribution, with respect to the Skorohod topology, to a fragmentation with immigration process. This holds jointly w…
We propose a new, direct, correlation-free approach based on central moments of profiles to the asymptotics of width (size of the most abundant level) in some random trees of logarithmic height. The approach is simple but gives precise estimates for expected width, central moments of the width and almost sure convergence. It is widely applicable to random trees of logarithmic height, including recursive trees, binary search trees, quad trees, plane-oriented ordered trees and other varieties of increasing trees.
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of weights, the first order for the height of such trees has been recently established in [Electron. J. Probab. 26 (2021), Paper No. 80] by one of the authors. In this paper, we obtain the second and third orders in the asymptotic expansion of the height of weighted recursive trees, under similar assumptions. Our methods are inspired from those used to prove similar r…
Similarly as in (Blancas et al. 2018) where nested coalescent processes are studied, we generalize the definition of partition-valued homogeneous Markov fragmentation processes to the setting of nested partitions, i.e. pairs of partitions $(ζ,ξ)$ where $ζ$ is finer than $ξ$. As in the classical univariate setting, under exchangeability and branching assumptions, we characterize the jump measure of nested fragmentation processes, in terms of erosion coefficients and dislocation measures. Among the possible jumps of a nested fragmentation, three forms of erosion and two forms of dislocation are …
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability proportional to its weight. In the case where the total weight of the tree at step $n$ grows polynomially in $n$, we obtained in (Pain-Sénizergues 2022) an asymptotic expansion for the height of the tree, which falls into the university class of the maximum of branching random walks. In this paper, we consider the case of a total weight growing sub-polynomially in $n$ and obtain asymptotics for the height of the tree …
We consider the height process of a Levy process with no negative jumps, and its associated continuous tree representation. Using Levy snake tools developed by Duquesne and Le Gall, with an underlying Poisson process, we construct a fragmentation process, which in the stable case corresponds to the self-similar fragmentation described by Miermont. For the general fragmentation process we compute a family of dislocation measures as well as the law of the size of a tagged fragment. We also give a special Markov property for the snake which is interesting in itself.
By computations on generating functions, Szekeres proved in 1983 that the law of the diameter of a uniformly distributed rooted labelled tree with n vertices, rescaled by a factor n^{1/2} , converges to a distribution whose density is explicit. Aldous observed in 1991 that this limiting distribution is the law of the diameter of the Brownian tree. In our article, we provide a computation of this law which is directly based on the normalized Brownian excursion. Moreover, we provide an explicit formula for the joint law of the height and diameter of the Brownian tree, which is a new result.
Scaling limit of trees with vertices of fixed degrees and heights
本文研究了度数和高度固定的树的标度极限，通过凝聚过程分析路径收敛性，并应用于变化环境下的 Bienaymé-Galton-Watson 树。
Trees with power-like height dependent weight
本文研究高度依赖权重为幂函数$h^α$的平面有根随机树，通过分析生成函数的解析性质确定了总权重$Z_N$的渐近形式，并证明大尺寸局部极限与Uniform Infinite Planar Tree相同且与指数$α$无关。
Atypical Decay Rates for Atypical Heights in Random Recursive Trees
本文建立了随机递归树高度的大偏差概率，发现上尾呈多项式衰减，下尾呈拉伸指数衰减，且下尾具有异常前因子，其增长速度慢于任何n重迭代对数。
For a particular case of a branching random walk with lattice support, namely the Yule branching random walk, we prove that the distribution of the centred maximum oscillates around a distribution corresponding to a critical travelling wave in the following sense: there exist continuous functions $t \mapsto a_t$ and $x \mapsto \overlineϕ(x)$ such that: $$\lim_{t \rightarrow +\infty} \sup_{x \in \mathbb{R}} \vert \mathbb{P}(\overline{X}(t) \leq a_t +x )-\overlineϕ(x- \{ a_t +x\})\vert=0,$$ where $\{x\}=x-\lfloor x \rfloor$ and $\overline{X}(t)$ is the height of the Yule tree. We also shows that…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We provide a general criterion for the convergence of the rescaled cut-tree in the Gromov-Prohorov topology to an interval endowed with the Euclidean distance and a certain probability measure, when the underlying tree has a small height of order $o(\sqrt{n})$. In particular, we consider uniform random recursive trees, binary search trees, scale-free random trees an…
We develop some theory of spinal decompositions of discrete and continuous fragmentation trees. Specifically, we consider a coarse and a fine spinal integer partition derived from spinal tree decompositions. We prove that for a two-parameter Poisson--Dirichlet family of continuous fragmentation trees, including the stable trees of Duquesne and Le Gall, the fine partition is obtained from the coarse one by shattering each of its parts independently, according to the same law. As a second application of spinal decompositions, we prove that among the continuous fragmentation trees, stable trees a…
Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an arbitrary duration and give birth at arbitrary times during their life-time. In this paper, we are interested in the height and contour processes encoding a general CMJ tree. We show that the one-dimensional distribution of the height process can be expressed in terms of a random transformation of the ladder height process associated with the underlying Lukasiewicz path. As an application of this result, when edges of the tree are "short" we show that, asymptotically, (1) the height process is o…
We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the width (largest number of nodes in any level) and height (greatest level containing a node); the bounds are optimal up to constant factors in the exponent. Under the same conditioning, we also derive essentially optimal upper tail bounds for the number of nodes at level k, for 1 <= k <= n.
The stable fragmentation with index of self-similarity $α\in [-1/2,0)$ is derived by looking at the masses of the subtrees formed by discarding the parts of a $(1 + α)^{-1}$--stable continuum random tree below height $t$, for $t \geq 0$. We give a detailed limiting description of the distribution of such a fragmentation, $(F(t), t \geq 0)$, as it approaches its time of extinction, $ζ$. In particular, we show that $t^{1/α}F((ζ- t)^+)$ converges in distribution as $t \to 0$ to a non-trivial limit. In order to prove this, we go further and describe the limiting behavior of (a) an excursion of the…
Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states that in distribution its shape, more precisely its scaled height profile coincides asymptotically with the local time process of a Brownian excursion of duration 1. We give a proof of the result, which extends to the case of an infinite variance offspring distribution. This requires a different strategy, since in the infinite variance case there is no longer …
Partial orders and monotonicity of logarithmic depth and height in preferential attachment trees
本文研究了具有通用附加函数的偏好附加树，探讨了附加函数对树深度和高度的单调性影响，并引入了双尾序条件来补充生长比率主导条件，以证明期望单调性结果。
We provide the exact large-time behavior of the tail distribution of the extinction time of a self-similar fragmentation process with a negative index of self-similarity, improving thus a previous result on the logarithmic asymptotic behavior of this tail. Two factors influence this behavior: the distribution of the largest fragment at the time of a dislocation and the index of self-similarity. As an application we obtain the asymptotic behavior of all moments of the largest fragment and compare it to the behavior of the moments of a tagged fragment, whose decrease is in general significantly …
We code Galton-Walton trees by a continuous height process, in order to give a precise meaning to the convergence of forests of trees. This allows us to establish the convergence of the forest of genealogical trees of the branching process of a large population towards the genealogical trees of the limiting continuous state branching process (CSBP). The approximation considered here is new, compared to that which has been studied in Etienne Pardoux.
Height function localisation on trees
本文研究树上两种离散高度函数模型的局部化现象，证明随机同态模型高度方差有界，并完整分类有向树上单调高度函数的极值梯度吉布斯测度，描述局部化-去局部化转变。
We consider fragmentations of an R-tree $T$ driven by cuts arriving according to a Poisson process on $T \times [0, \infty)$, where the first co-ordinate specifies the location of the cut and the second the time at which it occurs. The genealogy of such a fragmentation is encoded by the so-called cut-tree, which was introduced by Bertoin and Miermont for a fragmentation of the Brownian continuum random tree. The cut-tree was generalised by Dieuleveut to a fragmentation of the $α$-stable trees, $α\in (1, 2)$, and by Broutin and Wang to the inhomogeneous continuum random trees of Aldous and Pitm…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is asymptotically normal in some cases but not in others, depending on the position of roots of a certain characteristic equation. This parallels the behaviour of discrete analogues with various random trees that have been studied in computer science. We give rigorous proofs of this phase transition, and add further details. The proof uses the contraction method…
To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a segment $T_1$ of length $a_1$. Previous works on that model focus on the influence of $(a_n)$ on the compactness and Hausdorff dimension of the limiting tree. Here we consider the cases where the sequence $(a_n)$ is regularly varying with a non-negative index, so that the sequence $(T_n)$ exploses. We determine the asymptotics of the height of $T_n$ and of the …
Fix a sequence c=(c_1,...,c_n) of non-negative integers with sum n-1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v_1,...,v_n so that for each 1 <= i <= n, v_i has exactly c_i children. Let T be a plane tree drawn uniformly at random from among all plane trees with child sequence c. In this note we prove sub-Gaussian tail bounds on the height (greatest depth of any node) and width (greatest number of nodes at any single depth) of T. These bounds are optimal up to the constant in the exponent when c satisfies c_1^2+...+c_n^2=O(n); the latter can be v…
We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive strictly stable Lévy process, jointly with the convergence of the renormalised range of the walk towards the real tree coded by the latter continuous-time height process.
We study fragmentation trees of Gibbs type. In the binary case, we identify the most general Gibbs-type fragmentation tree with Aldous' beta-splitting model, which has an extended parameter range $β>-2$ with respect to the ${\rm beta}(β+1,β+1)$ probability distributions on which it is based. In the multifurcating case, we show that Gibbs fragmentation trees are associated with the two-parameter Poisson--Dirichlet models for exchangeable random partitions of $\mathbb {N}$, with an extended parameter range $0\leα\le1$, $θ\ge-2α$ and $α<0$, $θ=-mα$, $m\in \mathbb {N}$.
The height of discrete-time critical beta-splitting trees
本文确定了离散时间临界β分裂树的高度一阶渐近，证明其与$(\nlog n)^2$之比几乎必然收敛于常数约0.976，并回答了Aldous和Janson的开放问题。
We study a fragmentation of the $\mathbf p$-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the $\mathbf p$-trees and trees which encode the fragmentation. We then use these results to study the fragmentation of the ICRTs (scaling limits of $\mathbf p$-trees) and give distributional correspondences between the ICRT and the tree encoding the fragmentation. The theorems for the ICRT extend the ones by Bertoin and Miermont [Ann. Appl. Probab., vol. 23(4), pp. 1469--1493, 2013] about the cut tree of the Brownian continuum random tree.
We consider branching processes with interaction in continuous time, both with values in the integers and in the reals (in the second case we restrict ourselves to continuous processes), which model the evolution of the size of a population. We assume that for large population size the interaction is of the type of a competition, which limits the size of the population. We discuss in which cases the interaction is strong enough so that the extinction time (or equivalently the height of the forest of genealogical trees) remains finite, as the number of ancestors tends to infinity, or even such …
We provide explicit conditions, in terms of the transition kernel of its driving particle, for a Markov branching process to admit a scaling limit toward a self-similar growth-fragmentation with negative index. We also derive a scaling limit for the genealogical embedding considered as a compact real tree.
We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that the size of any individual is a least the sum of the sizes of its children. Assuming that macroscopic size-splittings are rare, we describe the scaling limits of multi-type Markov Branching trees in terms of multi-type self-similar fragmentation trees. We observe three different regimes according to whether the probability of type change of a size-biased chil…
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local sense. Moderate as well as large deviations estimates are also derived. The proofs rely on the analysis (in the complex plane) of generating functions associated with trees of bounded height.
This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to admit a limiting theta distribution, both in a central and local sense, as well as obey moderate as well as large deviations estimates. The approximations obtained for height also yield the limiting distribution of the diameter of unrooted trees. The proofs rely on a precise analysis, in the complex plane and near singularities, of generating functions assoc…
Extremal separation times and clade-count dynamics in fragmentation trees: a freezing transition
本文研究同质碎片化树中$q$元子集的极端分离时间，证明其极限服从随机平移Gumbel分布，并揭示在阈值$\theta_*$处发生冻结相变，影响极端过程收敛及进化枝计数动力学。
We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical properties of trees and nodes in this heterogeneous forest, and find that the fraction of remaining nodes m characterizes the system in the limit N --> infty. We obtain analytically the size density phi_s …
This paper belongs to a series of papers aiming to investigate scaling limits of Crump-Mode-Jagers (CMJ) trees. In the previous two papers we identified general conditions under which CMJ trees belong to the universality class of Galton-Watson and Bellman-Harris processes. In this paper we identify general conditions for CMJ trees to belong to the universality class of binary, homogeneous CMJ trees. These conditions state that the offspring process should 'look like' a renewal process, and also that it should not accumulate too many atoms near the origin. We show in particular that any renewal…
We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to clog t, where t is the number of vertices, and c=c(k) is given as the solution to a transcendental equation. The equations are slightly different for the two types of process. In the limit as k-->oo the height of both processes is asymptotic to log t/(k log 2).
The Critical Beta-splitting Random Tree: Heights and Related Results
本文研究临界贝塔分裂随机树的连续时间模型，精确求出随机叶子时间高度和边高度的前两阶矩并证明中心极限定理，同时分析叶子高度相关性、分裂次数期望、树高度尾部界及随机子树大小的极限分布。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。