Tootfinder

No exact results. Similar results found.

@arXiv_csDS_bot@mastoxiv.page
2025-06-06 07:17:29

Rumors on evolving graphs through stationary times
Vicenzo Bonasorte
https://arxiv.org/abs/2506.04386 https://arxiv.org/pdf/2506.0438…

Rumors on evolving graphs through stationary times
We study rumor spreading in dynamic random graphs. Starting with a single informed vertex, the information flows until it reaches all the vertices of the graph (completion), according to the following process. At each step $k$, the information is propagated to neighbors of the informed vertices, in the $k$-th generated random graph. The way this information propagates from vertex to vertex at each step will depend on the ``protocol". We provide a method based on strong stationary times to study…

@lalalalinder@mastodon.cloud
2025-06-07 08:48:27

Livebeeld van mijn crowdfundcampagne sinds ik het doel haalde.
Ik snap het wel, dat is nou eenmaal het effect van zo'n aftelbalk. Maar nu meer boeken verkopen = nu meer schrijftijd = een betere wereld. Help 'Leuk!' uit de bonusdip! Bestel het alsnog: https://www.voordekunst.nl/pr…

@arXiv_mathph_bot@mastoxiv.page
2025-06-06 07:31:15

Conformal nets from minimal W-algebras
Sebastiano Carpi, Tiziano Gaudio
https://arxiv.org/abs/2506.04270 https://arxiv.org/pdf/2506.0…

Conformal nets from minimal W-algebras
We show the strong graded locality of all unitary minimal W-algebras, so that they give rise to irreducible graded-local conformal nets. Among these unitary vertex superalgebras, up to taking tensor products with free fermion vertex superalgebras, there are the unitary Virasoro vertex algebras (N=0) and the unitary N=1,2,3,4 super-Virasoro vertex superalgebras. Accordingly, we have a uniform construction that gives, besides the already known N=0,1,2 super-Virasoro nets, also the new N=3,4 super…

@arXiv_mathAP_bot@mastoxiv.page
2025-06-06 09:47:36

This https://arxiv.org/abs/2406.11379 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On existence of Sadovskii vortex patch: A touching pair of symmetric counter-rotating uniform vortex
The Sadovskii vortex patch is a traveling wave for the two-dimensional incompressible Euler equations consisting of an odd symmetric pair of vortex patches touching the symmetry axis. Its existence was first suggested by numerical computations of Sadovskii in [J. Appl. Math. Mech., 1971], and has gained significant interest due to its relevance in inviscid limit of planar flows via Prandtl--Batchelor theory and as the asymptotic state for vortex ring dynamics. In this work, we prove the existen…

@arXiv_csRO_bot@mastoxiv.page
2025-06-06 09:42:54

This https://arxiv.org/abs/2409.17469 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

VertiSelector: Automatic Curriculum Learning for Wheeled Mobility on Vertically Challenging Terrain
Reinforcement Learning (RL) has the potential to enable extreme off-road mobility by circumventing complex kinodynamic modeling, planning, and control by simulated end-to-end trial-and-error learning experiences. However, most RL methods are sample-inefficient when training in a large amount of manually designed simulation environments and struggle at generalizing to the real world. To address these issues, we introduce VertiSelector (VS), an automatic curriculum learning framework designed to …

@Dragofix@mastodontti.fi
2025-06-05 21:20:07

Euroopan päästöjä vähennettävä Euroopassa – ilmastotieteilijöiltä varoitus vuoden 2040 ilmastotavoitteesta https://wwf.fi/uutiset/2025/06/euroopan-paastoja-vahennettava-euroopassa-ilmastotieteilijoi…

Euroopan päästöjä vähennettävä Euroopassa – ilmastotieteilijöiltä varoitus vuoden 2040 ilmastotavoitteesta
Jokaisen maan ja alueen tulisi tehdä oma osuutensa ilmastokriisin ratkaisemiseksi. Silti Euroopan komissio valmistelee mallia, jossa se voisi siirtää vastuuta rajojensa ulkopuolelle.

@arXiv_csDS_bot@mastoxiv.page
2025-06-06 09:34:36

This https://arxiv.org/abs/2411.04846 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

On the Complexity of 2-club Cluster Editing with Vertex Splitting
Editing a graph to obtain a disjoint union of s-clubs is one of the models for correlation clustering, which seeks a partition of the vertex set of a graph so that elements of each resulting set are close enough according to some given criterion. For example, in the case of editing into s-clubs, the criterion is proximity since any pair of vertices (in an s-club) are within a distance of s from each other. In this work we consider the vertex splitting operation, which allows a vertex to belong …

@arXiv_mathAP_bot@mastoxiv.page
2025-06-06 09:55:32

This https://arxiv.org/abs/2505.12240 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Dynamics and leapfrogging phenomena of multiple helical vortices for 3D incompressible Euler equations
In this paper, we investigate the time evolution of multiple interacted helical vortices without swirl for the incompressible Euler equations in $\mathbb R^3$. Assuming that the initial helical symmetric vorticity is concentrated within an $\ep$ neighborhood of $N$ distinct helices with vanishing mutual distance of order $O(\frac{1}{|\ln \ep|})$, and each vortex core possesses a vorticity mass of order $O(\frac{1}{|\ln \ep|^2})$, we show that as $\ep\to 0$, the motion of the…

@arXiv_csDS_bot@mastoxiv.page
2025-06-06 09:34:49

This https://arxiv.org/abs/2506.03612 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Connectivity-Preserving Minimum Separator in AT-free Graphs
Let $A$ and $B$ be disjoint, non-adjacent vertex-sets in an undirected, connected graph $G$, whose vertices are associated with positive weights. We address the problem of identifying a minimum-weight subset of vertices $S\subseteq V(G)$ that, when removed, disconnects $A$ from $B$ while preserving the internal connectivity of both $A$ and $B$. We call such a subset of vertices a connectivity-preserving, or safe minimum $A,B$-separator. Deciding whether a safe $A,B$-separator exists is NP-hard …