Zobrazeno 1 - 10
of 186
pro vyhledávání: '"Lovasz, Laszlo"'
Autor:
Bérczi, Kristóf, Gehér, Boglárka, Imolay, András, Lovász, László, Maga, Balázs, Schwarcz, Tamás
The study of matroid products traces back to the 1970s, when Lov\'asz and Mason studied the existence of various types of matroid products with different strengths. Among these, the tensor product is arguably the most important, which can be consider
Externí odkaz:
http://arxiv.org/abs/2411.02197
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from an analyti
Externí odkaz:
http://arxiv.org/abs/2406.08945
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of bounded degree g
Externí odkaz:
http://arxiv.org/abs/2406.08942
Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they found appl
Externí odkaz:
http://arxiv.org/abs/2406.04728
Autor:
Lovász, László
Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We prove that for
Externí odkaz:
http://arxiv.org/abs/2311.03868
We study SIR type epidemics on graphs in two scenarios: (i) when the initial infections start from a well connected central region, (ii) when initial infections are distributed uniformly. Previously, \'Odor et al. demonstrated on a few random graph m
Externí odkaz:
http://arxiv.org/abs/2304.11971
Autor:
Lovász, László
Submodular setfunctions play an important role in potential theory, and a perhaps even more important role in combinatorial optimization. The analytic line of research goes back to the work of Choquet; the combinatorial, to the work of Rado and Edmon
Externí odkaz:
http://arxiv.org/abs/2302.04704
Autor:
Pósfai, Márton, Szegedy, Balázs, Bačić, Iva, Blagojević, Luka, Abért, Miklós, Kertész, János, Lovász, László, Barabási, Albert-László
Publikováno v:
Nat. Phys. 20, 142--149 (2024)
The emergence of detailed maps of physical networks, like the brain connectome, vascular networks, or composite networks in metamaterials, whose nodes and links are physical entities, have demonstrated the limits of the current network science toolse
Externí odkaz:
http://arxiv.org/abs/2211.13265
We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure on maps o
Externí odkaz:
http://arxiv.org/abs/2206.04493