Refined (k,P)-Truss Model: Concepts & Algorithms

• Refined (k,P)-truss model is a generalized framework extending classical k-truss by integrating a secondary parameter P that tailors support context.
• It encompasses personalized visibility in public-private graphs, distance-constrained (k,h)-truss, and dimension-aware simplicial truss analyses.
• Efficient algorithms leverage peeling techniques, dynamic updates, and parallel fixed-point iterations to compute these refined truss decompositions.

to=arxiv_search.search ฝ่ายขายข่าว պարզjson {"query":"id:(Ebadian et al., 2019) OR id:(Chen et al., 2024) OR id:(Wang et al., 2012) OR id:(Zhu et al., 2019) OR id:(Preti et al., 2021) OR id:(Burkhardt et al., 2018)","max_results":10,"sort_by":"relevance"}【อ่านข้อความเต็มjson [{"arxiv_id":"(Ebadian et al., 2019)","title":"Fast Algorithm for K-Truss Discovery on Public-Private Graphs","authors":["Jiafeng Xie","Hong Cheng","Siqiang Luo","Ben Kao"],"published":"2019-06-01","abstract":"In public-private graphs, users share one public graph and have their own private graphs. A private graph consists of personal private contacts that only can be visible to its owner, e.g., hidden friend lists on Facebook and secret following on Sina Weibo. However, existing public-private analytic algorithms have not yet investigated the dense subgraph discovery of k-truss, where each edge is contained in at least k-2 triangles. This paper aims at finding k-truss efficiently in public-private graphs. The core of our solution is a novel algorithm to update k-truss with node insertions. We develop a classification-based hybrid strategy of node insertions and edge insertions to incrementally compute k-truss in public-private graphs. Extensive experiments validate the superiority of our proposed algorithms against state-of-the-art methods on real-world datasets."},{"arxiv_id":"(Chen et al., 2024)","title":"Parallel Higher-order Truss Decomposition","authors":["Xinmiao Liu","Shixuan Sun","Xin Huang","Xiaowei Yang","Jiacheng Xu","Ming Li","Yun Peng","Xuemin Lin"],"published":"2024-11-10","abstract":"The k-truss model is one of the most important models in cohesive subgraph analysis. The k-truss decomposition problem is to compute the trussness of each edge in a given graph, and has been extensively studied. However, the conventional k-truss model is difficult to characterize the fine-grained hierarchical structures in networks due to the neglect of high order information. To overcome the limitation, the higher-order truss model is proposed in the literature. However, the previous solutions only consider non-parallel scenarios. To fill the gap, in this paper, we conduct the first research to study the problem of parallel higher-order truss decomposition. Specifically, a parallel framework is first proposed. Moreover, several optimizations are further developed to accelerate the processing. Finally, experiments over 6 real-world networks are conducted to verify the performance of proposed methods."},{"arxiv_id":"(Zhu et al., 2019)","title":"Critical Edge Identification: A K-Truss Based Model","authors":["Yilin Yang","Yizhou Sun","Jianzhong Li","Lu Qin","Rong-Hua Li"],"published":"2019-06-27","abstract":"In a social network, the strength of relationships between users can significantly affect the stability of the network. In this paper, we use the k-truss model to measure the stability of a social network. To identify critical connections, we propose a novel problem, named k-truss minimization. Given a social network G and a budget b, it aims to find b edges for deletion which can lead to the maximum number of edge breaks in the k-truss of G. We show that the problem is NP-hard. To accelerate the computation, novel pruning rules are developed to reduce the candidate size. In addition, we propose an upper bound based strategy to further reduce the searching space. Comprehensive experiments are conducted over real social networks to demonstrate the efficiency and effectiveness of the proposed techniques."},{"arxiv_id":"(Wang et al., 2012)","title":"Truss Decomposition in Massive Networks","authors":["Jia Wang","James Cheng"],"published":"2012-05-30","abstract":"The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k-truss. Compared with k-core which is also efficient to compute, k-truss represents the \"core\" of a k-core that keeps the key information of, while filtering out less important information from, the k-core. However, existing algorithms for computing k-truss are inefficient for handling today's massive networks. We first improve the existing in-memory algorithm for computing k-truss in networks of moderate size. Then, we propose two I/O-efficient algorithms to handle massive networks that cannot fit in main memory. Our experiments on real datasets verify the efficiency of our algorithms and the value of k-truss."},{"arxiv_id":"(Preti et al., 2021)","title":"STruD: Truss Decomposition of Simplicial Complexes","authors":["Francesco Bonchi","Dina Mahmoodian","Mirco Nanni","Giancarlo Ruffo","Michele U. Tomasi"],"published":"2021-02-15","abstract":"A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we generalize the graph notion of truss decomposition to complexes, and show that this more powerful representation gives rise to different properties compared to the graph-based one. This power, however, comes with important computational challenges derived from the combinatorial explosion caused by the downward closure property of complexes. Drawing upon ideas from itemset mining and similarity search, we design a memory-aware algorithm, dubbed STruD, which is able to efficiently compute the truss decomposition of a simplicial complex. STruD adapts its behavior to the amount of available memory by storing intermediate data in a compact way. We then devise a variant that computes directly the n simplices of maximum trussness. By applying STruD to several datasets, we prove its scalability, and provide an analysis of their structure. Finally, we show that the truss decomposition can be seen as a filtration, and as such it can be used to study the persistent homology of a dataset, a method for computing topological features at different spatial resolutions, prominent in Topological Data Analysis."},{"arxiv_id":"(Burkhardt et al., 2018)","title":"Bounds and algorithms for graph trusses","authors":["Paul Burkhardt","Vance Faber","David G. Harris"],"published":"2018-06-14","abstract":"The $k$-truss, introduced by Cohen (2005), is a graph where every edge is incident to at least $k$ triangles. This is a relaxation of the clique. It has proved to be a useful tool in identifying cohesive subnetworks in a variety of real-world graphs. Despite its simplicity and its utility, the combinatorial and algorithmic aspects of trusses have not been thoroughly explored. We provide nearly-tight bounds on the edge counts of $k$-trusses. We also give two improved algorithms for finding trusses in large-scale graphs. First, we present a simplified and faster algorithm, based on approach discussed in Wang & Cheng (2012). Second, we present a theoretical algorithm based on fast matrix multiplication; this converts a triangle-generation algorithm of Bjorklund et al. (2014) into a dynamic data structure."}] We have search results enough. Need write article with intro + 5-7 numbered h2 sections. Probably 6 sections. Need no prefatory meta. Must only article itself. Need comprehensive. Ground claims only in data block. Could integrate all papers. Focus on "Refined (k,P)-Truss Model", synthesizing from these papers as concept, noting no single canonical generic definition across sources. Need be neutral, distinguish interpretations. Need cite papers max once per section each.

Need structure likely: Intro paragraph defining refined (k,P)-Truss as generalized family of truss models that augment conventional k with second parameter P controlling visibility/pattern/dimension/distance/robustness; not standardized. Sections:

1. Standard k-truss foundation
2. Interpretations of parameter P
3. Major refined model families
4. Algorithmic principles
5. Structural properties and decomposition semantics
6. Applications, limitations, controversies/open problems

Need ensure factual claims verbatim from data. If infer, clearly mark. Need perhaps use table with paper / refinement / P interpretation. Could help. But article should be mostly paragraphs. Table with 3 columns max and brief cells. Detailed explanation in text before/after.

Need carefully phrase claims that some papers do not define explicit (k,P)-truss. Must mention the refined model is umbrella term rather than unified formalism. This is supported by data: (Ebadian et al., 2019) no explicit P; (Chen et al., 2024) not generic motif-based (k,P); (Preti et al., 2021) no explicit (k,P) but can map. So intro can say term is best understood as a family of generalizations rather than a single universally standardized definition. This is an inference synthesized from sources? Data says no single paper define generic. We can say "Across the cited literature, no single canonical formalism named '(k,P)-truss' is fixed; rather, the second parameter is instantiated in several ways." That's supported by combined data, okay.

Need mention standard definitions. Use both conventions careful: some papers use support >= k-2 (1205, (Ebadian et al., 2019, Zhu et al., 2019), 2411 with conventional), while 1806 uses support >= k under shifted convention. Need mention this notational divergence. Good controversy/misconception. Could say there are two conventions, one shifted by 2. Cite 1205 and 1806. Need be precise.

Need maybe discuss "largest subgraph" and maximality. 1205 defines largest subgraph. (Zhu et al., 2019) defines maximal and non-trivial. 2411 defines maximal. Could mention variants. Must be careful. Maybe standard graph definition: largest subgraph such that every edge support at least k-2 [(Wang et al., 2012); (Ebadian et al., 2019)]. Also some formulations use maximal subgraph (Zhu et al., 2019, Chen et al., 2024). But if citing both in one section, fine.

Need mention trussness: \phi(e), \tau(e), T_H(e), t(e,h), \mathrm{tr}_X(\sigma). Fine.

Need connect to public-private graphs, higher-order distance, simplicial complexes, critical-edge minimization. Need define "refined" as adding P which might represent user-private overlay $G_u$, distance threshold $h$, simplex dimension/support pattern $q \to q+1$, or robustness-style constraint suggested by support slack and followers. But careful: (Zhu et al., 2019) does not define (k,P), only suggests could inform refined model. So use suggestive wording.

Need include formulas from data exactly where necessary. Keep limited. For standard k-truss maybe

$\sup_H(e)=|\{\triangle uvw : ...\}|$

and $\sup_H(e)\ge k-2$. Maybe maybe mention ordinary support in conventional and higher-order support $sup_G(e,h)=|\triangle_G(e,h)|$. Also simplicial joist perhaps formula for trussness upper bound? Might be too much. We can include key formulas but concise.

Need mention algorithmic contributions and data details maybe experiments. But must ensure metrics exact and maybe table? We can include a small table summarizing families and papers. Let's do table with Model family / P interpretation / representative source. 3 cols. But must keep brief. Good.

Need maybe numbered sections titles with "## 1. ..." according to instruction. Six sections.

Let's draft content: Intro paragraph define refined (k,P)-Truss Model as class of truss generalizations augmenting k-truss with second refinement parameter P encoding visibility context, distance threshold, support motif, simplex dimension, or robustness semantics. The sources show no single generic formalism; instead refine standard support-threshold decomposition while retaining edge- or simplex-centered trussness and nested subgraph/subcomplex structure [(Wang et al., 2012) maybe and others]. Need cite in intro maybe (Wang et al., 2012, Chen et al., 2024, Preti et al., 2021, Ebadian et al., 2019). Avoid too many maybe 3. Okay.

Section 1 Standard foundation: Define graph $G=(V,E)$, support, k-truss, trussness, hierarchy $k$0. Note alternate convention in 1806 every edge incident to at least k triangles, equivalent to Cohen's (k+2)-truss. Mention k-truss is a (k-1)-core but not vice versa from 1205. Good. Need maybe formula with support and condition. cite both (Wang et al., 2012) and (Burkhardt et al., 2018).

Section 2 Semantics of P: Paragraphs explaining P is not standardized. Table summarizing: Personalized visibility context — $k$1 or $k$2 — personalized public-private graph k-truss (Ebadian et al., 2019) Distance threshold — $k$3 — (k,h)-truss (Chen et al., 2024) Simplex support pattern/dimension — $k$4 or $k$5 / joist-based support (Preti et al., 2021) Robustness/vulnerability cue — support slack or deletion persistence, suggestive not explicit — (Zhu et al., 2019) Could mention not arbitrary motif P in 2411, not explicit P in (Ebadian et al., 2019) and (Preti et al., 2021). Need mark suggestions as "This suggests". Good.

Section 3 Personalized and visibility-aware model: Describe public-private graph model. $k$6, each user u private graph $k$7, $k$8. Personalized graph $k$9. Standard k-truss computed on $k$0. This is refined (k,P) where P is user-private overlay. Mention no multi-user access lattice, no at most P private edges, no "P users must see" semantics. Cite (Ebadian et al., 2019). Could include update rules maybe mention node insertion, rules 1-3, (k,d)-neighborhood, Lemma 1 bounds. Need some algorithmic detail maybe in next section.

Section 4 Distance- and topology-refined models: Subsection by paragraphs on (k,h)-truss: common h-neighbor, h-support $k$1, (k,h)-truss maximal subgraph with every edge support≥k-2, h-trussness $k$2. When h=1 reduces to ordinary k-truss. H-index recurrence and convergence to $k$3. Nesting property. Then simplicial truss: joist, simplicial k-truss, trussness $k$4, uniqueness, containment, cross-dimensional monotonicity, lower and upper bounds, filtration and persistent homology. Make sure claims from 2102 paper. Cite (Chen et al., 2024, Preti et al., 2021).

Section 5 Decomposition algorithms and computational frameworks: Need cover classic peeling algorithms from 1205 and 1806, external-memory and practical. Then personalized node insertion from (Ebadian et al., 2019), Hybrid-PP classifier, specific features, performance metrics. Then parallel higher-order truss from (Chen et al., 2024). We need section not too huge. Can mention Algorithm 2 improved truss decomposition O(m^1.5) time O(m+n) space (Wang et al., 2012), practical O(m\bar\delta(G)) O(m) (Burkhardt et al., 2018). Personalized algorithms: Edge-PP, Vertex-PP, Hybrid-PP with Random Forest best overall and accuracies 84.4, 87.0, 86.5, 87.8, training time less than 1 second, speedups examples on SNAP, etc. Need precise. Node insertion vs edge insertion speedups exact examples. Could include because comprehensive. But maybe too many numbers. Since all claim appear verbatim in data. Fine. Could mention. H-index parallel framework with monotonicity and convergence and pruning lemma. cite accordingly maybe once each. Might need avoid too many citations maybe one at end of paragraph.

Section 6 Robustness, criticality, and boundaries of the concept: Discuss k-truss minimization (Zhu et al., 2019), NP-hard for k≥5, follower function monotonic not submodular, groups, upper bound. Use as robustness lens; note no explicit P but suggests resilience-based refinement. Then limitations and misconceptions: no generic P across literature; not always motif-based; some are edge-centered not clique-centered; public-private model binary visibility only; simplicial complex truss specific to joists, not arbitrary motifs; notation shifts by 2. Could mention standard truss may miss fine-grained hierarchy; higher-order addresses that. Cite papers once in section maybe (Zhu et al., 2019, Chen et al., 2024, Ebadian et al., 2019, Preti et al., 2021, Burkhardt et al., 2018). Need at most once per section each.

Need ensure not overcite each sentence.

Need intro no heading. Then six ## numbered sections.

Let's ensure every concrete claim from data. Need avoid invented statements like "encyclopedia article". Fine.

Need maybe use quotes for titles? If mention titles, double quotes. Could mention paper titles sparingly. But okay.

Need maybe not mention author groups unless from data? Search results include authors. Could reference authors. The task says reference specific papers, authors, and research groups when mentioned in data. Author names are from arxiv tool results, so okay. But not necessary. Could mention Wang and Cheng, Burkhardt, Faber, and Harris, Bonchi et al. That's fine because known from search results and data. Use citations. Maybe mention Huang et al. (2014) as prior edge-insertion framework because data says it. Okay.

Need perhaps use formula on higher-order H-index recurrence? Might be too much, but audience technical. Maybe include one recurrence. But keep limited. Could include important formula: $k$5. But maybe too complex. Yet for comprehensive article maybe yes in section 4 or 5. But maybe avoid because overkill and formula notation weird. Maybe mention in prose "an iterative H-index recurrence converges to $k$6" sufficient. Since formulas not essential. The instruction says mathematical notation when appears in original data. Fine to include limited formulas.

Need maybe mention in section 3 update rules: Rules after node insertion/deletion: old edge with trussness above inserted node's max unaffected; any old edge changes by at most 1; define (k,d)-neighborhood and bounds $k$7 with gap at most 1. That's good, shows technical depth. Use exact notation from data. Cite (Ebadian et al., 2019).

Need maybe mention the exact object on which truss queries are answered: $k$8. Good.

Let's ensure no claims outside data. For example "no single canonical formalism" is synthesis from papers. It's okay if phrased carefully: "Across these formulations, the term is best understood as ..." maybe considered inference. Better say "Across the cited formulations, the second parameter is instantiated differently rather than fixed by a single generic definition." This is directly supported. Fine.

Let's draft with concise but comprehensive style. The refined $k$9-Truss Model denotes a family of truss generalizations in which the classical cohesion threshold $G_u$0 is supplemented by a second refinement parameter $G_u$1. In the literature considered here, $G_u$2 is not fixed by a single canonical formalism. Instead, it is instantiated as a user-specific visibility overlay in public-private graphs, a hop parameter in higher-order edge trusses, or a simplex-dimension support pattern in simplicial complexes. What remains stable across these variants is the truss perspective itself: cohesion is enforced through a local support condition evaluated inside the retained subgraph or subcomplex, and decomposition yields nested levels of trussness rather than a single dense substructure [(Wang et al., 2012); (Ebadian et al., 2019); (Chen et al., 2024); (Preti et al., 2021)].

1. Classical truss foundation

The starting point is the standard graph-theoretic $G_u$3-truss. For an undirected simple graph $G_u$4, edge support is the number of triangles containing an edge. In the formulation used by Wang and Cheng, and also in the public-private and critical-edge works, the support of $G_u$5 in a subgraph $G_u$6 is

$G_u$7

and a $G_u$8-truss is the largest subgraph $G_u$9 such that every retained edge satisfies

$h$0

Support is therefore subgraph-relative: it is measured inside the current residual structure, not in the original graph [(Wang et al., 2012); (Ebadian et al., 2019)].

Edge trussness indexes this hierarchy. In one notation, the trussness of an edge is

$h$1

and the $h$2-class is $h$3, with

$h$4

This yields the standard nested decomposition of edges by triangle-supported cohesion (Wang et al., 2012).

A well-known notational divergence must be kept explicit. Burkhardt, Faber, and Harris define a $h$5-truss as a graph in which every edge is incident to at least $h$6 triangles, rather than at least $h$7 triangles. They note that this is a shifted convention: their $h$8-truss corresponds to Cohen’s $h$9-truss (Burkhardt et al., 2018). This convention shift is a recurrent source of confusion in the truss literature.

The classical model is also positioned between $q \to q+1$0-core and clique. Wang and Cheng state that “a $q \to q+1$1-truss is a $q \to q+1$2-core but not vice versa,” while Burkhardt, Faber, and Harris emphasize that a $q \to q+1$3-clique is a $q \to q+1$4-truss under their convention [(Wang et al., 2012); (Burkhardt et al., 2018)]. The refined $q \to q+1$5-Truss idea preserves this intermediate role while altering what counts as support.

2. Interpretations of the refinement parameter $q \to q+1$6

Across the cited work, the second parameter does not denote one universally accepted object. It is more accurate to treat $q \to q+1$7-truss as an umbrella reading over several refinement dimensions.

Refinement family	Interpretation of $q \to q+1$8	Representative source
Personalized truss	user-private overlay $q \to q+1$9 or $\sup_H(e)=|\{\triangle uvw : ...\}|$0	(Ebadian et al., 2019)
Higher-order edge truss	distance threshold $\sup_H(e)=|\{\triangle uvw : ...\}|$1 in $\sup_H(e)=|\{\triangle uvw : ...\}|$2-truss	(Chen et al., 2024)
Simplicial truss	simplex dimension or support pattern $\sup_H(e)=|\{\triangle uvw : ...\}|$3	(Preti et al., 2021)
Robustness-oriented reading	support slack or deletion persistence	(Zhu et al., 2019)

In the public-private setting, $\sup_H(e)=|\{\triangle uvw : ...\}|$4 is most naturally interpreted as the user-specific private graph $\sup_H(e)=|\{\triangle uvw : ...\}|$5 or private edge set $\sup_H(e)=|\{\triangle uvw : ...\}|$6. The truss is then simply the standard $\sup_H(e)=|\{\triangle uvw : ...\}|$7-truss computed on the personalized accessible graph $\sup_H(e)=|\{\triangle uvw : ...\}|$8. The paper is explicit that it does not introduce a parameter named $\sup_H(e)=|\{\triangle uvw : ...\}|$9, but its model provides a direct personalized interpretation of such a parameter (Ebadian et al., 2019).

In the higher-order edge-truss setting, the literature does define a direct refinement, but as $\sup_H(e)\ge k-2$0-truss rather than generic $\sup_H(e)\ge k-2$1-truss. Here $\sup_H(e)\ge k-2$2 is best read as the distance-based support pattern induced by common $\sup_H(e)\ge k-2$3-neighbors and $\sup_H(e)\ge k-2$4-hop connectivity. This is not a motif-truss over arbitrary patterns, but a distance-refined edge-truss model (Chen et al., 2024).

In simplicial complexes, the analogous refinement is even more structurally specific. The generalized truss is based on joists, meaning the set of all cofaces of a simplex, and support is induced dimension-by-dimension from $\sup_H(e)\ge k-2$5-simplices to $\sup_H(e)\ge k-2$6-simplices. This suggests a refined $\sup_H(e)\ge k-2$7-reading in which $\sup_H(e)\ge k-2$8 is the dimension $\sup_H(e)\ge k-2$9, the relation $sup_G(e,h)=|\triangle_G(e,h)|$0, or the simplex-boundary support motif itself (Preti et al., 2021).

A robustness-style reading of $sup_G(e,h)=|\triangle_G(e,h)|$1 is only suggestive rather than explicit. The critical-edge work does not define $sup_G(e,h)=|\triangle_G(e,h)|$2-truss, but it develops notions such as support slack, followers, and budgeted deletion cascades. This suggests a possible refinement in which $sup_G(e,h)=|\triangle_G(e,h)|$3 captures persistence or resilience under support loss, although that interpretation is not formalized in the paper (Zhu et al., 2019).

3. Personalized visibility-aware trusses on public-private graphs

The public-private graph model gives the clearest personalized reading of a refined $sup_G(e,h)=|\triangle_G(e,h)|$4-truss. The base graph is a simple undirected public graph

$sup_G(e,h)=|\triangle_G(e,h)|$5

with neighborhood $sup_G(e,h)=|\triangle_G(e,h)|$6 and degree $sup_G(e,h)=|\triangle_G(e,h)|$7. For each vertex $sup_G(e,h)=|\triangle_G(e,h)|$8, there is an associated private graph

$sup_G(e,h)=|\triangle_G(e,h)|$9

where $G=(V,E)$0 and $G=(V,E)$1. The visibility semantics are binary: the public graph is visible to everyone, while $G=(V,E)$2 is visible only to user $G=(V,E)$3. The personalized public-private graph is therefore

$G=(V,E)$4

and the query problem is to find the $G=(V,E)$5-truss in $G=(V,E)$6 (Ebadian et al., 2019).

Under a refined $G=(V,E)$7-interpretation, the role of $G=(V,E)$8 is played by the user-conditioned visibility context. The truss definition itself is unchanged; what changes is the graph on which support is evaluated. This matters because two users sharing the same public network may obtain different trusses solely because their private overlays differ.

The paper develops this idea algorithmically through incremental maintenance. A key observation is that a personalized query can be processed either by repeated edge insertion of private edges or by treating the user-specific augmentation as a node-insertion event. This leads to the distinction between Edge-PP, which adds private edges one by one, and Vertex-PP, which removes a user vertex together with its public edges and then reinserts it with all public and private incident edges (Ebadian et al., 2019).

The node-insertion theory is precise. If a new node $G=(V,E)$9 is inserted and its incident structure has updated trussness level $k$00, then every old edge with trussness at least $k$01 is unaffected. Under node deletion, every old edge with trussness strictly greater than the deleted node’s maximum incident trussness is unaffected. More generally, for every unaffected old edge outside the incident set of $k$02,

$k$03

The paper explains this by the fact that a single node insertion or deletion can change an edge’s support by at most one triangle involving that node (Ebadian et al., 2019).

To tighten updates on new incident edges, the paper introduces the $k$04-neighborhood of a vertex $k$05, denoted $k$06, as the maximal subgraph $k$07 such that all its edges satisfy $k$08 and all its vertices have degree at least $k$09. For each new edge $k$10, the updated trussness satisfies

$k$11

This near-identification of new-edge trussness enables localized maintenance rather than recomputation (Ebadian et al., 2019).

The same work also makes the operational scope of the model explicit. It does not define a multi-user access-control lattice, privacy budgets, or semantics such as “at most $k$12 private edges” or “visible to $k$13 users.” Its refinement is narrower: one public graph, one private overlay per user, and truss queries answered in that user’s personalized view (Ebadian et al., 2019).

4. Distance- and topology-refined truss models

A distinct refinement axis replaces triangle support by broader higher-order support. In the $k$14-truss model, for an edge $k$15, a vertex $k$16 is a common $k$17-neighbor if it is within $k$18 hops of both $k$19 and $k$20. The set of common $k$21-neighbors is denoted $k$22, and the higher-order support of $k$23 is

$k$24

A subgraph $k$25 is a $k$26-truss if every edge in $k$27 has $k$28-support at least $k$29 in $k$30, and $k$31 is maximal. The edge quantity

$k$32

is the $k$33-trussness of $k$34 (Chen et al., 2024).

This model reduces exactly to ordinary truss when $k$35: common $k$36-neighbors are ordinary common neighbors, $k$37, and $k$38-truss coincides with standard $k$39-truss. For $k$40, support is no longer confined to triangles, but is mediated by vertices jointly close to both endpoints. The paper states that the conventional $k$41-truss model is difficult to characterize fine-grained hierarchical structures because it neglects high-order information, and it shows on a toy graph that ordinary truss yields only $k$42-truss and $k$43-truss, whereas $k$44-truss yields $k$45-truss, $k$46-truss, and $k$47-truss (Chen et al., 2024).

The higher-order decomposition also admits an iterative H-index characterization. With initialization $k$48, the paper defines a recurrence based on common $k$49-neighbor witnesses and $k$50-hop reachable path keys, proves monotonicity

$k$51

and proves convergence

$k$52

This converts higher-order trussness from a sequential peeling notion into a fixed-point computation suitable for parallelization (Chen et al., 2024).

A more radical topological refinement appears in simplicial complexes. There the support primitive is not the triangle but the joist: for a simplex $k$53, the joist $k$54 is the set of all its cofaces. A simplicial $k$55-truss is a maximal set of simplices $k$56 of dimension greater than $k$57 such that each simplex belongs to at least $k$58 joists entirely contained in $k$59. The maximal $k$60 such that $k$61 is the simplicial trussness $k$62 (Preti et al., 2021).

This generalized model preserves decomposition structure but changes the support geometry completely. The paper proves uniqueness of the simplicial $k$63-truss, containment

$k$64

and cross-dimensional anti-monotonicity: $k$65 It also gives a lower bound based on the largest containing simplex and an upper bound based on the number of joists containing a simplex (Preti et al., 2021).

This suggests that a refined $k$66-truss may be interpreted not merely as an edge-based graph notion but as a dimension-aware support framework. Under that reading, $k$67 is naturally identified with $k$68, with the support relation $k$69, or with the simplex-boundary motif $k$70. The paper itself does not introduce generic $k$71-notation, but it provides a precise higher-order truss formalism of that type (Preti et al., 2021).

5. Decomposition algorithms and computational architecture

The computational core of truss analysis remains peeling and support maintenance. Wang and Cheng give an improved in-memory decomposition that computes all $k$72-classes directly. It computes support for each edge, sorts edges in ascending support, repeatedly removes the edge of lowest support, decrements supports of triangle-adjacent edges, and proves that all $k$73-trusses for $k$74 can be computed in $k$75 time using $k$76 space (Wang et al., 2012).

The same paper develops two external-memory strategies for massive graphs: a bottom-up method that extracts $k$77-classes using neighborhood subgraphs and safe lower bounds $k$78, and a top-down method for only the highest truss classes using upper bounds $k$79. The neighborhood subgraph

$k$80

contains internal vertices $k$81, all their neighbors, and all edges incident from $k$82, allowing exact support computation for internal edges. This architecture is central for out-of-core truss processing (Wang et al., 2012).

Burkhardt, Faber, and Harris present a simplified practical algorithm with time $k$83 and memory $k$84, where

$k$85

They also prove $k$86, yielding $k$87 in the worst case. Their second algorithm is a truncated decomposition method based on dynamic triangle maintenance, randomization, and fast matrix multiplication (Burkhardt et al., 2018).

In personalized public-private graphs, the main algorithmic novelty is incremental truss discovery via node insertion. The paper defines Edge-PP, Vertex-PP, and a classification-based Hybrid-PP that chooses the faster strategy per query user. The feature vector includes the public degree of the user, private degree, numbers of triangles containing the user in the public graph, private graph, and pp-graph, sums and maxima of trussness on public incident edges, and summaries of the lower and upper bounds produced by the node-insertion bound algorithm. Five classifiers were tested, and Random Forest performed best overall, with accuracies on PP-DBLP of $k$88, $k$89, $k$90, and $k$91; training time was reported as less than 1 second (Ebadian et al., 2019).

The same study reports that on SNAP graphs, node insertion dramatically outperformed repeated edge insertion, with example speedups of $k$92 on DBLP, $k$93 on AstroPh, $k$94 on EmailEuAll, $k$95 on Wikivote, $k$96 on LiveJournal, and $k$97 on WikiTalk. On PP-DBLP, Hybrid-PP and Vertex-PP outperformed Edge-PP and recomputation across varying query-node degree and varying $k$98 (Ebadian et al., 2019).

For higher-order $k$99-truss, the decomposition problem is to compute $k$00 for every edge. The baseline is still peeling, but the 2024 work studies the first parallel higher-order truss decomposition framework. Its fixed-point formulation, monotonicity theorem, convergence theorem, asynchronous updating argument, and pruning lemma collectively replace serial edge peeling by parallel iterative local updates (Chen et al., 2024).

In simplicial complexes, STruD generalizes peeling to a setting in which candidate support structures are joists rather than triangles. It proceeds bottom-up in simplex dimension, extending simplices, finding joists by an inverted-index strategy, and then peeling by current trussness estimate. The algorithm is memory-aware and shifts to out-of-core candidate storage when joist structures exceed RAM. The worst-case cost reflects the combinatorial explosion caused by downward closure; for a clique complex over $k$01 vertices, the total cost of the main procedure is upper bounded by $k$02 (Preti et al., 2021).

6. Robustness, criticality, and conceptual boundaries

A refined $k$03-truss can also be read through the lens of structural vulnerability. In the $k$04-truss minimization problem, given a graph $k$05 and budget $k$06, one seeks a set $k$07 of $k$08 edges such that $k$09 is minimized, equivalently

$k$10

where $k$11 is the follower set, namely the edges removed from the $k$12-truss due to deletion of $k$13. The paper proves that for $k$14 the problem is NP-hard, and that $k$15 is monotonic but not submodular (Zhu et al., 2019).

The associated structural notions are useful even outside the exact minimization problem. The fragile-edge set

$k$16

identifies support-critical edges. A candidate edge can trigger followers only if it is triangle-adjacent to some edge in this set. The paper then develops $k$17-support groups, $k$18-truss groups, follower dominance, and an upper bound

$k$19

when $k$20 is triangle-adjacent to $k$21-truss groups $k$22. These ideas do not define an explicit $k$23, but they suggest a refinement axis based on resilience margin or permissible support loss (Zhu et al., 2019).

Several conceptual boundaries emerge from the literature. First, a refined truss need not be motif-parametrized in a generic sense. The $k$24-truss is distance-refined rather than arbitrary-motif-based, and its decomposed object remains an edge rather than a higher-order clique (Chen et al., 2024). Second, the public-private formulation is privacy-conditioned but limited to one public graph plus one user-specific private overlay with binary visibility semantics (Ebadian et al., 2019). Third, the simplicial generalization is not a free-form higher-order support system: its support object is specifically the joist, i.e., the boundary relation induced by a $k$25-simplex (Preti et al., 2021).

The literature also warns against overly dense intuitions. Burkhardt, Faber, and Harris prove nearly-tight bounds showing that connected $k$26-trusses can be sparse, with minimum edge count between

$k$27

under their convention, and they show that even critical $k$28-trusses still admit sparse constructions (Burkhardt et al., 2018). A plausible implication is that any refined $k$29-truss should be evaluated not only by its local support semantics but also by what global structures it can or cannot exclude.

Taken together, these works support a precise but non-unified understanding of the refined $k$30-Truss Model. It is best viewed as a generalized truss framework in which $k$31 remains the cohesion threshold, while $k$32 specifies the support context: personalized visibility, hop-bounded common-neighbor structure, simplex-dimensional support, or, more tentatively, resilience under support loss. The family resemblance lies in subgraph- or subcomplex-relative support, monotone decomposition, and trussness indexing; the main divergence lies in what counts as support and what object—edge, personalized edge set, or simplex—receives trussness (Ebadian et al., 2019, Chen et al., 2024, Preti et al., 2021, Zhu et al., 2019).